Partitioned EDF Scheduling for Multiprocessors using a C=D Scheme
A. Burns, R.I. Davis, P. Wang and F. Zhang
An EDF-based task-splitting scheme for scheduling multiprocessor systems is introduced in this paper. For $m$ processors at most $m-1$ tasks are split. The first part of a split task is constrained to have a deadline equal to its computation time. The second part of the task then has the maximum time available to complete its execution on a different processor. The advantage of this scheme is that no special run-time mechanisms are required and the overheads are kept to a minimum. Analysis is developed that allows the parameters of the split tasks to be derived. This analysis is integrated into the QPA algorithm for testing the schedulability of any task set executing on a single processor under EDF. Evaluation of the C=D scheme is provided via a comparison with a fully partitioned scheme and the theoretical maximum processor
BibTex Entry
@inproceedings{Burns2010e,
author = {A. Burns and R.I. Davis and P. Wang and F. Zhang},
booktitle = {Proceedings of 18th International Conference on Real-Time and Network Systems (RTNS)},
pages = {169-178},
title = {Partitioned EDF Scheduling for Multiprocessors using a C=D Scheme},
year = {2010}
}