Pablo E. Berman
- BCC+88.S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, et al. iWarp" an integrated solution to high-speed parallel computing. In Proceedings of Supercomputing 88. ACM, 1988. Google Scholar
Digital Library
- BS91.K. Bolding and L. Snyder. Mesh and torus chaotic routing. UW CS91-04-04, University of Washington, 1991. To appear in the MIT/Brown Advanced Research in VLSI and Parallel Systems Conference, March 1992.Google Scholar
- CEDK91.F. Chong, E. Egozy, A. DeHon, and T. Knight. Multipath fault tolerance in multistage interconnection networks. Transit note #48~ MIT~ June 1991.Google Scholar
- CG92a.R. Cypher and L. Gravano. Adaptive deadlock-free packet routing in torus networks with minimal storage. RJ:8571 (77350), IBM Almaden Research Center, January 1992. To be presented in ICPP '92.Google Scholar
- CG92b.R. Cypher and L. Gravano. Requirements for deadlock-free, adaptive packet routing. Technical report, IBM Almaden Research Center, February 1992. To be presented in PODC '92. Google ScholarDigital Library
- DA90.W.J. Dally and H. Aoki. Adaptive Routing using Virtual Channels. Technical report, MIT, 1990.Google Scholar
- Dal90.W.J. Dally. Virtual-Channel Flow Control. In The 17~h Annual International Symposium on Computer Architecture, May 1990. Google ScholarDigital Library
- DS86.W.J. Dally and C. L. Seitz. The Torus Routing Chip. Distributed Computing, pages 187-196, 1986.Google Scholar
- DS87.W. Dally and C. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, 36:547-553, May 1987. Google ScholarDigital Library
- Dua91.J. Duato. Deadlock-free adaptive routing algorithms for multicomputers" Evaluation of a new algorithm. In Proceedings of the 3ra IEEE Symposium on Parallel and Distributed Processing. IEEE, December 1991.Google ScholarDigital Library
- FGPS91.S. A. Felperin, L. Gravano, G. D. Pifarr~, and J. L. C. Sanz. Fully-adaptive routing: Packet switching performance and wormhole algorithms. In Supercomputing, 1991. Google ScholarDigital Library
- FLBS91.S.A. Felperin, H. Laffitte, G. Buranits, and J.L.C. Sanz. Deadlock-free minimal packet routing in the torus network. TR:91-22, IBM Argentina, CRAAG, 1991.Google Scholar
- GPFS91.L. Gravano, G.D. Pifarr~, S. A. Felperin, and J.L.C. Sanz. Adaptive deadlock-free worm-hole routing with all minimal paths. TR:91-21, IBM Argentina, CRAAG, August 1991.Google Scholar
- Hil85.D. Hillis. The Connection Machine. The MIT Press, 1985. Google ScholarDigital Library
- KS90.S. Konstantinidou and L. Snyder. The Chaos router: A practical application of randomization in network routing. In 2nd. Annual A CM SPAA, pages 21-30, 1990. Google ScholarDigital Library
- KS91.S. Konstantinidou and L. Snyder. Chaos Router: Architecture and performance. In 18th International Symposium on Computer Architecture, pages 212-221. IEEE, May 1991. Google ScholarDigital Library
- KU91.S. Konstantinidou and E. Upfal. Experimental comparison of multistage interconnection networks. RJ:8451 (76459), IBM Almaden Research Center, November 1991.Google Scholar
- Lei90.T. Leighton. Average Case Analysis of Greedy Routing Algorithms on Arrays. In SPAA, 1990. Google ScholarDigital Library
- LH91.D.H. Linder and J.C. Harden. An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes. IEEE Transactions on Computers, 40(1):2-12, January 1991. Google ScholarDigital Library
- LLK+91.D. Lenoski, 3. Laudon, Garachorloo K., A. Gupta, W. Weber, and J. Hennessy. Overview and status of the dash multiprocessor. In International Sympos,um on Shared Memory Multiprocesszng. Tokyo, Japan, 1991.Google Scholar
- LM89.T. Leighton and B. Maggs. Expanders might be practical" Fast algorithms for routing around faults on multibutterflies. In IEEE, editor, 30th Annual Symposium on Foundations of Computer Science, pages 384-389, October 1989.Google ScholarDigital Library
- NS87.J.Y. Ngai and C.L. Seitz. A framework for adaptive routing. 5246:TR:87, Computer Science Department, California Institute of Technology, 1987. Google ScholarDigital Library
- PGFS91.G.D. Pifarr~, L. Gravano, S.A. Felperin, and J.L.C. Sanz. Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and Other Networks. In Proceedzngs of the 3~ Annual ACM Symposzum on Parallel Algorithms and Architectures, 1991. Google ScholarDigital Library
- Ran85.A.G. Ranade. How to emulate shared memory. In Foundations of Computer Science, pages 185- 194, 1985.Google Scholar
- RBJ88.A.G. Ranade, S.N. Bhat, and S.L. Johnson. The Fluent Abstract Machine. In J. Allen and F.T. Leighton, editors, Fifth MIT conference on advanced research in VLSI, pages 71 - 93. The MIT press, March 1988. Google ScholarDigital Library
- RU91.P. Raghavan and E. Upfal. A theory of wormhole routing in parallel computers. Technical report, IBM Research, December 1991.Google Scholar
- Upf89.E. Upfal. An O(log N) deterministic packet routing scheme. In 218t Annual A CM- SIGACT Symposium on Theory of Computing, May 1989. Google ScholarDigital Library
- Val88.L.G. Valiant. General purpose parallel architectures. In J. van Leeuwen, editor, Handbook of Theoreiical Compuier Science. North-Holland, 1988.Google Scholar
Index Terms
- Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
Recommendations
Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks
This paper consists of two parts. In the first part, two new algorithms for deadlock- andlivelock-free wormhole routing in the torus network are presented. The first algorithm,called Channels, is for the n-dimensional torus network. This technique is ...
Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network
This paper consists of two parts. In the first one, two new algorithms for wormholerouting on the hypercube network are presented. These techniques are adaptive and areensured to be deadlock- and livelock-free. These properties are guaranteed by using ...
An Efficient Adaptive Deadlock-Free Routing Algorithm for Torus Networks
A deadlock-free minimal routing algorithm called clue is first proposed for VCT (virtual cut-through)-switched tori. Only two virtual channels are required. One channel is applied in the deadlock-free routing algorithm for the mesh subnetwork based on a ...
Comments