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