A structuring technique for compute-aggregate-broadcast algorithms on distributed memory computers

Author

Kwan, Andrew W. ; Bic, Lubomir

Author_Institution

Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA

fYear

1992

fDate

23-26 Mar 1992

Firstpage

10

Lastpage

17

Abstract

A technique for structuring compute-aggregate-broadcast algorithms on distributed memory computers is presented. The compute-aggregate-broadcast paradigm provides an abstraction of the problem for the programmer, allowing for separation of computation and synchronization. Such algorithms are well suited for application on distributed memory computers. The structuring technique assists the parallel programmer with synchronization, allowing the programmer to concentrate more on developing code for computation. Two examples are presented

Keywords

distributed memory systems; parallel algorithms; compute-aggregate-broadcast algorithms; distributed memory computers; structuring technique; synchronization; Application software; Computer architecture; Computer science; Concurrent computing; Costs; Distributed computing; Multiprocessor interconnection networks; Parallel processing; Parallel programming; Programming profession;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1992. Proceedings., Sixth International

Conference_Location

Beverly Hills, CA

Print_ISBN

0-8186-2672-0

Type

conf

DOI

10.1109/IPPS.1992.223079

Filename

223079