Validating timing constraints of dependent jobs with variable execution times in distributed real-time systems
- Authors
- Cha, H.; Ha, R.
- Issue Date
- 2002
- Publisher
- Springer Verlag
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.2280 LNCS, pp.83 - 97
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 2280 LNCS
- Start Page
- 83
- End Page
- 97
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27139
- DOI
- 10.1007/3-540-46002-0_7
- ISSN
- 0302-9743
- Abstract
- In multiprocessor and distributed real-time systems, scheduling jobs dynamically on processors can be used to achieve better performance. However, analytical and efficient validation methods for determining whether all the timing constraints are met do not yet exist for systems using modern dynamic scheduling strategies, and exhaustive methods are often infeasible or unreliable since the execution time and release time of each job may vary. In this paper, we present several upper bounds and efficient algorithms for computing the worst-case completion times of dependent jobs in dynamic systems where jobs are dispatched and scheduled on available processors in a priority-driven manner. The bounds and algorithms consider arbitrary release times and variable execution times. We present conditions under which dependent jobs execute in a predictable manner. © Springer-Verlag Berlin Heidelberg 2002.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/27139)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.