Designing fully distributed scheduling algorithms for contention-tolerant crossbar switches

We recently proposed an innovative agile crossbar switch architecture called contention-tolerant crossbar (CTC(N)) switch, which can tolerate output contentions by a pipelining mechanism, with pipeline stages implemented as buffers in the input ports. These buffers are used to decouple the scheduling task into N independent parts in such a way that N schedulers are located in the N input ports, and they operate independently and in parallel without using any arbiter. In this paper, we present a simple fully distributed scheduling algorithm scheme and show its effectiveness by simulations.