Introduction to numerical analysis: 2nd edition
Introduction to numerical analysis: 2nd edition
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Lagrange interpolation on a processor tree with ring connections
Journal of Parallel and Distributed Computing
Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees
IEEE Transactions on Parallel and Distributed Systems
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
A New Network Topology with Multiple Meshes
IEEE Transactions on Computers
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
A modified Newton method for polynomials
Communications of the ACM
Parallel Sorting Algorithms
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Multi-Mesh-an efficient topology for parallel processing
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Cost-efficient parallel programs based on set-distributions for polynomial interpolation
Journal of Parallel and Distributed Computing
Parallel sorting on ILLIAC array processor
ISTASC'07 Proceedings of the 7th Conference on 7th WSEAS International Conference on Systems Theory and Scientific Computation - Volume 7
ROE sorting on ILLIAC array processor
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Parallel algorithm for sorting on OTIS-ring multicomputer
Proceedings of the 2nd Bangalore Annual Compute Conference
ENOD sort on diamond architecture
SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
A new parallel sorting on diamond architecture
ECC'10 Proceedings of the 4th conference on European computing conference
ENOD sort on diamond architecture
ELECTRO'10 Proceedings of the 8th WSEAS international conference on Applied electromagnetics, wireless and optical communications
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
| Hi-index | 0.00 |
In recent years the multi-mesh network [Proceedings of the Ninth International Parallel Processing Symposium, Santa Barbara, CA, April 25-28, 1995, 17; IEEE Trans. on Comput. 68 (5) (1999) 536] has created a lot of interests among the researchers for its efficient topological properties. Several parallel algorithms for various trivial and non-trivial problems have been mapped on this network. However, because of its O(n) diameter, a large class of algorithms that involves frequent data broadcast in a row or in a column or between the diametrically opposite processors, requires O(n) time on an n × n multi-mesh. In search of faster algorithms, we introduce, in this paper, a new network topology, called multi-mesh of trees. This network is built around the multi-mesh network and the mesh of trees. As a result it can perform as efficiently as a multi-mesh network and also as efficiently as a mesh of trees. Several topological properties, including number of links, diameter, bisection width and decomposition are discussed. We present the parallel algorithms for finding sum of n4 elements and the n2-point Lagrange interpolation both in O(log n) time. The solution of n2-degree polynomial equation, n2-point DFT computation and sorting of n2 elements are all shown to run in O(log n) time too. The communication algorithms one-to-all, row broadcast and column broadcast are also described in O(log n) time. This can be compared with O(n) time algorithms on multi-mesh network for all these problems.