DocumentCode :
2204486
Title :
A dynamic real-time scheduler for shared memory multiprocessors
Author :
Saez, Sebastien ; Vila, J. ; Crespo, A.
Author_Institution :
Dept. Ingenieria de Sistemas Computadores y Autom., Univ. Politecnica de Valencia, Spain
fYear :
1996
fDate :
12-14 Jun 1996
Firstpage :
158
Lastpage :
163
Abstract :
This paper presents a dynamic scheduling algorithm for multiprocessor systems which is guarantee-oriented. The algorithm is based on dynamic priority policy where priorities are inversely proportional to the latest start time (LST) of tasks. The paper includes a comparative study of the algorithm with other two well known dynamic algorithms: the earliest deadline first (EDF) and the least laxity first (LLF). The results show that LST is able to schedule some loads where EDF fails and reduces significantly the number of context switches with respect to LLF. The algorithm has been implemented and tested on a tool for multiprocessor analysis and simulation which is also presented in this paper
Keywords :
digital simulation; processor scheduling; real-time systems; shared memory systems; dynamic priority policy; dynamic real-time scheduler; dynamic scheduling algorithm; earliest deadline first; latest start time; least laxity first; shared memory multiprocessors; simulation; Costs; Dynamic scheduling; Heuristic algorithms; Multiprocessing systems; Processor scheduling; Real time systems; Scheduling algorithm; Switches; Testing; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems, 1996., Proceedings of the Eighth Euromicro Workshop on
Conference_Location :
L´Aquila
ISSN :
1068-3070
Print_ISBN :
0-8186-7496-2
Type :
conf
DOI :
10.1109/EMWRTS.1996.557847
Filename :
557847
Link To Document :
بازگشت