By Topic

Bounds on the time to detect failures using bounded-capacity message links

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

1 Author(s)
S. Ponzio ; Lab. for Comput. Sci., MIT, Cambridge, MA, USA

The authors consider a system of distributed processors that communicate by passing messages and that have inexact information about time. Specifically, a processor knows that a single message is delayed by at most time d and the time between any two of its consecutive steps is at least e1 and at most e 2; it has no other way of estimating elapsed time. The author extends this model by making a realistic assumption about how the delay of messages is affected by the rate at which they are sent. He defines a model of message links with bounded capacity, which are guaranteed to deliver messages at only a given rate. If a processor sends messages at a greater rate, they may incur greater delay. The effect of this bounded capacity on the time necessary to detect processor failures, is quantified. The author considers a system of two processors connected by a bidirectional message link of a given (integral) capacity

Published in:

Real-Time Systems Symposium, 1992

Date of Conference:

2-4 Dec 1992