Title :
A Lookup-Table Driven Approach to Partitioned Scheduling
Author :
Chattopadhyay, Bipasa ; Baruah, Sanjoy
Author_Institution :
Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA
Abstract :
The partitioned preemptive EDF scheduling of implicit-deadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of accuracy, are pre-computed for the multiprocessor platform. By using these lookup tables, task partitioning can be performed in time polynomial in the representation of the task system being partitioned. Although the partitioning will not in general be optimal, the degree of deviation from optimality is bounded according to the degree of accuracy selected during the pre-computation of the lookup tables.
Keywords :
computational complexity; multiprocessing systems; processor scheduling; table lookup; identical multiprocessor platform; implicit-deadline sporadic task systems; lookup-table driven approach; partitioned preemptive EDF scheduling; task partitioning; time polynomial; Accuracy; Algorithm design and analysis; Partitioning algorithms; Polynomials; Processor scheduling; Program processors; Resource management;
Conference_Titel :
Real-Time and Embedded Technology and Applications Symposium (RTAS), 2011 17th IEEE
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-61284-326-1
DOI :
10.1109/RTAS.2011.32
