Scheduling periodic continuous queries in real-time data broadcast environments

Hongya Wang, Yingyuan Xiao, Lihchyun Shu

研究成果: Article同行評審

12 引文 斯高帕斯(Scopus)


On-demand broadcast is a promising data dissemination approach in mobile computing environments thanks to its adaptability and scalability for large-scale and dynamic workload. An important class of emerging data broadcast applications needs to monitor multiple time-varying data items continuously to be kept aware of the up-to-date information. This paper investigates the broadcast schedule problem for disseminating timely data to periodic continuous queries, and a systematic and highly efficient solution for applications of this type is provided. In particular, we propose a novel measure, called Bandwidth Utilization, to quantify the minimum bandwidth demand of a periodic continuous query set. The timing predictability can be ensured if a set of periodic continuous queries passes a bandwidth utilization based schedulability test. The schedulability test techniques are also extended to deal with dynamic query arrival and departure. An efficient online scheduling algorithm, called RM-UO, is developed, which can fulfill the timing constraints combined with the proposed query release and deletion policies. To demonstrate the effectiveness of theoretical results, an illustrative algorithm implementation is presented along with comprehensive performance analysis. Simulation results show that our solution offers nice timing predictability whereas other comparable best effort scheduling algorithms such as SIN-α and DTIU experience different deadline miss ratios at different query workloads.

頁(從 - 到)1325-1340
期刊IEEE Transactions on Computers
出版狀態Published - 2012

All Science Journal Classification (ASJC) codes

  • 軟體
  • 理論電腦科學
  • 硬體和架構
  • 計算機理論與數學


深入研究「Scheduling periodic continuous queries in real-time data broadcast environments」主題。共同形成了獨特的指紋。