By the same authors

From the same journal

Partitioned EDF scheduling for multiprocessors using a C=D task splitting

Research output: Contribution to journalArticlepeer-review

Standard

Partitioned EDF scheduling for multiprocessors using a C=D task splitting. / Burns, A.; Davis, R. I.; Wang, P.; Zhang, F.

In: Real-Time Systems Journal, Vol. 48, No. 1, 2012, p. 3-33.

Research output: Contribution to journalArticlepeer-review

Harvard

Burns, A, Davis, RI, Wang, P & Zhang, F 2012, 'Partitioned EDF scheduling for multiprocessors using a C=D task splitting', Real-Time Systems Journal, vol. 48, no. 1, pp. 3-33.

APA

Burns, A., Davis, R. I., Wang, P., & Zhang, F. (2012). Partitioned EDF scheduling for multiprocessors using a C=D task splitting. Real-Time Systems Journal, 48(1), 3-33.

Vancouver

Burns A, Davis RI, Wang P, Zhang F. Partitioned EDF scheduling for multiprocessors using a C=D task splitting. Real-Time Systems Journal. 2012;48(1):3-33.

Author

Burns, A. ; Davis, R. I. ; Wang, P. ; Zhang, F. / Partitioned EDF scheduling for multiprocessors using a C=D task splitting. In: Real-Time Systems Journal. 2012 ; Vol. 48, No. 1. pp. 3-33.

Bibtex - Download

@article{57e34e39c21f401ebaae22fb88ee2bef,
title = "Partitioned EDF scheduling for multiprocessors using a C=D task splitting",
abstract = "An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented 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. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the C=D scheme on Linux or via the Ada programming language are also discussed.",
author = "A. Burns and Davis, {R. I.} and P. Wang and F. Zhang",
year = "2012",
language = "Undefined/Unknown",
volume = "48",
pages = "3--33",
journal = "Real-Time Systems Journal",
number = "1",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Partitioned EDF scheduling for multiprocessors using a C=D task splitting

AU - Burns, A.

AU - Davis, R. I.

AU - Wang, P.

AU - Zhang, F.

PY - 2012

Y1 - 2012

N2 - An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented 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. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the C=D scheme on Linux or via the Ada programming language are also discussed.

AB - An EDF-based task-splitting scheme for scheduling multiprocessor systems is presented 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. Different heuristics for choosing the task to split are derived and evaluated. Issues pertaining to the implementation of the C=D scheme on Linux or via the Ada programming language are also discussed.

M3 - Article

VL - 48

SP - 3

EP - 33

JO - Real-Time Systems Journal

JF - Real-Time Systems Journal

IS - 1

ER -