Real-Time Applications with Stochastic Task Execution Times

Real-Time Applications with Stochastic Task Execution Times presents three approaches to the analysis of the deadline miss ratio of applications with stochastic task execution times. Each of the three approaches fits best to a different context. The first approach is an exact one and is efficiently applicable to monoprocessor systems. The second approach is an approximate one, which allows for designer-controlled trade-off between analysis accuracy and analysis speed. It is efficiently applicable to multiprocessor systems. The third approach is less accurate but sufficiently fast in order to be placed inside optimisation loops. Based on the last approach, we propose a heuristic for task mapping and priority assignment for deadline miss ratio minimisation.

Handles soft real-time systems, which are very important in practice and have very often been neglected in literature Presents analysis approaches for tasks with stochastic execution times Handles both mono and multiprocessor systems Presents optimisation approaches for systems with stochastic task execution times

Autorentext
Zebo Peng and Petru Eles have both (co)authored several successful research monographs for Springer. They are also getting increasingly more established within the EDA community, Prof. Zebo Peng will be Technical Chair at DATE 2007 and Prof. Petru Eles is General Chair for the 2006 Embedded Systems Week conference.

Klappentext

Real-Time Applications with Stochastic Task Execution Times presents three approaches to the analysis of the deadline miss ratio of applications with stochastic task execution times. Each of the three approaches fits best to a different context. The first approach is an exact one and is efficiently applicable to monoprocessor systems. The second approach is an approximate one, which allows for designer-controlled trade-off between analysis accuracy and analysis speed. It is efficiently applicable to multiprocessor systems. The third approach is less accurate but sufficiently fast in order to be placed inside optimisation loops. Based on the last approach, we propose a heuristic for task mapping and priority assignment for deadline miss ratio minimisation.

Inhalt
Related Work.- System Modelling.- Analysis of Monoprocessor Systems.- Analysis of Multiprocessor Systems.- Deadline Miss Ratio Minimisation.- Conclusions.