Scheduling messages in real-time with application to the SSC Message Broadcast System
暂无分享,去创建一个
This paper discusses the problem of scheduling messages of various priority classes, and constant length, arriving at a node which transmits them into channels subject to timing constraints defined as the maximum end-to-end delay from the source to the destination. The concept of asynchronous time sharing is used in designing the scheduler for this model. The developed algorithm has been applied to the published model of the Message Broadcast System for the Superconducting Supercollider Collider and respective simulations have been conducted. >
[1] Aurel A. Lazar,et al. Real-Time Scheduling with Quality of Service Constraints , 1991, IEEE J. Sel. Areas Commun..
[2] R. Skegg,et al. The prototype message broadcast system for the Superconducting Super Collider , 1990 .