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

Author

Chen, Yen-Cheng ; Chen, Wen-Tsuen ; Chen, Gen-Huey ; Sheu, Jang-Ping

Author_Institution

Inst. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan

Volume

1

Issue

2

fYear

1990

fDate

4/1/1990 12:00:00 AM

Firstpage

241

Lastpage

246

Abstract

Semigroup and prefix computations on two-dimensional mesh-connected computers with multiple broadcasting (2-MCCMBs) are studied. Previously, only square 2-MCCMBs with N processing elements were considered for semigroup computations of N data items, and O(N^1/6) time was required. It is found that square machines are not the best form for semigroup computations, and an O(N^1/8)-time algorithm is derived on an N^5/8×N^3/8 rectangular 2-MCCMB. This time complexity can be further reduced to O(N^1/9) if fewer processing elements are used. Parallel algorithms for prefix computations with the same time complexities are derived

Keywords

computational complexity; multiprocessor interconnection networks; parallel algorithms; parallel architectures; 2-MCCMBs; mech-connected computers; multiple broadcasting; parallel algorithms; prefix computations; semigroup computations; time complexity; Algorithm design and analysis; Broadcasting; Computer architecture; Computer science; Concurrent computing; Hardware; Nearest neighbor searches; Parallel algorithms; Parallel processing; Very large scale integration;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.80135

Filename

80135