Title :
Bounding completion times of jobs with arbitrary release times and variable execution times
Author :
Sun, Jun ; Liu, Jane W S
Author_Institution :
Geoworks Inc., Berkeley, CA, USA
Abstract :
In many real-time systems, the workload can be characterized as a set of jobs with linear precedence constraints among them. Jobs often have variable execution times and arbitrary release times. We describe three algorithms that can be used to compute upper bounds on completion times of such jobs scheduled on a priority-driven basis. The algorithms have different performance and complexity. Simulation was performed to compare their performance
Keywords :
computational complexity; real-time systems; resource allocation; scheduling; software performance evaluation; arbitrary release times; complexity; job completion time bounding; linear precedence constraints; performance; priority-driven basis; real-time systems; scheduling; simulation; upper bounds; variable execution times; workload; Algorithm design and analysis; Computer science; Delay; Iterative algorithms; Processor scheduling; Real time systems; Scheduling algorithm; Sun; Timing; Upper bound;
Conference_Titel :
Real-Time Systems Symposium, 1996., 17th IEEE
Conference_Location :
Los Alamitos, CA
Print_ISBN :
0-8186-7689-2
DOI :
10.1109/REAL.1996.563692
