Paper Info
Title
A Lookup-Table Driven Approach to Partitioned Scheduling
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.
Year
DOI
Venue
2011
10.1109/RTAS.2011.32
IEEE Real-Time and Embedded Technology and Applications Symposium
Keywords
Field
DocType
partitioned preemptive edf scheduling,partitioned scheduling,lookup-table driven approach,lookup table,time polynomial,multiprocessor platform,task partitioning,identical multiprocessor platform,implicit-deadline sporadic task system,selected degree,task system,computational complexity,accuracy,resource management,algorithm design and analysis,polynomials
Metrical task system,Lookup table,Algorithm design,Polynomial,Scheduling (computing),Computer science,Parallel computing,Real-time computing,Multiprocessing,Computational complexity theory,Distributed computing,Bounded function
Conference
ISSN
Citations 
PageRank 
1545-3421
9
0.62
References 
Authors
6
2
Name
Order
Citations
PageRank
Bipasa Chattopadhyay1734.02
Sanjoy K. Baruah24664374.79