The global feasibility and schedulability of general task models on multiprocessor platforms

Nathan Fisher; Sanjoy Baruah

doi:10.1109/ECRTS.2007.34

The global feasibility and schedulability of general task models on multiprocessor platforms

Nathan Fisher
, Sanjoy Baruah

Department of Computer Science & Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

Original language	English
Title of host publication	Proceedings - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007
Pages	51-60
Number of pages	10
DOIs	https://doi.org/10.1109/ECRTS.2007.34
State	Published - 2007
Event	19th Euromicro Conference on Real-Time Systems, ECRTS 2007 - Pisa, Italy Duration: Jul 4 2007 → Jul 6 2007

Publication series

Name	Proceedings - Euromicro Conference on Real-Time Systems
ISSN (Print)	1068-3070

Conference

Conference	19th Euromicro Conference on Real-Time Systems, ECRTS 2007
Country/Territory	Italy
City	Pisa
Period	07/4/07 → 07/6/07

Access to Document

10.1109/ECRTS.2007.34

Cite this

@inproceedings{22e6e8ab69504b56ae7c50d97cf0bcb4,

title = "The global feasibility and schedulability of general task models on multiprocessor platforms",

abstract = "Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.",

author = "Nathan Fisher and Sanjoy Baruah",

year = "2007",

doi = "10.1109/ECRTS.2007.34",

language = "English",

isbn = "0769529143",

series = "Proceedings - Euromicro Conference on Real-Time Systems",

pages = "51--60",

booktitle = "Proceedings - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007",

note = "19th Euromicro Conference on Real-Time Systems, ECRTS 2007 ; Conference date: 04-07-2007 Through 06-07-2007",

}

Fisher, N & Baruah, S 2007, The global feasibility and schedulability of general task models on multiprocessor platforms. in Proceedings - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007., 4271680, Proceedings - Euromicro Conference on Real-Time Systems, pp. 51-60, 19th Euromicro Conference on Real-Time Systems, ECRTS 2007, Pisa, Italy, 07/4/07. https://doi.org/10.1109/ECRTS.2007.34

The global feasibility and schedulability of general task models on multiprocessor platforms. / Fisher, Nathan; Baruah, Sanjoy.
Proceedings - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007. 2007. p. 51-60 4271680 (Proceedings - Euromicro Conference on Real-Time Systems).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The global feasibility and schedulability of general task models on multiprocessor platforms

AU - Fisher, Nathan

AU - Baruah, Sanjoy

PY - 2007

Y1 - 2007

N2 - Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

AB - Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

UR - https://www.scopus.com/pages/publications/35348876262

U2 - 10.1109/ECRTS.2007.34

DO - 10.1109/ECRTS.2007.34

M3 - Conference contribution

AN - SCOPUS:35348876262

SN - 0769529143

SN - 9780769529141

T3 - Proceedings - Euromicro Conference on Real-Time Systems

SP - 51

EP - 60

BT - Proceedings - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007

T2 - 19th Euromicro Conference on Real-Time Systems, ECRTS 2007

Y2 - 4 July 2007 through 6 July 2007

ER -

The global feasibility and schedulability of general task models on multiprocessor platforms

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this