Broadcasting in the arrowhead torus

Computers and Artificial Intelligence

Volumn 16, Issue 6, 1997, Pages 545-559

  Désérable, Dominique ^a  

^a INSA DE RENNES   (France)

Author keywords

Arrowhead; Broadcasting; Hexavalent grid; Hierarchical Cayley graphs; Interconnection networks

Indexed keywords

EID: 33748825957     PISSN: 02320274     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)

1. AKERS, S. B. - KRISHNAMURTHY, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comp. Vol. 38, 1989, No. 4, pp. 555-566.
2. CHEN, M. S. - SHIN, K. G. - KANDLUR, D. D.: Addressing, routing, and broadcasting in hexagonal mesh multiprocessors. IEEE Trans. Comp., Vol. 39, 1990, No. 1, pp. 10-18.
3. DALLY, W. J.: Performance analysis of k-ary n-cube interconnection networks. IEEE Trans. Comp., Vol. C-39, 1990, No. 6, pp. 775-785.
4. DALLY, W. J. - SEITZ, C. L.: Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comp., Vol. C-36, 1987, No. 5, pp. 547-553.
5. DAVIS, A.: Mayfly - a general-purpose, scalable, parallel processing architecture. J. LISP and Symbolic Computation, Vol. 5, 1992, pp. 7-47.
6. DAVIS, A. L. - ROBISON, S. V.: The architecture of the FAIM-1 symbolic multiprocessing system. Proc. 9-th Int. Joint. Conf. on Artificial Intelligence 1985, pp. 32-38.
7. DÉSÉRABLE, D.: The arrowhead torus : a Cayley graph on the 6-valent grid. Publication interne no 840 IRISA, Rennes 1994.
8. DÉSÉRABLE, D.: Broadcasting in the arrowhead torus. Parallel Processing, Lecture Notes in Computer Sciences 854, Springer-Verlag 1994, pp. 808-819.
9. DÉSÉRABLE, D.: A family of Cayley graphs on the hexavalent grid (to appear in Discrete Applied Math.)
10. FRAIGNAUD, P. - LAZARD, E.: Methods and problems of communication in usual networks. Discrete Applied Math. Vol. 53, 1994, pp. 79-133.
11. GROSSMAN, I. - MAGNUS, W.: Groups and their graphs. New Mathematical Library no 14, Random House, New-York 1964.
12. HILLIS, D.: The Connection Machine. MIT Press 1985.
13. P. KERMANI, P. - L. KLEINROCK, L.: Virtual cut-through : a new computer communication switching technique. Computers Networks Vol. 3, 1979, pp. 267-286.
14. MANDELBROT, B. B.: The fractal geometry of nature. Freeman and Cie, San Francisco 1982.
15. MAY, D.: The next generation transputers and beyond. Distributed Memory Computing, Lecture Notes in Computer Science 487, Springer-Verlag 1991, pp. 7-22.
16. MICHALLON, P. - BERMOND, J. C. - TRYSTRAM, D.: Broadcasting on wraparound meshes with parallel monodirectional links. Parallel Computing Vol. 18, 1992, pp. 639-648.
17. PETERS, J. G. - SYSKA, M.: Circuit-switched broadcasting in torus networks. IEEE Trans. Par. and Dist. Systems Vol. 7, 1996, No. 3, pp. 246-255.
18. J. RATTNER, J.: The new age of supercomputing. Distributed Memory Computing, Lecture Notes in Computer Science 487, Springer-Verlag 1991, pp. 1-6.
19. SAAD, Y. - SCHULTZ, M. H.: Data communication in parallel architectures. Parallel Computing Vol. 11, 1989, No. 2, pp. 131-150.
20. SEIDEL, S. R.: Circuit-switched vs. store-and-forward solutions to symmetric communication problems. In: Proc. 4-th Conf. on Hypercube Concurrent Computers and Applications 1989, pp. 253-255.
21. UNGER, S. H.: A computer oriented toward spatial problems. Proc. IRE, Vol. 46, 1958, pp. 1744-1750.