The iSLIP scheduling algorithm for input-queued switches
read more
Citations
Crosspoint switch with independent schedulers
Randomized Scheduling Algorithm for Queueing Networks
A parallel-polled virtual output queued switch with a buffered crossbar
Delay bounds for approximate maximum weight matching algorithms for input queued switches
NoCGEN:a template based reuse methodology for Networks On Chip architecture
References
On the self-similar nature of Ethernet traffic (extended version)
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Data Structures and Network Algorithms
A calculus for network delay. I. Network elements in isolation
Input Versus Output Queueing on a Space-Division Packet Switch
Related Papers (5)
Frequently Asked Questions (13)
Q2. How does the synchronization effect affect the output?
8. As the offered load increases, synchronized output arbiters tend to move in lockstep and the degree of synchronization changes only slightly.
Q3. What is the effect of bursty arrivals on the performance of a switch?
With bursty arrivals, the performance of an input-queued switch becomes more and more like an output-queued switch under the save arrival conditions [9].
Q4. How many gates are needed to implement a 32-port scheduler?
The number of gates for a 32-port scheduler is less than 100 000, making it readily implementable in current CMOS technologies, and the total number of gates grows approximately with
Q5. What is the effect of burst size on the queueing delay?
As the authors would expect, the increased burst size leads to a higher queueing delay whereas an increased number of iterations leads to a lower queueing delay.
Q6. Why is the service policy not constant?
This is because the service policy is not constant; when a queue changes between empty and nonempty, the scheduler must adapt to the new set of queues that require service.
Q7. What is the approximation for the expected number of unmatched inputs at time?
The approximation is based on two assumptions:1) inputs that are unmatched at time are uniformly distributed over all inputs; 2) the number of unmatched inputs at time has zero variance.
Q8. How does the algorithm calculate the maximum weight of the input queue?
In particular, if the weight of the edge between input and output is the occupancy of input queue then the authors will conjecture that the algorithm can achieve 100% throughput for all i.i.d.
Q9. How many iterations does it take to converge?
in practice there may be insufficient time for iterations, and so the authors need to consider the penalty of performing only iterations, where In fact, because of the desynchronization of the arbiters, will usually converge in fewer than iterations.
Q10. How can the basic algorithm be extended to include requests at multiple priority levels?
The basic algorithm can be extended to include requests at multiple priority levels with only a small performance and complexity penalty.
Q11. What is the problem with the interaction between the arbiters?
But when the traffic is nonuniform, or when the offered load is at neither extreme, the interaction between the arbiters becomes difficult to describe.
Q12. What is the pointer to the highest priority element of the round-robin schedule?
The pointer to the highest priority element of the round-robin schedule is incremented (modulo to one location beyond the granted input if and only if the grant is accepted in Step 3 of the first iteration.
Q13. How does PIM achieve a conflict-free maximal match?
PIM attempts to quickly converge on a conflict-free maximal match in multiple iterations, where each iteration consists of three steps.