The iSLIP scheduling algorithm is designed for input-queued switches to achieve 100% throughput. It is an iterative, round-robin algorithm that uses a two-dimensional array of priority encoders to schedule packets. iSLIP can handle both uniform and nonuniform traffic, adapting to fair scheduling policies that prevent starvation of input queues. It has been implemented in commercial systems with aggregate bandwidths up to 500 Gb/s. The algorithm is simple to implement in hardware and is efficient for high-speed switches. iSLIP improves upon the basic round-robin matching algorithm (RRM) by reducing synchronization of output arbiters, leading to better performance under both benign and bursty traffic conditions. Simulation results show that iSLIP achieves 100% throughput for uniform traffic and significantly reduces queueing delay under bursty arrivals. With multiple iterations, iSLIP can converge to a maximum-sized match, improving performance further. The algorithm is also extended to handle prioritized traffic, where each input maintains separate FIFO queues for different priority levels. The prioritized iSLIP algorithm ensures strict priority to higher-level requests, while the threshold iSLIP algorithm balances between maximum-sized and maximum-weight matches by quantizing queue occupancy. Overall, iSLIP provides efficient and fair scheduling for high-performance switches.The iSLIP scheduling algorithm is designed for input-queued switches to achieve 100% throughput. It is an iterative, round-robin algorithm that uses a two-dimensional array of priority encoders to schedule packets. iSLIP can handle both uniform and nonuniform traffic, adapting to fair scheduling policies that prevent starvation of input queues. It has been implemented in commercial systems with aggregate bandwidths up to 500 Gb/s. The algorithm is simple to implement in hardware and is efficient for high-speed switches. iSLIP improves upon the basic round-robin matching algorithm (RRM) by reducing synchronization of output arbiters, leading to better performance under both benign and bursty traffic conditions. Simulation results show that iSLIP achieves 100% throughput for uniform traffic and significantly reduces queueing delay under bursty arrivals. With multiple iterations, iSLIP can converge to a maximum-sized match, improving performance further. The algorithm is also extended to handle prioritized traffic, where each input maintains separate FIFO queues for different priority levels. The prioritized iSLIP algorithm ensures strict priority to higher-level requests, while the threshold iSLIP algorithm balances between maximum-sized and maximum-weight matches by quantizing queue occupancy. Overall, iSLIP provides efficient and fair scheduling for high-performance switches.