Utility accrual real-time scheduling for multiprocessor embedded systems
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-08T05:36:20Z | - |
dc.date.available | 2021-09-08T05:36:20Z | - |
dc.date.created | 2021-06-11 | - |
dc.date.issued | 2010-02 | - |
dc.identifier.issn | 0743-7315 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/117110 | - |
dc.description.abstract | We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called the global Multiprocessor Utility Accrual scheduling algorithm (or gMUA). The algorithm considers an application model where real-time activities are subject to time/utility function time constraints, variable execution time demands, and resource overloads where the total activity utilization demand exceeds the total capacity of all processors. We consider the scheduling objective of (1) probabilistically satisfying lower bounds on each activity's maximum utility, and (2) maximizing the system-wide, total accrued utility. We establish several properties of gMUA including optimal total utility (for a special case), conditions under which individual activity utility lower bounds are satisfied, a lower bound on system-wide total accrued utility, and bounded sensitivity for assurances to variations in execution time demand estimates. Finally, our simulation experiments validate our analytical results and confirm the algorithm's effectiveness. (C) 2009 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.subject | ALGORITHMS | - |
dc.title | Utility accrual real-time scheduling for multiprocessor embedded systems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Cho, Hyeonjoong | - |
dc.identifier.doi | 10.1016/j.jpdc.2009.10.003 | - |
dc.identifier.scopusid | 2-s2.0-72749120003 | - |
dc.identifier.wosid | 000273835800004 | - |
dc.identifier.bibliographicCitation | JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.70, no.2, pp.101 - 110 | - |
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 | 2 | - |
dc.citation.startPage | 101 | - |
dc.citation.endPage | 110 | - |
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.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Time utility function | - |
dc.subject.keywordAuthor | Utility accrual | - |
dc.subject.keywordAuthor | Multiprocessor systems | - |
dc.subject.keywordAuthor | Statistical assurance | - |
dc.subject.keywordAuthor | Real-time | - |
dc.subject.keywordAuthor | Scheduling | - |
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.