Deadline monotonic scheduling on uniform multiprocessors

Sanjoy Baruah; Joël Goossens

doi:10.1007/978-3-540-92221-6_8

Deadline monotonic scheduling on uniform multiprocessors

Sanjoy Baruah
, Joël Goossens

Department of Computer Science & Engineering

Research output: Contribution to journal › Conference article › peer-review

9 Scopus citations

Abstract

The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

Original language	English
Pages (from-to)	89-104
Number of pages	16
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5401 LNCS
DOIs	https://doi.org/10.1007/978-3-540-92221-6_8
State	Published - 2008
Event	12th International Conference on Principles of Distributed Systems, OPODIS 2008 - Luxor, Egypt Duration: Dec 15 2008 → Dec 18 2008

Access to Document

10.1007/978-3-540-92221-6_8

Cite this

@article{e1d3e0e3bc8e41d3a7a2064833342ddf,

title = "Deadline monotonic scheduling on uniform multiprocessors",

abstract = "The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.",

author = "Sanjoy Baruah and Jo{\"e}l Goossens",

year = "2008",

doi = "10.1007/978-3-540-92221-6\_8",

language = "English",

volume = "5401 LNCS",

pages = "89--104",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

note = "12th International Conference on Principles of Distributed Systems, OPODIS 2008 ; Conference date: 15-12-2008 Through 18-12-2008",

}

TY - JOUR

T1 - Deadline monotonic scheduling on uniform multiprocessors

AU - Baruah, Sanjoy

AU - Goossens, Joël

PY - 2008

Y1 - 2008

N2 - The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

AB - The scheduling of sporadic task systems upon uniform multiprocessor platforms using global Deadline Monotonic algorithm is studied. A sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, in the form of a processor speedup bound.

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

U2 - 10.1007/978-3-540-92221-6_8

DO - 10.1007/978-3-540-92221-6_8

M3 - Conference article

AN - SCOPUS:58849100040

SN - 0302-9743

VL - 5401 LNCS

SP - 89

EP - 104

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

T2 - 12th International Conference on Principles of Distributed Systems, OPODIS 2008

Y2 - 15 December 2008 through 18 December 2008

ER -

Deadline monotonic scheduling on uniform multiprocessors

Abstract

Access to Document

Other files and links

Fingerprint

Cite this