A modified chain scheduling algorithm in data stream system
Shao Qian, LU Yili · 2010
For the applications that require real-time processing of high-volume data streams, the scheduling strategy must be adaptability. The Chain algorithm focuses solely on minimizing the maximum run-time memory usage, ignoring the important aspect of output latency. Our aim is to design a scheduling strategy that minimizes the maximum run-time system memory, while maintaining the output latency within specified bounds.