Minimal Adaptive Routing on the Mesh with Bounded Queue Size
暂无分享,去创建一个
[1] Manfred Kunde. Routing and Sorting on Mesh-Connected Arrays , 1988, AWOC.
[2] Michael D. Noakes,et al. System design of the J-Machine , 1990 .
[3] Charles L. Seitz,et al. The design of the Caltech Mosaic C multicomputer , 1993 .
[4] Kenneth E. Batcher,et al. Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.
[5] Satish Rao,et al. Hot-potato routing on processor arrays , 1993, ACM Symposium on Parallelism in Algorithms and Architectures.
[6] Christos Kaklamanis,et al. Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.
[7] Frank Thomson Leighton,et al. Average case analysis of greedy routing algorithms on arrays , 1990, SPAA '90.
[8] Sanguthevar Rajasekaran,et al. Constant Queue Routing on a Mesh , 1992, J. Parallel Distributed Comput..
[9] Andrew A. Chien,et al. Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.
[10] Danny Krizanc. Oblivious Routing with Limited Buffer Capacity , 1991, J. Comput. Syst. Sci..
[11] Rene L. Cruz,et al. Bounds on Maximum Delay in Networks with Deflection Routing , 1995, IEEE Trans. Parallel Distributed Syst..
[12] Taisook Han,et al. Move and Smooth Routing Algorithms on Mesh-connected Computers , 1990 .
[13] Assaf Schuster,et al. A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms , 1996, ESA.
[14] Assaf Schuster,et al. Hot-Potato Algorithms for Permutation Routing , 1995, IEEE Trans. Parallel Distributed Syst..
[15] Luis Gravano,et al. Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage , 1992, ICPP.
[16] Allan Borodin,et al. Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..
[17] Fillia Makedon,et al. A 2n-2 Step Algorithm for Routing in an nxn Array with Constant Size Queues , 1989, SPAA.
[18] Anoop Gupta,et al. The DASH prototype: implementation and performance , 1992, ISCA '92.
[19] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[20] Baruch Schieber,et al. Fast deflection routing for packets and worms , 1993, PODC '93.
[21] Uriel Feige,et al. Exact analysis of hot-potato routing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.