The Partitioned Multiprocessor Scheduling of Sporadic Task Systems

Authors:
Sanjoy Baruah;Nathan Fisher
Affiliations:
University of North Carolina at Chapel Hill;University of North Carolina at Chapel Hill
Venue:
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Year:
2005

Citing 0
Cited 13

A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm

Real-Time Systems
M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms

Real-Time Systems
A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Efficiently migrating real-time systems to multi-cores

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Investigation of implementing a synchronization protocol under multiprocessors hierarchical scheduling

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Partitioning real-time systems on multiprocessors with shared resources

OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel

Proceedings of the 48th Design Automation Conference
Task synchronization and allocation for many-core real-time systems

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
The partitioned, static-priority scheduling of sporadic real-time tasks with constrained deadlines on multiprocessor platforms

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms

Journal of Experimental Algorithmics (JEA)
Assigning sporadic tasks to unrelated parallel machines

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform. Since the partitioning problem is NP-hard in the strong sense, this algorithm is unlikely to be optimal. A quantitative characterization of its worst-case performance is provided in terms of resource augmentation: it is shown that any set of sporadic tasks that can be partitioned among the processors of an m-processor identical multiprocessor platform will be partitioned by this algorithm on an m-processor platform in which each processor is (4 - 2/m) times as fast.