Communication structures for asynchronous algorithms on distributed MIMD computers

Author

Nieplocha, Jaroslaw ; Carroll, Chester C.

Author_Institution

Dept. of Electr. Eng., Alabama Univ., Tuscaloosa, AL, USA

fYear

1993

fDate

27-29 Jan 1993

Firstpage

291

Lastpage

298

Abstract

Addresses communication in asynchronous algorithms implemented on distributed MIMD processors. The communication factor significantly affects the convergence rate and performance of these algorithms, and therefore requires special attention in distributed MIMD implementations. A sufficient condition to avoid starvation due to the communication cost is given. Several communication schemes for this problem-suitable for current distributed multiprocesser architectures-are presented and discussed with respect to their efficiency and correctness. These schemes may be used for efficient implementation of various asynchronous algorithms

Keywords

algorithm theory; convergence; parallel algorithms; parallel architectures; asynchronous algorithms; communication cost; communication structures; convergence rate; correctness; distributed MIMD computers; distributed multiprocesser architectures; efficiency; efficient implementation; performance; starvation; Convergence; Costs; Delay; Differential equations; Distributed computing; H infinity control; Layout; Nonlinear equations; Stochastic systems; Sufficient conditions;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1993. Proceedings. Euromicro Workshop on

Conference_Location

Gran Canaria

Print_ISBN

0-8186-3610-6

Type

conf

DOI

10.1109/EMPDP.1993.336389

Filename

336389