论文信息 - Schedulability analysis of multi-access protocols for distributed real-time systems

Schedulability analysis of multi-access protocols for distributed real-time systems

The class of online protocols which exhibit deterministic properties in spite of a lack of global knowledge are considered. Such protocols (e.g. tree protocols) yield computable bounds on the duration of collision resolution. The authors show that combining such deterministic properties with feasibility tests, such as those developed in real-time scheduling, permits the design of provably correct hard real-time protocols. The authors extend a centralized real-time problem to a decentralized context using the idea of extra cost. The applicability of the results is then illustrated with the CSMA-DCR (Ethernet with deterministic collision resolution) protocol, which is currently used in real settings.<<ETX>>

N. Rivierre | B. di Gennaro

[1] J. Hayes,et al. An Adaptive Technique for Local Distribution , 1978, IEEE Trans. Commun..

[2] William H. Sanders,et al. Performability evaluation of CSMA/CD and CSMA/DCR protocols under transient fault conditions , 1993 .

[3] Chung Laung Liu,et al. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[4] Albert G. Greenberg,et al. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels , 1985, JACM.

[5] Robert Metcalfe,et al. Ethernet: distributed packet switching for local computer networks , 1976, CACM.

[6] John Capetanakis,et al. Tree algorithms for packet broadcast channels , 1979, IEEE Trans. Inf. Theory.

[7] Gérard Le Lann. Designing real-time dependable distributed systems , 1992, Comput. Commun..

[8] Charles U. Martel,et al. On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.