Real-Time Scheduling Theory and Ada
Computer
Performance of real-time bus scheduling algorithms
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Computing with IEEE Futurebus+
IEEE Micro
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Aperiodic task scheduling for real-time systems
Aperiodic task scheduling for real-time systems
On Slot Allocation for Time-Constrained Messages in Dual-Bus Networks
IEEE Transactions on Computers
Supporting Embedded System Design Capture, Analysis and Navigation-
ASWEC '97 Proceedings of the Australian Software Engineering Conference
A slot swapping protocol for time-critical internetworking
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 14.98 |
Next-generation networks are expected to support a wide variety of services. Some services such as video, voice, and plant control traffic have explicit timing requirements on a per-message basis rather than on the average. In this paper, we develop a general model of dual-link networks to support real-time communication. We examine the desirable properties of this network and the difficulties in achieving these properties. We then introduce the concept of coherence and develop a theory of coherent dual-link networks. We show that a coherent dual-link network can be analyzed as though it is a centralized system. We then discuss practical considerations in implementing a dual-link network, and implications of this work to address problems observed in the IEEE 802.6 metropolitan area network standard.