Dynamic scheduling of real-time tasks, by assignment

TitleDynamic scheduling of real-time tasks, by assignment
Publication TypeJournal Article
Year of Publication1998
AuthorsHamidzadeh, B., and Y. Atif
JournalIEEE Concurrency
Volume6
Pagination14–+
ISSN1092-3063
Abstract

Sequencing and assignment-are two important issues we need to address when scheduling real-time tasks on a multiprocessor architecture. Different problem representations can schedule such tasks, each emphasizing either a sequencing or assignment task. A sequence-oriented representation satisfies problem constraints by emphasizing the search for an appropriate tasks order, while an assignment-oriented representation emphasizes the search for an appropriate assignment of tasks. The authors introduce the RT-SADS algorithm, which uses an assignment-oriented representation to dynamically schedule tasks on the processors of a NUMA architecture. The proposed technique automatically controls and allocates the scheduling time to minimize the scheduling overhead and deadline violation of real-time tasks. The authors compare RT-SADS' performance with another dynamic algorithm that uses a sequence-oriented representation. The results show interesting performance tradeoffs among the candidate algorithms.

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia