Rate-monotonic scheduling on uniform multiprocessors

Sanjoy K. Baruah; Joël Goossens

Rate-monotonic scheduling on uniform multiprocessors

Sanjoy K. Baruah
, Joël Goossens

Department of Computer Science & Engineering

Research output: Contribution to conference › Paper › peer-review

3 Scopus citations

Abstract

Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s × t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.

Original language	English
Pages	360-366
Number of pages	7
State	Published - 2003
Event	23th IEEE International Conference on Distributed Computing Systems - Providence, RI, United States Duration: May 19 2003 → May 22 2003

Conference

Conference	23th IEEE International Conference on Distributed Computing Systems
Country/Territory	United States
City	Providence, RI
Period	05/19/03 → 05/22/03

Keywords

Global scheduling
Periodic tasks
Rate-monotonic algorithm
Static priorities
Uniform multiprocessors

Cite this

@conference{bafff910ab914eeb8650e3a4da6ad697,

title = "Rate-monotonic scheduling on uniform multiprocessors",

abstract = "Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s × t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.",

keywords = "Global scheduling, Periodic tasks, Rate-monotonic algorithm, Static priorities, Uniform multiprocessors",

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

year = "2003",

language = "English",

pages = "360--366",

note = "23th IEEE International Conference on Distributed Computing Systems ; Conference date: 19-05-2003 Through 22-05-2003",

}

TY - CONF

T1 - Rate-monotonic scheduling on uniform multiprocessors

AU - Baruah, Sanjoy K.

AU - Goossens, Joël

PY - 2003

Y1 - 2003

N2 - Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s × t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.

AB - Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed s for t time units completes (s × t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.

KW - Global scheduling

KW - Periodic tasks

KW - Rate-monotonic algorithm

KW - Static priorities

KW - Uniform multiprocessors

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

M3 - Paper

AN - SCOPUS:0037968024

SP - 360

EP - 366

T2 - 23th IEEE International Conference on Distributed Computing Systems

Y2 - 19 May 2003 through 22 May 2003

ER -

Rate-monotonic scheduling on uniform multiprocessors

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this