T-L plane-based real-time scheduling for homogeneous multiprocessors
- Authors
- Cho, Hyeonjoong; Ravindran, Binoy; Jensen, E. Douglas
- Issue Date
- 3월-2010
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Keywords
- Real-time scheduling; Optimality; Multiprocessor systems
- Citation
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.70, no.3, pp.225 - 236
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Volume
- 70
- Number
- 3
- Start Page
- 225
- End Page
- 236
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/116837
- DOI
- 10.1016/j.jpdc.2009.12.003
- ISSN
- 0743-7315
- Abstract
- We consider optimal real-time scheduling of periodic tasks on multiprocessors-i.e., satisfying all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. We introduce a novel abstraction for reasoning about task execution behavior on multiprocessors, called T-L plane and present T-L plane-based real-time scheduling algorithms. We show that scheduling for multiprocessors can be viewed as scheduling on repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in an optimal schedule. Within a single T-L plane, we analytically show a sufficient condition to provide a feasible schedule. Based on these, we provide two examples of T-L plane-based real-time scheduling algorithms, including non-work-conserving and work-conserving approaches. Further, we establish that the algorithms have bounded overhead. Our simulation results validate our analysis of the algorithm overhead. In addition, we experimentally show that our approaches have a reduced number of task migrations among processors when compared with a previous algorithm. (C) 2010 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Graduate School > Department of Computer and Information Science > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.