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

Prefix computations on a generalized mesh-connected computer with multiple buses

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

1 Author(s)
Kun-Liang Chung ; Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan

The mesh-connected computer with multiple buses (MC-CMB) is a well-known parallel organization, providing broadcast facilities in each row and each column. In this paper, we propose a 2D generalized MCCMB (2-GMCCMB) for the purpose of increasing the efficiency of executing some important applications of prefix computations such as solving Linear recurrences and tridiagonaI systems, etc. A k1n1 ×k1n2 2-GMCCMB is constructed from a k 1n1×k1n2 mesh organization by enhancing the power of each disjoint n1×n2 submesh with multiple buses (sub-2-MCCMB). Given n data, a prefix computation can be performed in O(n1/10) time on an n3/5×n2/5 2-GMCCMB, where each disjoint sub-2-MCCMB is of size n1/2×n3/10. This time bound is faster than the previous time bound of O(n1/8) for the same computation on an n5/8×n3/8 2-MCCMB. Furthermore, the time bound of our parallel prefix algorithm can be further reduced to O(n1/11) if fewer processors are used. Our result can be extended to the d-dimensional GMCCMB, giving a time bound of O(n1 (d2(d)+d)/) for any constant d; here, we omit the constant factors. This time bound is less than the previous time bound of O(n1(d2(d))/) on the d-dimensional MCCMB

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:6 ,  Issue: 2 )