Scheduling strategy in data stream processing systems
Chen Lei-song · Jisuanji gongcheng yu sheji · 2007
For the applications that require real-time processing of high-volume data streams,the scheduling strategy is prepared to deal gracefully with bursts in data arrival without compromising system performance.Chain algorithm focuses solely on minimizing the maxi-mum run-time memory usage,ignoring the important aspect of output latency.A subsection scheduling strategy with low latency on the foundation of the chain scheduling is presented,which combines the advantage of FIFO and greedy strategy,it performs well for mini-mizing run-time system memory requirements and low output latency.