By Topic

Analysis of three contention protocols in distributed real-time systems

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
$31 $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)
Shin, K.G. ; Real-time Comput. Lab., Michigan Univ., Ann Arbor, MI, USA ; Chao-Ju Hou

The probability of a station/node failing to deliver packets before their deadlines, called the probability of dynamic failure, P dyn, and the ∈-bounded delivery time, which is defined as the time period between the arrival of a packet and its delivery with probability greater than 1-∈, are important performance parameters for the communication subsystems of a distributed real-time system. The parameters are derived and are used to evaluate the token passing protocol, the token ring scheduling protocol, and the Pi-persistent protocol and a priority-based variation thereof. The communication subsystem equipped with different contention protocols as embedded Markov chains is modeled. The probability distributions of the access delay are then derived, from which Pdyn and T can be calculated. Using Pdyn and I as indices, the performances of these contention protocols are evaluated and compared over a wide range of traffic

Published in:

Real-Time Systems Symposium, 1990. Proceedings., 11th

Date of Conference:

5-7 Dec 1990