DocumentCode :
3400746
Title :
Schedulability analysis of task scheduling in multiprocessor real-time systems using EDF algorithm
Author :
Behera, Lalatendu ; Mohapatra, Durga Prasad
Author_Institution :
Dept. of Comput. Sci. & Eng., Nat. Inst. of Technol., Rourkela, India
fYear :
2012
fDate :
10-12 Jan. 2012
Firstpage :
1
Lastpage :
9
Abstract :
Task scheduling in real-time systems is a concept by which we can schedule the tasks according to their priorities. In hard real-time systems, the task scheduling is more important due to the chance of system failure. We discuss EDF task scheduling which is an optimal technique for the uniprocessor systems. The existing result of the QPA algorithm was applied on the uniprocessor system to check the schedulability of the tasks in uniprocessor system. We have extended the QPA algorithm to check the schedulability of the task sets in multiprocessor systems. Our algorithm is based on QPA algorithm and the utilization balanced algorithm. The proposed algorithm checks the absolute deadlines much faster than the existing QPA algorithm for uniprocessor real-time systems.
Keywords :
embedded systems; multiprocessing systems; scheduling; task analysis; EDF algorithm; QPA algorithm; multiprocessor real-time systems; real-time systems; schedulability analysis; task scheduling; uniprocessor systems; utilization balanced algorithm; Algorithm design and analysis; Arrays; Computers; Job shop scheduling; Processor scheduling; Real time systems; EDF scheduling; Task scheduling; absolute deadline; multi-processor system; real-time systems; relative deadline;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communication and Informatics (ICCCI), 2012 International Conference on
Conference_Location :
Coimbatore
Print_ISBN :
978-1-4577-1580-8
Type :
conf
DOI :
10.1109/ICCCI.2012.6158912
Filename :
6158912
Link To Document :
بازگشت