A Fast Parallel Routing Algorithm for Benes Group Switches
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Frank Thomson Leighton. Introduction to parallel algorithms and architectures: arrays , 1992 .
[3] A. Mullin,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .
[4] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[5] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.
[6] A. Yavuz Oruç,et al. A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks , 1995, IEEE Trans. Parallel Distributed Syst..
[7] V. Benes. On rearrangeable three-stage connecting networks , 1962 .
[8] Tony T. Lee,et al. Parallel routing algorithms in Benes-Clos networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[9] Janak H. Patel,et al. Processor-memory interconnections for multiprocessors , 1979, ISCA '79.
[10] Abraham Waksman,et al. A Permutation Network , 1968, JACM.
[11] Richard Cole,et al. Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[12] Francesco Masetti-Placci,et al. Hardware Scheduling in High-speed, High-capacity IP Routers , 2002, IASTED PDCS.
[13] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .
[14] Sartaj Sahni,et al. Parallel Algorithms to Set Up the Benes Permutation Network , 1982, IEEE Transactions on Computers.
[15] Mei Yang,et al. The k DRR Scheduling Algorithms for Multi-server Packet Switches , 2002 .
[16] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .
[17] Kyungsook Y. Lee,et al. A New Benes Network Control Algorithm , 1987, IEEE Trans. Computers.
[18] Kyungsook Y. Lee. On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.