Amazon cover image
Image from Amazon.com

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

By: Contributor(s): Material type: TextTextPublisher: Dordrecht : Springer Netherlands, 2007Description: XIV, 152 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781402055096
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 621.3815 23
LOC classification:
  • TK7888.4
Online resources:
Contents:
Related Work -- System Modelling -- Analysis of Monoprocessor Systems -- Analysis of Multiprocessor Systems -- Deadline Miss Ratio Minimisation -- Conclusions.
In: Springer eBooksSummary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
E-Book E-Book Central Library Available E-38577

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.

There are no comments on this title.

to post a comment.

Maintained by VTU Library