Partitioned EDF scheduling on a few types of unrelated multiprocessors

Authors:
Andreas Wiese;Vincenzo Bonifaci;Sanjoy Baruah
Affiliations:
Dipartimento di Ingegneria Informatica Automatica e Gestionale, Sapienza Università di Roma, Rome, Italy;Istituto di Analisi dei Sistemi ed Informatica, Consiglio Nazionale delle Ricerche, Rome, Italy;University of North Carolina at Chapel Hill, Chapel Hill, USA
Venue:
Real-Time Systems
Year:
2013

Citing 13
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Improved approximation schemes for scheduling unrelated parallel machines

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
On the complexity of integer programming

Journal of the ACM (JACM)
Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems

Real-Time Systems
Partitioning Real-Time Tasks among Heterogeneous Multiprocessors

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Approximation algorithms for scheduling unrelated parallel machines

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Assigning Real-Time Tasks on Heterogeneous Multiprocessors with Two Unrelated Types of Processors

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
The Design of Approximation Algorithms

The Design of Approximation Algorithms
A Lookup-Table Driven Approach to Partitioned Scheduling

RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
On the configuration-LP for scheduling on unrelated machines

ESA'11 Proceedings of the 19th European conference on Algorithms

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial-time approximation scheme (PTAS) is derived for the partitioned EDF scheduling of implicit-deadline sporadic task systems upon unrelated multiprocessor platforms that are comprised of a constant number of distinct types of processors. This generalizes earlier results showing the existence of polynomial-time approximation schemes for the partitioned EDF scheduling of implicit-deadline sporadic task systems on (1) identical multiprocessor platforms, and (2) unrelated multiprocessor platforms containing a constant number of processors.