Vista normal Vista MARC Vista ISBD

Real-Time Applications with Stochastic Task Execution Times : Analysis and Optimisation / by Sorin Manolache, Petru Eles, Zebo Peng.

Por:

Manolache, Sorin [autor]

Colaborador(es):

Tipo de material: Texto

TextoEditor: Dordrecht : Springer Netherlands, 2007Descripción: xiv, 152 páginas recurso en líneaTipo de contenido:

texto

Tipo de medio:

computadora

Tipo de portador:

recurso en línea

ISBN:

9781402055096

Formatos físicos adicionales: Edición impresa:: Sin títuloClasificación LoC:

TK7888.4

Recursos en línea:

Conectar a Springer E-Books (Para consulta externa se requiere previa autentificaciÃ³n en Biblioteca Digital UANL)

Contenidos:

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

Resumen: 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.

Existencias ( 0 )
Notas de título ( 4 )

No hay ítems correspondientes a este registro

Springer eBooks

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

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.

Para consulta fuera de la UANL se requiere clave de acceso remoto.