High-performance multi-queue buffers for VLSI communications switches
ISCA '88 Proceedings of the 15th Annual International Symposium on Computer architecture
The SP2 high-performance switch
IBM Systems Journal
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Switcherland: a QoS communication architecture for workstation clusters
Proceedings of the 25th annual international symposium on Computer architecture
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
Priority-based high-speed switch scheduling for ATM networks
LCN '95 Proceedings of the 20th Annual IEEE Conference on Local Computer Networks
Multicast scheduling for input-queued switches
IEEE Journal on Selected Areas in Communications
Separated high-bandwidth and low-latency communication in the cluster interconnect Clint
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
A new scalable service discipline for real-time traffic: The framed-deadline scheduler
Computer Communications
Separated high-bandwidth and low-latency communication in the cluster interconnect clint
Separated high-bandwidth and low-latency communication in the cluster interconnect clint
The least choice first (LCF) scheduling method for high-speed network switches
The least choice first (LCF) scheduling method for high-speed network switches
| Hi-index | 0.00 |
We describe a novel method for scheduling highspeed network switches. The targeted architecture is an input-buffered switch with a non-blocking switch fabric. The input buffers are organized as virtual output queues to avoid head-of-line blocking. The task of the scheduler is to decide when the input ports can forward packets from the virtual output queues to the corresponding output ports. Our Least Choice First (LCF) scheduling method selects the input and output ports to be matched by prioritizing the input ports according to the number of virtual output queues that contain packets: The fewer virtual output queues with packets, the higher the scheduling priority of the input port. This way the number of switch connections and, with it, switch throughput is maximized. Fairness is provided through the addition of a round-robin algorithm.We present two alternative implementations: A central implementation intended for narrow switches and a distributed implementation based on an iterative algorithm intended for wide switches.The simulation results show that the LCF scheduler outperforms other scheduling methods such as the parallel iterative matcher [1], iSLIP [10], and the wave front arbiter [14].