首页> 外文会议>ACM symposium on Applied Computing >Real-time scheduling for continuous queries with deadlines
【24h】

Real-time scheduling for continuous queries with deadlines

机译:使用截止日期的连续查询实时调度

获取原文

摘要

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.
机译:许多基于流的应用程序具有与时变数据流的连续查询的实时性能要求。为了解决这一挑战,提出了一个实时连续查询模型来处理多个查询时计时约束。在该模型中,通过操作员路径的一个元组的执行被建模为实时任务实例。提出了一个名为Op-EDF的细粒度调度策略,用于实时调度,该计划将操作员路径与在任何时隙时的等待元组的最早截止日期。实验结果表明,所提出的连续查询模型和调度算法在具有突发到达速率的数据流的实时查询处理中是有效的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号