Integrating Aperiodic and Recurrent Tasks on Fair-Scheduled Multiprocessors

Authors:
Anand Srinivasan;Philip Holman;James H. Anderson
Affiliations:
-;-;-
Venue:
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
Year:
2002

Citing 0
Cited 5

Minimizing migrations in fair multiprocessor scheduling of persistent tasks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Real Time Scheduling Theory: A Historical Perspective

Real-Time Systems
Minimizing migrations in fair multiprocessor scheduling of persistent tasks

Journal of Scheduling
A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees

Real-Time Systems
Optimal real-time scheduling for efficient aperiodic services on multiprocessors

PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two server implementations for multiplexing aperiodic and recurrent real-time tasks in fair-scheduled multiprocessor systems. We also provide admission-control tests for scheduling hard aperiodic tasks. Further, we consider several complexities, most of which arise because of the parallelism available in multiprocessor systems, and present techniques to handle them. Finally, we present experimental results that demonstrate the effectiveness of our implementations.