Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting

Journal Article · Sun Apr 01 00:00:00 EST 1990 · IEEE Transactions on Parallel and Distributed Systems; (USA)

DOI:https://doi.org/10.1109/71.80135· OSTI ID:6397724

Chen, Y C; Chen, W T ^[1]; Chen, G H ^[2]; Sheu, J P ^[3]

---

1. Inst. of Computer Science, National Tsing Hua Univ., Hsinchu 30043 (TW)
2. Dept. of Computer Science and Information Engineering, National Taiwan Univ., Taipei (TW)
3. Dept. of Electrical Engineering, National Central Univ., Chung-Li (TW)

Semigroup and prefix computations on two-dimensional mesh-connected computers with multiple broadcasting (2-MCCMB's) are studied in this paper. Previously, only square 2-MCCMB's with N processing elements were considered or semigroup computations of N data items, and O(N{sup 1/6}) time was required. It is found that square machines are not the best form for semigroup computations, and an O(N{sup 1/8}) time algorithm is thus derived on an N{sup 5/8} {times} N{sup 3/8} rectangular 2-MCCMB. This time complexity can be further reduced to O(N{sup 1/9}) if fewer PE's are used. Following the same way, parallel algorithms for prefix computations are also derived with the same time complexities.

• OSTI ID: 6397724
• Journal Information: IEEE Transactions on Parallel and Distributed Systems; (USA), Vol. 1:2; ISSN 1045-9219
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARRAY PROCESSORS
DESIGN
PARALLEL PROCESSING
ALGORITHMS
EFFICIENCY
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers