loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)
Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
Gyeongju, Korea
April 24-April 26
ISBN: 0-7695-2561-X
ASCII Text
x 
 
Xuefeng Piao, Sangchul Han, Heeheon Kim, Minkyu Park, Yookun Cho, Seongje Cho, "Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems," Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on, pp. 359-364, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/ISORC.2006.64,
author = {Xuefeng Piao and Sangchul Han and Heeheon Kim and Minkyu Park and Yookun Cho and Seongje Cho},
title = {Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems},
journal ={Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2561-X},
pages = {359-364},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISORC.2006.64},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on
TI - Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems
SN - 0-7695-2561-X
SP359
EP364
A1 - Xuefeng Piao,
A1 - Sangchul Han,
A1 - Heeheon Kim,
A1 - Minkyu Park,
A1 - Yookun Cho,
A1 - Seongje Cho,
PY - 2006
KW - null
VL - 0
JA - Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on
ER -
 
Xuefeng Piao, Seoul National University, Korea
Sangchul Han, Seoul National University, Korea
Heeheon Kim, Seoul National University, Korea
Minkyu Park, Seoul National University, Korea
Yookun Cho, Seoul National University, Korea
Seongje Cho, Dankook University, Korea
Validation methods for hard real-time jobs are usually performed based on the maximum execution time. The actual execution time of jobs are assumed to be known only when the jobs arrive or not known until they finish. A predictable algorithm must guarantee that it can generate a schedule for any set of jobs such that the finish time for the actual execution time is no later than the finish time for the maximum execution time.

It is known that any job-level fixed priority algorithm (such as Earliest Deadline First) is predictable. However, job-level dynamic priority algorithms (such as Least Laxity First) may or may not. In this paper, we investigate the predictability of a job-level dynamic priority algorithm EDZL (Earliest Deadline Zero Laxity). We show that EDZL is predictable on the domain of integers regardless of the knowledge of the actual execution times. Based on this result, furthermore, we also show that EDZL can successfully schedule any periodic task set if the total utilization is not greater than (m + 1)/2, where m is the number of processors.

Citation:
Xuefeng Piao, Sangchul Han, Heeheon Kim, Minkyu Park, Yookun Cho, Seongje Cho, "Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems," isorc, pp.359-364, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.