Switch Scheduling and Network Design for Real-Time Systems

The rapid need for high bandwidth and low latency communication in distributed real-time systems is driving system architects towards high-speed switches developed for high volume data transfer on the Internet. These switches employ complex scheduling algorithms for transferring data cells from the input line to the output line. From a real-time systems perspective, it is necessary to understand the behavior of these switching algorithms and obtain worst-case delay bounds for message transfer across these switches. Many researchers have derived average-case delay bounds for switching algorithms but mission-critical systems require guarantees for the worst-case. In this context, we derive upper bounds on cell delays across commonly available switches. Our bounds provide a starting point for research in this direction. Moreover, we use the delay bounds to construct low-cost networks of switches given a set of processors and their real-time communication requirements. Experiments with th...

• Type: Conference
• Year: 2006
• Where: RTAS
• Authors: Sathish Gopalakrishnan, Marco Caccamo, Lui Sha
• Keywords: Average-case Delay Bounds, Delay Bounds, Real-Time Technology, RTAS 2006, Worst-case Delay Bounds