Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

RTCSA
2005
IEEE

favoriteEmaildiscussreport

102views Embedded Systems» more RTCSA 2005»

Deadline Spanning: A Graph Based Approach

13 years 10 months ago

Deadline Spanning: A Graph Based Approach

Download www.ertos.nicta.com.au

Microkernel based systems tend to depend heavily on IPC. This paper adresses the problem of a system response spanning more than one task in an embedded real-time system. The approach is based on a mix of classical response time analysis equations and a graph based approach to estimate the impact of different parts of the system on the time needed by the system to respond. This approach has the major advantage of being intuitive.

Stefan M. Petters

Real-time Traffic

Classical Response Time | Graph Based Approach | Microkernel Based Systems | Real-Time Computing | RTCSA 2005 |

claim paper

Related Content

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» gSpan GraphBased Substructure Pattern Mining

» FOARS FLUTE based obstacleavoiding rectilinear steiner tree construction

» A Quantitative Comparison of the Subgraph Miners MoFa gSpan FFSM and Gaston

» Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree

» A CoarseGrained Parallel Algorithm for Spanning Tree and Connected Components

» Modeling and solving the rooted distanceconstrained minimum spanning tree problem

» Efficient minimum spanning tree construction without Delaunay triangulation

» Distributed algorithms for lifetime maximization in sensor networks via MinMax spanning su...

Post Info
More Details (n/a)

Added	25 Jun 2010
Updated	25 Jun 2010
Type	Conference
Year	2005
Where	RTCSA
Authors	Stefan M. Petters

Comments (0)