A Lookup-Table Driven Approach to Partitioned Scheduling

The partitioned preemptive EDF scheduling of implicitdeadline 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.

• Type: Journal
• Year: 2011
• Where: RTAS
• Authors: Bipasa Chattopadhyay, Sanjoy K. Baruah
• Keywords: Embedded Systems, Lookup Tables, Multiprocessor, RTAS 2011, Time Polynomial