Constraint-based evaluation of hypergraph and graph networks

Simulation Practice and Theory

Volumn 4, Issue 2-3 SPEC. ISS., 1996, Pages 119-140

  Ould Khaoua, M ^a   Mackenzie, L M ^b   Sutherland, R J ^b   Sotudeh, R ^a  

^a TEESSIDE UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

Binary n cubes; Graphs; Hypergraphs; Hypermeshes; Multicomputers; Performance modelling; Queueing theory; Technology; Tori; Wormhole routing

Indexed keywords

COMPUTER NETWORKS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; ELECTRIC NETWORK TOPOLOGY; PERFORMANCE; QUEUEING THEORY;

DISTRIBUTED CROSSBAR SWITCH HYPERMESHES; HYPERGRAPH TOPOLOGIES; MULTICOMPUTER NETWORKS;

PARALLEL PROCESSING SYSTEMS;

EID: 0030143682     PISSN: 09284869     EISSN: None     Source Type: Journal    
DOI: 10.1016/0928-4869(95)00043-7     Document Type: Article

References (43)

1. S. Abraham and K. Padmanabhan, Performance of multicomputer networks under pin-out constraints, J. Parallel Distrib. Systems 12 (1992) 237-248.
2. A. Agrawal, Limits on interconnection network performance, IEEE Trans. Parallel Distrib. Systems 2 (1991) 398-412.
3. W.C. Athas and C.L. Seitz, Multicomputers: Message-passing concurrent computers, IEEE Comput. 21 (8) (1988) 9-24.
4. C. Berge, Graphs and hypergraphs (North-Holland, Amsterdam, 1977).
5. L.M. Bhuyan and P.D. Agarwal, Generalised hypercube and hyperbus structures for a computer network, IEEE Trans. Comput. 33 (4) (1984) 323-333.
6. H. Cha et al. The hyperdynamic architecture (massively parallel message-passing machine) -Architecture and performance, in Proceedings of the International Conference on Supercomputing (1992) 9-19.
7. A.A. Chien, A cost and performance model for k-ary n-cubes wormhole routers, in: Proceedings of the Hot Interconnects Workshop (1993).
8. W.J. Dally, Deadlock-free message routing in multiprocessor interconnection network, IEEE Trans. Comput. 36 (5) (1987) 547-553.
9. W.J. Dally, Performance analysis of k-ary n-cubes interconnection networks, IEEE Trans. Comput. 39 (6) (1990) 775-785.
10. W.J. Dally, Express cubes: Improving the performance of k-ary n-cube interconnection networks, IEEE Trans. Comput. 40 (9) (1991) 1016-1023.
11. P.W. Dowd, High-performance interprocessor communication through optical wavelength division multiple access channels, in: Proceedings of the International Symposium on Computer Architecture (1991) 96-105.
12. T. Feng, A survey of interconnection networks, IEEE Comput. 14 (12) (1981) 12-27.
13. G.C. Fox et al. Solving Problems on Concurrent Processors (Prentice-Hall, Englewood Cliffs, NJ, 1988).
14. W.K. Giloi et al. Choosing the interconnect of distributed-memory systems by cost and blocking behaviour, in: Proceedings of the IEEE Parallel Processing Symposium (1991) 438-444.
15. G.J. Glass and L.M. Ni, The turn model for adaptive routing, in: Proceedings of the 19th International Symposium on Computer Architecture (1992) 438-444.
16. Z. Guo and R. Melhem, Pipelined-communication in optically-interconnected arrays. J. Parallel Distrib. Comput. 12 (1991) 269-282.
17. D.B. Gustavson and D.B. Theus, Wire-Or logic on transmission lines, IEEE Micro 3 (1983) 51-55.
18. P. Kermani and L. Kleinrock, Virtual cut-through: A new computer communication switching technique, Comput. Networks 3 (1979).
19. L. Kleinrock, Queueing Systems, Vol. 1 (John Wiley, New York, 1975).
20. D. Lenoski, J. Laudon, K. Gharacholoo, A. Gupta, J. Hennessy, M. Horowitz and M. Lam, The Stanford DASH multiprocessor, IEEE Comput. (March 1992) 63-79.
21. H.M. MacDougal, Simulating Computer Systems: Techniques & Tools, The MIT Press Series in Computer Science (MIT Press, Cambridge, MA, 1987).
22. L.M. Mackenzie, M. Ould-Khaoua, R. Sutherland and T. Kelly, COBRA: A high-performance interconnection network for large multicomputers, Tech. Rept. 119/R19, Computer Science Dept., University of Glasgow (1991).
23. L.M. Mackenzie, M. Ould-Khaoua, R. Sutherland and T. Kelly, The COBRA project: Alleviating the bandwidth constraints in large multicomputer networks, in: Proceedings of the Supercomputing Symposium 92, Montreal (1992).
24. J. Midwinter and M.G. Taylor, The reality of digital optical computing, IEEE LCS Magazine (May 1990) 40-46.
25. N-Cube Systems, N-cube Handbook (N-Cube, 1986).
26. L.M. Ni and D.K. Panda, Sea of interconnection networks: What's your choice, A report of the ICPP '95 pannel, in: Proceedings of the International Conference on Parallel Processing (1994).
27. M. Noakes and W.J. Dally, System design of the J-machine, in: Advanced Research in VLSI (MIT Press, Cambridge, MA, 1990) 179-192.
28. S.F. Nugent, The iPSC/2 direct-connect communication technology, in: Proceedings of the Conference on Hypercube Concurrent Computers and Applications (1989) 51-60.
29. M. Ould-Khaoua, Hypergraph-based interconnection networks for large multicomputers, Ph.D. Thesis, Computer Science Dept., Glasgow University (1994).
30. C. Peterson et al., iWarp: A 100-MOPS VLIW microprocessor for multicomputers, IEEE Micro 11 (13) (1991) 26-37.
31. D.A. Reed and R.M. Fujimoto, Multicomputer Networks: Message-based Parallel Processing (MIT Press, Cambridge, MA, 1987).
32. A.B. Ruighaver, A decoupled multicomputer with full interconnection, in: Proceedings of CONPAR-VIPP 92, Lyon (1992) 250-257.
33. S.L. Scott and J.R. Goodman, The impact of pipelined channel on k-ary n-cube networks, IEEE Trans, Parallel Distrib. Systems 5 (1) (1994) 2-16.
34. C.L. Seitz, System timings, in: C. Mead and L. Conway, Introduction to VLSI Systems (Addison-Wesley, Reading, MA, 1980) 218-262.
35. C.L. Seitz, The Cosmic Cube, Comm. ACM 28 (1985) 22-33.
36. C.L. Seitz et al., The hypercube communication chip, Dept. of Computer Science, CalTech, Display File 5182:DF:85 (1985).
37. C.L. Seitz et al., The architecture and programming of the Ametek Series 2010 multiprocessor, in: Proceedings of the 3rd Conference on Hypercube Concurrent Computers and Applications (1988).
38. C.L. Seitz, Concurrent architectures, in: R. Suaya and G. Birtwistle, eds., VLSI and Parallel Computation (Morgan Kaufmann, Los Altos, CA, 1990) 1-84.
39. H. Sullivan and T.R. Barkshow, A large scale homogeneous machine, in: Proceedings of the 4th ACM Annual Symposium on Computer Architecture (1979) 105-124.
40. T. Szymanski, Hyper-meshes: Optical interconnection networks for parallel processing, J. Parallel Distrib. Comput. (January 1995).
41. N. Tanabe et al., Base-m n-cube: High performance interconnection networks for highly parallel computer PRODIGY, in: Proceedings of the International Conference on Parallel Processing (1991) 509-516.
42. L.D. Wittie, Communication structures for large networks of microcomputers, IEEE Trans. Comput. 30 (4) (1981) 264-273.
43. S. Young and T. Yalamanchili, A taxonomy and adaptive routing protocols for generalised hypercube architectures, in: Proceedings of the 3rd IEEE Symposium on Parallel Distributed Processing (1991) 564-571.