By Topic

Guaranteed response times in a distributed hard-real-time environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dennis W. Leinbaugh ; AT&T Bell Laboratories, Columbus, OH 43213 ; Mohamad-Reza Yamini

A distributed real-time programming model is presented. It consists of a set of tasks whose segments require processor time and devices, and which is run on a dedicated network of microcomputers. A task is started upon receipt of an external signal or the completion of other tasks. Segments communicate via message passing, and there may be a limited number of transient communication errors. A heuristic algorithm is developed to determine an upper bound on the response time of each task. This algorithm is useful in a hard-real-time environment for determining if response times will always be met.

Published in:

IEEE Transactions on Software Engineering  (Volume:SE-12 ,  Issue: 12 )