Title :
Scheduling algorithms for coalesced jobs in real-time systems
Author :
Chen, Min-Ih ; Chung, Jen-Yao ; Lin, Kwei-Jay
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
Abstract :
In real-time systems, jobs must be finished before their deadlines. When several jobs have similar requests, handling related operations together may improve both the response times of individual jobs and the total execution time of the system. This is because many jobs have common operations which can be performed only once if jobs are coalesced as a single job. Scheduling algorithms which use the technique of job coalescing to meet more job deadlines are studied. Optimal scheduling algorithms for different system models are investigated. Due to the high complexities of these optimal algorithms, several online heuristic algorithms and their performances are investigated
Keywords :
real-time systems; scheduling; coalesced jobs; real-time systems; scheduling algorithms; Computer science; Contracts; Delay; Heuristic algorithms; Optimal scheduling; Processor scheduling; Real time systems; Scheduling algorithm; System performance; Timing;
Conference_Titel :
Computer Software and Applications Conference, 1989. COMPSAC 89., Proceedings of the 13th Annual International
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-1964-3
DOI :
10.1109/CMPSAC.1989.65075
