The University of Maine at Machias
Clos networks provide the theoretically optimal solution to build high-radix switches. Dynamically reconfiguring a three-stage Clos network is more difficult in asynchronous circuits than in synchronous circuits. This paper proposes a novel Asynchronous Dispatching (AD) algorithm for general three-stage Clos networks. It is compared with the classic synchronous Concurrent Round-Robin Dispatching (CRRD) algorithm in unbuffered Clos networks. The AD algorithm avoids the contention in Central Modules (CMs) using a state feedback scheme and outperforms the throughput of CRRD in behavioral simulations.