Real-time scheduling for continuous queries with deadlines

  • Authors:
  • Li Ma;Xin Li;Yongyan Wang;Hongan Wang

  • Affiliations:
  • Chinese Academy of Sciences, Beijing, P.R. China and China University of Petroleum, Dongying, P.R. China and Graduate University, Beijing, P.R. China;Shandong University, Jinan, P.R. China;Chinese Academy of Sciences, Beijing, P.R. China;Chinese Academy of Sciences, Beijing, P.R. China

  • Venue:
  • Proceedings of the 2009 ACM symposium on Applied Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Many stream-based applications have real-time performance requirements for continuous queries over time-varying data streams. In order to address this challenge, a real-time continuous query model is presented to handle multiple queries with timing constraints. In this model, the execution of one tuple passing through an operator path is modeled as a real-time task instance. A fine-grained scheduling strategy named OP-EDF is proposed for real-time scheduling, which schedules the operator path with the earliest deadline of the waiting tuples at any time slot. The experimental results show that the proposed continuous query model and scheduling algorithm are effective in real-time query processing for data streams with bursty arrival rates.