Limited-preemption scheduling on multiprocessors

Bipasa Chattopadhyay; Sanjoy Baruah

doi:10.1145/2659787.2659798

Limited-preemption scheduling on multiprocessors

Bipasa Chattopadhyay
, Sanjoy Baruah

Department of Computer Science & Engineering

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

10 Scopus citations

Abstract

Limited-preemption scheduling of sporadic task systems upon a multiprocessor platform is considered, when interprocessor migration is permitted. A schedulability test is derived by extending a prior schedulability test for fullypreemptive scheduling of sporadic task systems to the above-mentioned platform. We describe how the derived schedulability test can be used as a schedulability test for multiprocessor, multi-GPU systems with busy-waiting. Experimental evaluations are used to show the efficacy of the derived schedulability test in the context of the multiprocessor, multi-GPU system model.

Original language	English
Title of host publication	Proceedings of the 22nd International Conference on Real-Time Networks and Systems, RTNS 2014
Publisher	Association for Computing Machinery
Pages	225-234
Number of pages	10
ISBN (Electronic)	9781450327275
DOIs	https://doi.org/10.1145/2659787.2659798
State	Published - Oct 8 2014
Event	22nd International Conference on Real-Time Networks and Systems, RTNS 2014 - Versailles, France Duration: Oct 8 2014 → Oct 10 2014

Publication series

Name	ACM International Conference Proceeding Series
Volume	08-10-October-2014

Conference

Conference	22nd International Conference on Real-Time Networks and Systems, RTNS 2014
Country/Territory	France
City	Versailles
Period	10/8/14 → 10/10/14

Access to Document

10.1145/2659787.2659798

Cite this

@inproceedings{d0d6a224c7674b1c9876e4b9ee50ad1d,

title = "Limited-preemption scheduling on multiprocessors",

abstract = "Limited-preemption scheduling of sporadic task systems upon a multiprocessor platform is considered, when interprocessor migration is permitted. A schedulability test is derived by extending a prior schedulability test for fullypreemptive scheduling of sporadic task systems to the above-mentioned platform. We describe how the derived schedulability test can be used as a schedulability test for multiprocessor, multi-GPU systems with busy-waiting. Experimental evaluations are used to show the efficacy of the derived schedulability test in the context of the multiprocessor, multi-GPU system model.",

author = "Bipasa Chattopadhyay and Sanjoy Baruah",

note = "Publisher Copyright: Copyright {\textcopyright} 2014 ACM.; 22nd International Conference on Real-Time Networks and Systems, RTNS 2014 ; Conference date: 08-10-2014 Through 10-10-2014",

year = "2014",

month = oct,

day = "8",

doi = "10.1145/2659787.2659798",

language = "English",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery",

pages = "225--234",

booktitle = "Proceedings of the 22nd International Conference on Real-Time Networks and Systems, RTNS 2014",

}

Chattopadhyay, B & Baruah, S 2014, Limited-preemption scheduling on multiprocessors. in Proceedings of the 22nd International Conference on Real-Time Networks and Systems, RTNS 2014. ACM International Conference Proceeding Series, vol. 08-10-October-2014, Association for Computing Machinery, pp. 225-234, 22nd International Conference on Real-Time Networks and Systems, RTNS 2014, Versailles, France, 10/8/14. https://doi.org/10.1145/2659787.2659798

Limited-preemption scheduling on multiprocessors. / Chattopadhyay, Bipasa; Baruah, Sanjoy.
Proceedings of the 22nd International Conference on Real-Time Networks and Systems, RTNS 2014. Association for Computing Machinery, 2014. p. 225-234 (ACM International Conference Proceeding Series; Vol. 08-10-October-2014).

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

TY - GEN

T1 - Limited-preemption scheduling on multiprocessors

AU - Chattopadhyay, Bipasa

AU - Baruah, Sanjoy

PY - 2014/10/8

Y1 - 2014/10/8

N2 - Limited-preemption scheduling of sporadic task systems upon a multiprocessor platform is considered, when interprocessor migration is permitted. A schedulability test is derived by extending a prior schedulability test for fullypreemptive scheduling of sporadic task systems to the above-mentioned platform. We describe how the derived schedulability test can be used as a schedulability test for multiprocessor, multi-GPU systems with busy-waiting. Experimental evaluations are used to show the efficacy of the derived schedulability test in the context of the multiprocessor, multi-GPU system model.

AB - Limited-preemption scheduling of sporadic task systems upon a multiprocessor platform is considered, when interprocessor migration is permitted. A schedulability test is derived by extending a prior schedulability test for fullypreemptive scheduling of sporadic task systems to the above-mentioned platform. We describe how the derived schedulability test can be used as a schedulability test for multiprocessor, multi-GPU systems with busy-waiting. Experimental evaluations are used to show the efficacy of the derived schedulability test in the context of the multiprocessor, multi-GPU system model.

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

U2 - 10.1145/2659787.2659798

DO - 10.1145/2659787.2659798

M3 - Conference contribution

AN - SCOPUS:84985963157

T3 - ACM International Conference Proceeding Series

SP - 225

EP - 234

BT - Proceedings of the 22nd International Conference on Real-Time Networks and Systems, RTNS 2014

PB - Association for Computing Machinery

T2 - 22nd International Conference on Real-Time Networks and Systems, RTNS 2014

Y2 - 8 October 2014 through 10 October 2014

ER -

Limited-preemption scheduling on multiprocessors

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this