Real-Time Applications with Stochastic Task Execution Times (Paperback)

Sorin Manolache

ISBN 10: 9400787073 / ISBN 13: 9789400787070

Edité par Springer, Dordrecht, 2014

A propos de cet article

Paperback. 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. 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. The second approach is an approximate one, which allows for designer-controlled trade-off between analysis accuracy and analysis speed. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

N° de réf. du vendeur 9789400787070

Détails bibliographiques

• Titre: Real-Time Applications with Stochastic Task Execution Times (Paperback)
• Éditeur: Springer, Dordrecht
• Date de parution: 2014
• Langue: anglais
• ISBN à 10 chiffres: 9400787073
• ISBN à 13 chiffres: 9789400787070
• Reliure: Paperback
• État de l'article: new

A propos de ce titre

Synopsis

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.

À propos de l?auteur

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.