Utility accrual real-time scheduling for multiprocessor embedded systems
- Authors
- Cho, Hyeonjoong; Ravindran, Binoy; Jensen, E. Douglas
- Issue Date
- 2월-2010
- Publisher
- ACADEMIC PRESS INC ELSEVIER SCIENCE
- Keywords
- Time utility function; Utility accrual; Multiprocessor systems; Statistical assurance; Real-time; Scheduling
- Citation
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, v.70, no.2, pp.101 - 110
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
- Volume
- 70
- Number
- 2
- Start Page
- 101
- End Page
- 110
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/117110
- DOI
- 10.1016/j.jpdc.2009.10.003
- ISSN
- 0743-7315
- 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.
- 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.