By Topic

A new network topology with multiple meshes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Das, D. ; Electron. Unit, Indian Stat. Inst., Calcutta, India ; De, M. ; Sinha, B.P.

This paper introduces a new network topology, called Multi-Mesh (MM), which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The proposed network consists of n 4 processors and is 4-regular with a diameter of 2n. The network also contains a Hamiltonian cycle. Simple routing algorithms for point-to-point communication, one-to-all broadcast, and multicast have been described for this network. It is shown that a simple n2×n2 mesh can also be emulated on this network in O(1) time. Several application examples have been discussed for which this network is found to be more efficient with regard to computational time than the corresponding mesh with the same number of processors. As examples, O(n) time algorithms for finding the sum, average, minimum, and maximum of n4 data values, located at n 4 different processors have been discussed. Time-efficient implementations of algorithms for solving nontrivial problems, e.g., Lagrange's interpolation, matrix transposition, matrix multiplication, and Discrete Fourier Transform (DFT) computation have also been discussed. The time complexity of Lagrange's interpolation on this network is O(n) for n2 data points compared to O(n2) time on mesh of the same size. Matrix transpose requires O(n0.5) time for an n×n. matrix. The time for multiplying two n×n matrices is O(n0.6) with an AT-cost of O(n3). DFT of n sample points can be computed in O(n0.6) time on this network. The previous papers show that n 4 data elements can be sorted on this network in O(n) time

Published in:

Computers, IEEE Transactions on  (Volume:48 ,  Issue: 5 )