Ghost packets: A deadlock-free solution for k-ary n-cube networks

Proceedings of the 6th Euromicro Workshop on Parallel and Distributed Processing, PDP 1998

Volumn , Issue , 1998, Pages 133-139

  Carrion C ^a   Izu, C ^b   Gregorio, J A ^a   Vallejo, F ^a   Beivide, R ^a  

^a UNIVERSITY OF CANTABRIA   (Spain)

^b UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW CONTROL; PACKET NETWORKS;

DEADLOCK-FREE; FLOW MODELLING; FREE SOLUTIONS; K-ARY N-CUBES; MESSAGE FLOWS; MULTICOMPUTER SYSTEMS; N-CUBES NETWORKS; PERFORMANCE; ROUTINGS; VIRTUAL CHANNELS;

GEOMETRY;

EID: 84866140572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.1998.647190     Document Type: Conference Paper

References (14)

1. A. Arruabarrena, R. Beivide, C. Izu and J. Miguel A Performance Evaluation of Adaptive Routing in Bidimensional Cut-through Networks. Parallel Processing Letters, vol. 3, n.4, pp. 469-484, 1993.
2. A. Agarwal. Limits on Interconnection Network Performance. IEEE Trans. on Parallel Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
3. K. Bolding et al. The Case for Chaotic Adaptive Routing. Technical Report CSE-94-02-04. University of Washington, Seattle, WA, February 1994.
4. R.V. Boppana and S. Chalasani. A Framework for Designing Deadlock-Free Wormhole Routing Algorithms. IEEE Trans. on Parallel and Distributed Systems, vol.7, no.2, pp. 169-183, February 1996.
5. Andrew A. Chien. A Cost and Speed Model for k-ary n-cube Wormhole Routers. Proceedings of Hot Interconnections'93, August 1993.
6. S. Scoot and G. Thorson. Optimized Routing in the Cray T3D. Proc. Parallel Computing Routing and Communication Workshop, PCRCW'94, pp.281-294.
7. W.J. Dally The Torus Routing Chip. Distributed Computing, pp. 187-196, 1986.
8. W.J. Dally and C.L. Seitz. Deadlock-free Message Routing in Multiprocessor Interconnection Networks. IEEE Trans. on Computers, vol. C-36, no. 5, pp. 547-553, 1987.
9. J. Duato. A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks. IEEE Trans. on Parallel and Distributed Systems, vol.6, no.10, pp.1055-1067, October 1995
10. M.J. Karol, M.G. Hluchyj, and S.P. Morgan. Input vs. Output Queueing on a Space-division Packet Switch. IEEE Trans. on Communications, vol. com-35, no.12, pp. 1347-1356, Dec. 1987.
11. P. Kermani and L. Kleinrock, Virtual Cut-through: a New Computer Communication Switching Technique., Computer Networks, vol. 3, pp. 267-286, 1979.
12. J.Y. Ngai and C.L. Seitz, A Framework for Adaptative Routing in Multicomputer Networks. in Proc. ACM Symp. Parallel Algorithms Architectures, 1989.
13. L.M. Ni and P.K. McKinley, A Survey of Wormhole Routing Techniques in Direct Networks. IEEE Computer Magazine, vol. 26, no.2, pp. 62-76, Feb. 1993.
14. Steven L. Scott and Gregory M. Thorson, The Cray T3E Network: Adaptative Routing in High Performance 3D Torus Hot Interconnects IV, pp. 147-155, August 1996.