EDZL schedulability analysis on performance asymmetric multiprocessors
- Authors
- Li, Wuqi; Wu, Peng; Yoon, Hyunmin; Ryu, Minsoo
- Issue Date
- Aug-2014
- Publisher
- CRC Press
- Keywords
- EDZL algorithm; Performanceasymmetric multiprocessor; Schedulability analysis; Sporadic task system
- Citation
- Information Technology and Computer Application Engineering - Proceedings of the 2013 International Conference on Information Technology and Computer Application Engineering, ITCAE 2013, pp.717 - 720
- Indexed
- SCOPUS
- Journal Title
- Information Technology and Computer Application Engineering - Proceedings of the 2013 International Conference on Information Technology and Computer Application Engineering, ITCAE 2013
- Start Page
- 717
- End Page
- 720
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/159366
- ISSN
- 0000-0000
- Abstract
- EDZL (Earliest Deadline Zero Laxity) scheduling policy is a hybrid policy that combines EDF (Earliest Deadline First) and LLF (Least Laxity First) policies. Previous work showed that EDZL performs better than EDF in a sense that EDZL can always schedule task sets that EDF can schedule on identical multiprocessors. In this paper, we apply EDZL to performance asymmetric multiprocessors that may have different speeds and present an effective schedulability test. Our EDZL for performance asymmetric multiprocessors slightly differs from the originalEDZLalgorithm. OurEDZLchooses the fastest available processor at the moment of scheduling in a way similar to that of global EDF for performance asymmetric multiprocessors.With this EDZL scheduling, we derive an effective schedulability condition.To our knowledge,thisis the first schedulability analysis on EDZL for performance asymmetric multiprocessors.
- Files in This Item
-
Go to Link
- Appears in
Collections - 서울 공과대학 > 서울 컴퓨터소프트웨어학부 > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.