Paper Info
Title
State-dependent deadline scheduling
Abstract
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how to choose target deadlines for jobs from their time-varying deadlines so that the system can meet its requirements with a high probability. In the clairvoyant case, the deadline of every job is given by a known function of time for all times after the job is released. There is an optimal deadline determination algorithm. When the future values of job deadlines are unknown, it is not possible to make optimal choices of job deadlines. Several heuristics can be used to determine deadlines in this realistic case. Simulation results show that these heuristics allow the system to achieve good processor utilization and high probability of meeting its time-varying requirements.
Year
DOI
Venue
2002
10.1109/REAL.2002.1181557
RTSS
Keywords
Field
DocType
processor scheduling,distributed algorithms,workload model,job deadline,state-dependent deadline model,target deadline,processor utilization,realistic case,target deadlines,job deadlines,heuristic programming,time-varying deadline,optimal choice,simulation,time-varying requirements,heuristics,clairvoyant case,new workload model,high-level timing requirements,time-varying deadlines,high probability,optimal deadline determination algorithm,state-dependent deadline scheduling,real-time systems,probability,computer science,application software,scheduling algorithm,real time systems
State dependent,Scheduling (computing),Computer science,Workload,Real-time computing,Distributed algorithm,Heuristics,Application software,Processor scheduling,Heuristic programming,Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
0-7695-1851-6
9
PageRank 
References 
Authors
0.68
10
2
Name
Order
Citations
PageRank
Chi-Sheng Shih150866.29
Jane W.-S. Liu21399337.97