Paper Info
Title
Practical Schedulability Analysis for Generalized Sporadic Tasks in Distributed Real-Time Systems
Abstract
Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds on worst-case response times. Experimental results show that when arrival time jitter increases, the new analysis more effectively guarantees schedulability of sporadic tasks.
Year
DOI
Venue
2008
10.1109/ECRTS.2008.33
ECRTS
Keywords
Field
DocType
traditional sporadic task model,generalized sporadic task model,sporadic task,existing sporadic task model,new analysis,practical schedulability analysis,arrival time jitter increase,arrival time,real-time systems,off-line schedulability analysis,schedulability analysis,corresponding schedulability analysis,generalized sporadic tasks,upper bound,real time systems,protocols,jitter,distributed processing,algorithm design and analysis
Algorithm design,Upper and lower bounds,Computer science,Real-time computing,Jitter,Processor scheduling,Periodic graph (geometry),Distributed computing
Conference
Citations 
PageRank 
References 
3
0.49
14
Authors
5
Name
Order
Citations
PageRank
Yuanfang Zhang198464.93
Donald K. Krecker2101.08
Christopher Gill3152798.88
Chenyang Lu46474385.38
gautam thaker5756.38