作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (22): 155-157. doi: 10.3969/j.issn.1000-3428.2007.22.053

• 网络与通信 • 上一篇    下一篇

高速网络中数据流处理系统的适应性机制

陈磊松   

  1. (漳州师范学院物理与电子信息工程系,漳州 363000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-20 发布日期:2007-11-20

Adaptability Mechanism of Data Stream Processing System over High-speed Networks

CHEN Lei-song   

  1. (Dept. of Physical & Electronic Information Engineering, Zhangzhou Normal University, Zhangzhou 363000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-20 Published:2007-11-20

摘要: 高速网络环境中的数据是以数据流的形式存在,数据到达可能是突发性的,数据到达速率是随着时间变化的,对数据流的实时查询处理要能适应数据流的特性和网络的波动环境,该文对数据流查询计划中调度策略的适应性进行了分析,应用闭环控制理论和合适的调度算法,实现在降低运行时系统存储需求的同时保持较低的输出延迟,提高了适应性和查询的精度。

关键词: 数据流, 调度策略, 适应性, 控制理论

Abstract: For the applications that require real-time processing of high-volume data streams, the scheduling strategy must be adaptability. The Greedy algorithm focuses solely on minimizing the maximum run-time memory usage, ignoring the important aspect of output latency. This paper proposes a quality adaptation framework that adjusts the application behavior based on the control theory and designs a scheduling strategy that minimizes the maximum run-time system memory, while maintaining the output latency within specified bounds.

Key words: data stream, scheduling strategy, adaptability, control theory

中图分类号: