Scheduling aperiodic tasks using total bandwidth server on multiprocessors

Shinpei Kato; Nobuyuki Yamasaki

doi:10.1109/EUC.2008.28

Scheduling aperiodic tasks using total bandwidth server on multiprocessors

Shinpei Kato, Nobuyuki Yamasaki

Department of Information and Computer Science

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

15 Citations (Scopus)

Abstract

This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that can be dispatched to any processors when they arrive, and (ii) the scheduling of aperiodic tasks that must be executed on particular processors on which they arrive. In order to improve the responsiveness to both types of aperiodic tasks, efficient dispatching and migration algorithms are designed based on the Earliest Deadline First (EDF) algorithm and the Total Bandwidth Server (TBS) algorithm. The effectiveness of the designed algorithms is evaluated through simulation studies.

Original language	English
Title of host publication	Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008
Pages	82-89
Number of pages	8
DOIs	https://doi.org/10.1109/EUC.2008.28
Publication status	Published - 2008 Dec 1
Event	5th International Conference on Embedded and Ubiquitous Computing, EUC 2008 - Shanghai, China Duration: 2008 Dec 17 → 2008 Dec 20

Publication series

Name	Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008
Volume	1

Other

Other	5th International Conference on Embedded and Ubiquitous Computing, EUC 2008
Country	China
City	Shanghai
Period	08/12/17 → 08/12/20

Fingerprint

Keywords

Earliest deadline first
Multiprocessors
Real-time scheduling
Response time
Total bandwidth server

ASJC Scopus subject areas

Computer Networks and Communications
Software
Communication

Cite this

Kato, S., & Yamasaki, N. (2008). Scheduling aperiodic tasks using total bandwidth server on multiprocessors. In Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008 (pp. 82-89). [4756324] (Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008; Vol. 1). https://doi.org/10.1109/EUC.2008.28

Scheduling aperiodic tasks using total bandwidth server on multiprocessors. / Kato, Shinpei; Yamasaki, Nobuyuki.

Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008. 2008. p. 82-89 4756324 (Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008; Vol. 1).

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

Kato, S & Yamasaki, N 2008, Scheduling aperiodic tasks using total bandwidth server on multiprocessors. in Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008., 4756324, Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008, vol. 1, pp. 82-89, 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008, Shanghai, China, 08/12/17. https://doi.org/10.1109/EUC.2008.28

@inproceedings{35d377a7a9ac4d9bb757e6649204594c,

title = "Scheduling aperiodic tasks using total bandwidth server on multiprocessors",

abstract = "This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that can be dispatched to any processors when they arrive, and (ii) the scheduling of aperiodic tasks that must be executed on particular processors on which they arrive. In order to improve the responsiveness to both types of aperiodic tasks, efficient dispatching and migration algorithms are designed based on the Earliest Deadline First (EDF) algorithm and the Total Bandwidth Server (TBS) algorithm. The effectiveness of the designed algorithms is evaluated through simulation studies.",

keywords = "Earliest deadline first, Multiprocessors, Real-time scheduling, Response time, Total bandwidth server",

author = "Shinpei Kato and Nobuyuki Yamasaki",

year = "2008",

month = dec

day = "1",

doi = "10.1109/EUC.2008.28",

language = "English",

isbn = "9780769534923",

series = "Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008",

pages = "82--89",

booktitle = "Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008",

note = "5th International Conference on Embedded and Ubiquitous Computing, EUC 2008 ; Conference date: 17-12-2008 Through 20-12-2008",

}

TY - GEN

T1 - Scheduling aperiodic tasks using total bandwidth server on multiprocessors

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that can be dispatched to any processors when they arrive, and (ii) the scheduling of aperiodic tasks that must be executed on particular processors on which they arrive. In order to improve the responsiveness to both types of aperiodic tasks, efficient dispatching and migration algorithms are designed based on the Earliest Deadline First (EDF) algorithm and the Total Bandwidth Server (TBS) algorithm. The effectiveness of the designed algorithms is evaluated through simulation studies.

AB - This paper presents real-time scheduling techniques for reducing the response time of aperiodic tasks scheduled with real-time periodic tasks on multiprocessor systems. Two problems are addressed in this paper: (i) the scheduling of aperiodic tasks that can be dispatched to any processors when they arrive, and (ii) the scheduling of aperiodic tasks that must be executed on particular processors on which they arrive. In order to improve the responsiveness to both types of aperiodic tasks, efficient dispatching and migration algorithms are designed based on the Earliest Deadline First (EDF) algorithm and the Total Bandwidth Server (TBS) algorithm. The effectiveness of the designed algorithms is evaluated through simulation studies.

KW - Earliest deadline first

KW - Multiprocessors

KW - Real-time scheduling

KW - Response time

KW - Total bandwidth server

UR - http://www.scopus.com/inward/record.url?scp=63149139138&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63149139138&partnerID=8YFLogxK

U2 - 10.1109/EUC.2008.28

DO - 10.1109/EUC.2008.28

M3 - Conference contribution

AN - SCOPUS:63149139138

SN - 9780769534923

T3 - Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008

SP - 82

EP - 89

BT - Proceedings of The 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008

T2 - 5th International Conference on Embedded and Ubiquitous Computing, EUC 2008

Y2 - 17 December 2008 through 20 December 2008

ER -

Access to Document

10.1109/EUC.2008.28