By Topic

Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed 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
$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

5 Author(s)
S. Uruena ; Dept. of Comp. Archit. & Technol., Tech. Univ. of Madrid, Boadilla del Monte, Spain ; J. Zamorano ; D. Berjon ; J. A. Pulido
more authors

A new token-passing algorithm called AR-TP for avoiding the non-determinism of some networking technologies is presented. This protocol allows the schedulability analysis of the network, enabling the use of standard Ethernet hardware for hard real-time behavior while adding congestion management. It is specially designed for high-integrity distributed hard real-time systems, being fully compliant with the Ravenscar profile

Published in:

Proceedings 20th IEEE International Parallel & Distributed Processing Symposium

Date of Conference:

25-29 April 2006