Partitioned Aperiodic Scheduling on Multiprocessors

Authors:
Björn Andersson;Tarek Abdelzaher;Jan Jonsson
Affiliations:
-;-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 4

Guaranteeing Response Times for Aperiodic Tasks in Global Multiprocessor Scheduling

Real-Time Systems
Exact admission-control for integrated aperiodic and periodic tasks

Journal of Computer and System Sciences
Slack-based multiprocessor scheduling of aperiodic real-time tasks

Real-Time Systems
Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

Proceedings of the 20th International Conference on Real-Time and Network Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.