A Lookup-Table Driven Approach to Partitioned Scheduling

Authors:
Bipasa Chattopadhyay;Sanjoy Baruah
Affiliations:
-;-
Venue:
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
Year:
2011

Citing 0
Cited 3

Partitioned EDF scheduling on a few types of unrelated multiprocessors

Real-Time Systems
Partitioning sporadic task systems upon memory-constrained multiprocessors

ACM Transactions on Embedded Computing Systems (TECS)
Partitioned EDF scheduling: a closer look

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

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.