期刊文献+

数据流操作符实时调度策略研究 被引量:1

The Research Of Real-Time Scheduling For Data Stream Operators
下载PDF
导出
摘要 处理无限的连续数据流的应用日益流行,数据流的质量意识越来越多得到人们的重视,数据流上的连续查询系统必须是自适应的,在系统可用资源无法满足需求的时候,需要对操作符进行有效的调度,将讨论DSMS操作符实时调度的各个方面,并提出一种适合时间序列QoS要求的查询处理任务调度策略,实验结果证明所采用的调度策略是有效的。 The application that handles an infinite consecution data stream increasingly popular, the data stream of quality the consciousness gets people' s value more and more, Systems for processing continuous queries over data streams must be adaptive, Effective Scheduling is needed when the demands placed on the system can not be met in full given available resources. We will discuss all facts of Real-time Scheduling for DSMS operator, and Introduce a sort of Query processing tasks scheduling that is suitable for time-sequence QoS requirements, All of the Scheduling approach are implemented and experimental results demonstrate their effectiveness.
出处 《微计算机信息》 北大核心 2007年第33期220-222,共3页 Control & Automation
基金 国家自然科学基金资助项目(No:50674086)煤矿安全监测数据解析整合模型与应用研究
关键词 数据流 操作符 调度策略 服务质量 Data stream, operator, scheduling, QoS
  • 相关文献

参考文献5

二级参考文献25

  • 1王永吉,陈秋萍.单调速率及其扩展算法的可调度性判定[J].软件学报,2004,15(6):799-814. 被引量:50
  • 2邹恩轶.嵌入式Linux设计与应用[M].北京:清华大学出版社,2002..
  • 3Naghibzadeh M, Kim KH. A modified version of rate-monotonic scheduling algorithm and its efficiency assessment. In: Proc of the 7th IEEE Int'l Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002). San Diego: IEEE Computer Society Press, 2002. 289-294.
  • 4Baruah S, Howell R, Rosier L. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems: The Int'l Journal of Time-Critical Computing, 1990,2(4):301-324.
  • 5Liu CL, Layland JW. Scheduling algorithms for multiprogramming in a hard real time environment. Journal of ACM, 1973,20(1):46-61.
  • 6Burchard A. New strategies for assigning real-time tasks to multiprocessor systems. IEEE Trans on Computer, 1995,44(12):1429-1442.
  • 7Bini E, Buttazzo GC, Buttazzo G. A hyperbolic bound for the rate monotonic algorithm. In: Proc of the 13th Euromicro Conf on Real-Time Svstems. Delft: IEEE Comvuter Society Press, 2001.59-68.
  • 8Bini E, Buttazzo GC, Buttazzo G. Rate monotonic analysis: The hyperbolic bound. IEEE Trans on Computers, 2003,52(7):933-942.
  • 9Han C-C, Tyan HY. A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithm. In: Proc of the 18th IEEE Real-Time Systems Sym. Madrid: IEEE Computer Society Press, 1997. 36-45.
  • 10Park DW, Natarajan S. A generalized utilization bound test for fixed-priority real-time scheduling. In: Proc. of the 2nd Int'l Workshop on Real-Time Computing Systems and Applications. Tokyo, 1995.73-77.

共引文献23

同被引文献4

  • 1B. Babcock, S. Babu, and M. Datar, et al. Models and issues in data stream systems. In Proc. of the 2002 ACM Syrup, In Principles of Database Systems, pages 1 - 16, June 2002.
  • 2Jiang Q,Sharma C, Scheduling strategies for processing continuous queries over streams [C]. In Proc of 21st British National Conf on Databases Springer-Verlag, Pagesl6-30, 2004.
  • 3S. Viglas,J. F. Naughton: Rate-Based Optimization for Streaming Information Sources. SIGMOD Conference 2002.
  • 4Y Zhu,E Rundensteiner, G Heineman.Dynamic plan migration for continuous queries over data streams [C].In Proc of ACM SIGMOD 2004.New York:ACM Press,Pages 431-442, 2004.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部