Switch fabric access scheduler
View Patent ↗A technique for providing access to a switch fabric is disclosed. In some embodiments, the method comprises determining scheduling information specific to a link to the switch fabric and using the scheduling information to determine a queue to be serviced by the link. In some embodiments, the system comprises a buffer configured to store a plurality of queues, and a queue scheduler associated with the buffer and configured to determine scheduling information specific to a link to the switch fabric and use the scheduling information to select one of the plurality of queues as the next queue to be serviced by the link.
1. A method of providing access to a switch fabric, comprising:
receiving an indication that a link included in a plurality of links to the switch fabric is next in order to be serviced by a queue scheduling process common to the plurality of links;
determining a current value of each of one or more link-specific scheduling state variables specific to the link; and
using the queue scheduling process common to the plurality of links and the link-specific scheduling state variables to determine a queue to be serviced by the link;
wherein the queue scheduling process common to the plurality of links is configured to use for each of the plurality of a links a corresponding set of one or more link-specific scheduling state variables specific to that link, with the result that queues are selected for each respective link in the plurality of links, by the queue scheduling process common to them all, in a manner at least partly independent of each other link in the plurality.
2. A method of providing access to a switch fabric as recited in claim 1 , wherein the plurality of queues are used to buffer data to be transferred to the switch fabric via the link.
3. A method of providing access to a switch fabric as recited in claim 1 , wherein the switch fabric is a striped switch fabric.
4. A method of providing access to a switch fabric as recited in claim 1 , wherein the switch fabric is a non-striped switch fabric.
5. A method of providing access to a switch fabric as recited in claim 1 , wherein the link-specific scheduling state variables include an index (I) variable and a round (R) variable.
6. A method of providing access to a switch fabric as recited in claim 1 , further comprising updating the scheduling state variables.
7. A method of providing access to a switch fabric as recited in claim 1 , wherein determining the current value of each of one or more link-specific scheduling state variables specific to the link includes obtaining from a designated storage location the current value of each of the one or more link-specific scheduling state variables specific to the link.
8. A method of providing access to a switch fabric as recited in claim 7 , wherein said designated storage location is one of a plurality of storage locations, and further comprising storing in each of said plurality of storage locations one or more scheduling state variables specific to a different one of said plurality of links.
9. A method of providing access to a switch fabric as recited in claim 8 , wherein said plurality of storage locations are arranged in a ring and the method further comprises rotating the ring by shifting the data in each storage, so that the data stored in the designated location corresponds to a next link to be serviced.
10. A method of providing access to a switch fabric as recited in claim 9 further comprising updating the one or more scheduling state variables specific to the selected link.
11. A method of providing access to a switch fabric as recited in claim 1 , wherein the queue scheduling process employs a weighted round robin (WRR) scheme.
12. A method of providing access to a switch fabric as recited in claim 1 , wherein the queue scheduling process employs a weighted fair queueing (WFQ) scheme.
13. A method of providing access to a switch fabric as recited in claim 1 , wherein the queue scheduling process employs a deficit round robin (DRR) scheme.
14. A method of providing access to a switch fabric as recited in claim 1 , wherein the queue scheduling process employs a strict priority (SP) scheme.
15. A method of providing access to a switch fabric as recited in claim 1 , wherein the queue scheduling process employs a round robin (RR) scheme.
16. A system for providing access to a switch fabric comprising:
a buffer configured to store a plurality of queues; and
a queue scheduler associated with the buffer and configured to:
receive an indication that a link included in a plurality of links to the switch fabric is next in order to be serviced by the queue scheduler;
determine a current value of each of one or more link-specific scheduling state variables specific to the link; and
use the link-specific scheduling state variables to select one of the plurality of queues as the next queue to be serviced by the link;
wherein the queue scheduler is common to a plurality of links and is configured to use for each of the plurality of a links a corresponding set of one or more link-specific scheduling state variables specific to that link, with the result that queues are selected for each respective link in the plurality of links, by the queue scheduler common to them all, in a manner at least partly independent of each other link in the plurality.
17. A computer readable medium comprising, a computer program product for providing access to a switch fabric, the computer program product comprising computer instructions which when executed perform the following:
receiving an indication that a link included in a plurality of links to the switch fabric is next in order to be serviced by a queue scheduling process common to the plurality of links;
determining a current value of each of one or more link-specific scheduling state variables specific to the link; and
using the queue scheduling process common to the plurality of links and the link-specific scheduling state variables to determine a queue to be serviced by the link;
wherein the queue scheduling process common to the plurality of links is configured to use for each of the plurality of a links a corresponding set of one or more link-specific scheduling state variables specific to that link, with the result that queues are selected for each respective link in the plurality of links, by the queue scheduling process common to them all, in a manner at least partly independent of each other link in the plurality.