论文信息 - Two-dimensional regular d-meshes

Two-dimensional regular d-meshes

Abstract An extended family of two-dimensional regular meshes of an arbitrary degree d with an isomorphic neighbourhood is introduced. The construction rules for d -meshes and the evaluation of optimal meshes are given. Average and maximal distances between nodes in d -meshes are calculated and compared with those for hypercubes and 3 D -tori. Global and local routing strategies are analysed and tested on the proposed meshes.

Roman Trobec

[1] Seyed Hossein Hosseini. On Fault-Tolerant Structure, Distributed Fault-Diagnosis, Reconfiguration, and Recovery of the Array Processors , 1989, IEEE Trans. Computers.

[2] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[3] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[4] Emmanouel A. Varvarigos,et al. Macro-star networks: efficient low-degree alternatives to star graphs for large-scale parallel architectures , 1996, Proceedings of 6th Symposium on the Frontiers of Massively Parallel Computation (Frontiers '96).

[5] Jean-Claude König,et al. Analysis of Gossiping Algorithms with Restricted Buffers , 1998, Parallel Algorithms Appl..

[6] Dominique Désérable. A Family of Cayley Graphs on the Hexavalent Grid , 1999, Discret. Appl. Math..

[7] Vinod K. Agarwal,et al. Almost Sure Diagnosis of Almost Every Good Element , 1994, IEEE Trans. Computers.

[8] Roman Trobec,et al. Optimal Routing in Toroidal Networks , 1992, Inf. Process. Lett..

[9] Roman Trobec,et al. Local Diagnosis in Massively Parallel Systems , 1997, Parallel Comput..

[10] Ivan Stojmenovic,et al. Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..