Schedulability analysis of AR-TP, a Ravenscar compliant communication protocol for high-integrity distributed systems

  • Authors:
  • Santiago Urueña;Juan Zamorano;Daniel Berjón;José A. Pulido;Juan A. de la Puente

  • Affiliations:
  • Technical University of Madrid, Dept. of Comp. Architecture and Technology, Boadilla del Monte, Spain;Technical University of Madrid, Dept. of Comp. Architecture and Technology, Boadilla del Monte, Spain;Technical University of Madrid, Dept. of Telematic Systems Engineering, Madrid, Spain;Technical University of Madrid, Dept. of Telematic Systems Engineering, Madrid, Spain;Technical University of Madrid, Dept. of Telematic Systems Engineering, Madrid, Spain

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.