DocumentCode
2158714
Title
A modified chain scheduling algorithm in data stream system
Author
Qian, Shao ; Lu, Yili
Author_Institution
Dept. of Comput. Sci. Inst., Coll. of traffic Manage. cadres, Beijing, China
Volume
4
fYear
2010
fDate
26-28 Feb. 2010
Firstpage
568
Lastpage
570
Abstract
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.
Keywords
data flow computing; query processing; scheduling; adaptability; data stream system; modified chain scheduling algorithm; output latency; real-time processing; run-time system memory; Application software; Computer network management; Computer science; Delay; Educational institutions; Processor scheduling; Real time systems; Runtime; Scheduling algorithm; Telecommunication traffic; Data stream system; Low latency; Modified chain algorithm; Scheduling strategy;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on
Conference_Location
Singapore
Print_ISBN
978-1-4244-5585-0
Electronic_ISBN
978-1-4244-5586-7
Type
conf
DOI
10.1109/ICCAE.2010.5451576
Filename
5451576
Link To Document