论文信息 - Universal Packet Routing Algorithms (Extended Abstract) - 字舞流文

Universal Packet Routing Algorithms (Extended Abstract)

Bruce M. Maggs | Satish Rao | Frank Thomson Leighton | F. Leighton | B. Maggs | Satish Rao

[1] Leslie G. Valiant,et al. Universal schemes for parallel communication , 1981, STOC '81.

[2] Charles E. Leiserson,et al. Randomized Routing on Fat-Trees , 1989, Adv. Comput. Res..

[3] Manfred Kunde. Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.

[4] Larry Carter,et al. Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[5] Frank Thomson Leighton,et al. Tight Bounds on the Complexity of Parallel Sorting , 1985, IEEE Trans. Computers.

[6] Russ Miller,et al. Meshes with reconfigurable buses , 1988 .

[7] J. Spencer. Ten lectures on the probabilistic method , 1987 .

[8] Leslie G. Valiant,et al. A logarithmic time sort for linear size networks , 1982, STOC.

[9] Charles E. Leiserson,et al. Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[10] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.

[11] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.