Guaranteed Scheduling for Switches with Configuration Overhead

—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emulates an unconstrained (zero overhead) switch by accumulating a batch of configuration requests and generating a corresponding schedule for a constrained switch. Speedup is required both to cover the configuration overhead of the switch and to compensate for empty slots left by the scheduling algorithm. Scheduling algorithms are characterized by the number of configurations they require to cover a batch of requests and the speedup required to compensate for empty slots min. Initially, all switch reconfiguration is assumed to occur simultaneously. We show that a well-known exact matching algorithm, EXACT, leaves no empty slots (i.e., min = 1), but requires 2 configurations for an -port switch leading to high configuration overhead or large batches and, hence, high delay. We present two new algorithms that redu...

• Type: Conference
• Year: 2002
• Where: INFOCOM
• Authors: Brian Towles, William J. Dally
• Keywords: Communications, Configuration Overhead, Empty Slots, INFOCOM 2002, Scheduling Algorithm