Name
Abstract | ||
|---|---|---|
Traditionally, real-time systems require that the deadlines of all jobs be met. For many applications, however, this is an overly stringent requirement. An occasional missed deadline may cause decreased performance but is nevertheless acceptable. We present an analysis technique by which a lower bound on the percentage of deadlines that a periodic task meets is determined and compare the lower bound with simulation results for an example system. We have implemented the technique in the PERTS real-time system prototyping environment [6, 7]. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-49059-0_4 | TACAS |
Keywords | Field | DocType |
analyzing stochastic fixed-priority real-time,stringent requirement,perts real-time system,example system,analysis technique,simulation result,periodic task,real-time system,lower bound,real time systems | Upper and lower bounds,Computer science,Real-time operating system,Execution time,Periodic graph (geometry),Distributed computing | Conference |
Volume | ISSN | ISBN |
1579 | 0302-9743 | 3-540-65703-7 |
Citations | PageRank | References |
37 | 2.64 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark K. Gardner | 1 | 145 | 15.48 |
| Jane W.-S. Liu | 2 | 1399 | 337.97 |