Claims
- 1. A method for allocating paths disposed between sources and destinations and through a crossbar switch, the method comprising:shuffling of an assignment of the destinations across a first dimension of the crossbar switch; shuffling of an assignment of the sources across a second dimension of the crossbar switch; and performing a wrapped wave front arbitration across the crossbar switch to allocate the paths through the crossbar switch, wherein said shuffling achieves both short and long term fairness in allocation, wherein said shuffling a comprises deterministic shuffling, and wherein said shuffling of the assignment of the destinations comprises permutation of the assignment of the destinations across the first dimension.
- 2. The method of claim 1, wherein the crossbar switch is used for connecting the sources to the destinations in a router or switch.
- 3. The method of claim 1, wherein the first and second dimensions comprise respectively columns and rows, or vice-versa.
- 4. The method of claim 1, wherein said deterministic shuffling of the assignment of sources comprises permutation and shifting of the assignment of sources across the first dimension.
RELATED APPLICATIONS
This application claims priority based on U.S. provisional application Serial No. 60/130,406 with filing date Apr. 19, 1999.
US Referenced Citations (5)
Number |
Name |
Date |
Kind |
4630045 |
Georgiou |
Dec 1986 |
A |
5072366 |
Simcoe |
Dec 1991 |
A |
5517495 |
Lund et al. |
May 1996 |
A |
5734649 |
Carvey et al. |
Mar 1998 |
A |
6370148 |
Calvignac et al. |
Apr 2002 |
B1 |
Non-Patent Literature Citations (1)
Entry |
Tamir, Yuval, “Symmetric Crossbar Arbiters for VLSI Communication Switches,” IEEE Transactions on Parallel and Distributed Systems, vol. 4, No. 1, pp. 13-27 (1993). |
Provisional Applications (1)
|
Number |
Date |
Country |
|
60/130406 |
Apr 1999 |
US |