T-L plane-based real-time scheduling for homogeneous multiprocessors
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Hyeonjoong | - |
dc.contributor.author | Ravindran, Binoy | - |
dc.contributor.author | Jensen, E. Douglas | - |
dc.date.accessioned | 2021-09-08T04:39:25Z | - |
dc.date.available | 2021-09-08T04:39:25Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-03 | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/116837 | - |
dc.description.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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | T-L plane-based real-time scheduling for homogeneous multiprocessors | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1016/j.jpdc.2009.12.003 | - |
dc.identifier.scopusid | 2-s2.0-74449093653 | - |
dc.identifier.wosid | 000274312800004 | - |
dc.identifier.bibliographicCitation | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.70, no.3, pp.225 - 236 | - |
dc.relation.isPartOf | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.citation.title | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING | - |
dc.citation.volume | 70 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 225 | - |
dc.citation.endPage | 236 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordAuthor | Real-time scheduling | - |
dc.subject.keywordAuthor | Optimality | - |
dc.subject.keywordAuthor | Multiprocessor systems | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.