โ Scribed by G. Cena; A. Valenzano
No coin nor oath required. For personal study only.
Distributed real-time systems are often characterised by tight timing requirement on data exchanges, which should take place within precise deadlines in order to ensure that the system operates correctly.
In this paper, a new priority promotion mechanism is introduced which is based on the medium access technique of the Controller Area Network (CAN) protocol and which offers a higher degree of robustness and responsiveness than token-based networks. At the same time, unlike conventional CAN networks, the one proposed is very fair and provides a means by which the schedule for the different real-time message streams in the system can be deยฎned precisely.
The priority promotion mechanism is analysed in detail and an analytical expression for an upper bound on the worst case transmission time is found.
๐ SIMILAR VOLUMES
We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poisson process. The switch transmits queued packets on a priority basis with three ph