Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Multi-Mesh-an efficient topology for parallel processing

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

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

This paper introduces a new interconnection scheme, called Multi-Mesh (MM) network, for parallel processing which uses multiple meshes as the basic building blocks interconnected in a suitable manner. The interconnection pattern is regular and suitable for VLSI implementation. Each processor in the network has degree four with a resulting diameter upper bounded by 2n for n4 processors. Routing can easily be done within 2n time on this network. Sum/minimum/maximum of n4 data values can be found in O(n) time. Two n×n matrices can be multiplied by the MM network in O(n 0.6) with an AT-cost of O(n3). The DFT of n sample points can be computed in O(n0.6) time on this network. Sorting of n3 data elements resident on n3 processors can be done in 2n log n+14n+o(n) time

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995