ISA-Independent Scheduling Algorithm for Buffered Crossbar Switch

Crossbars are an emerging technology in high speed router. In buffered crossbar switch a buffer is associated with each crossbar. Due to the introduction of crossbar buffers the input and output contentions are highly eliminated. Both the input and output port work independently and so the scheduling process is highly simplified. With a speed up of 2 it has been proved that 100% throughput can be achieved. In this paper we propose a 100% throughput scheduling algorithm without speedup called ISA. In ISA the scheduling decision is purely based on the state information of the local crosspoint buffer. So it is suited for a distributed implementation and it is highly scalable. The main advantage is the crosspoint use a buffer size of 1 which minimizes the hardware cost. Simulation results show that we achieve 100% throughput without any speedup.