A new network topology with multiple three-dimensional meshes

Authors:
Nahid Afroz;Bhabani P. Sinha;Rabiul Islam;Subir Bandyopadhyay
Affiliations:
School of Computer Science, University of Windsor, Windsor, Ontario, Canada;Indian Statistical Institute, Calcutta, India;School of Computer Science, University of Windsor, Windsor, Ontario, Canada;School of Computer Science, University of Windsor, Windsor, Ontario, Canada
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 7
Cited 1

The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Randomised algorithms for packet routing on the mesh

Advances in parallel algorithms
An Efficient Sorting Algorithm on the Multi-Mesh Network

IEEE Transactions on Computers
A New Network Topology with Multiple Meshes

IEEE Transactions on Computers
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Mesh-Connected Computers with Broadcasting

IEEE Transactions on Computers

The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new network topology, called the 3D Multi-Mesh (3D MM) is presented here which is an extension of the Multi-Mesh architecture [2]. This network consists of three-dimensional meshes (termed as 3D blocks), each having n3 processors, interconnected in a suitable manner so that the resulting topology is 6-regular with processors and a diameter of only 3n. It is expected that this architecture will enable more efficient algorithm mapping compared to existing architectures.