Performance of synchronous parallel algorithms with regular structures

Author

Madala, Sridhar ; Sinclair, James B.

Author_Institution

Coherent Syst., Houston, TX, USA

Volume

2

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

105

Lastpage

116

Abstract

New methods are presented for bounding and approximating the mean execution time of partitioning algorithm, and these methods are compared to previous approaches. Distribution-driven and program-driven simulations show that two of the methods are usually accurate to within 10% and give good estimates even when certain independence assumptions are violated. Asymptotic approximations and upper bounds are derived for the average execution time of multiphase algorithms when there is no contention for processes in the parallel phase. In addition, the authors bound the average execution time under static and dynamic scheduling policies and determine the optimum number of parallel tasks to be created to minimize the execution time bounds with constant scheduling overhead

Keywords

parallel algorithms; parallel programming; performance evaluation; scheduling; asymptotic approximations; average execution time; bounding; distribution driven simulations; execution time bounds; mean execution time; multiphase algorithms; parallel tasks; partitioning algorithm; program-driven simulations; regular structures; scheduling policies; synchronous parallel algorithms; upper bounds; Communication channels; Concurrent computing; Delay effects; Dynamic scheduling; Parallel algorithms; Parallel processing; Partitioning algorithms; Performance analysis; Processor scheduling; Upper bound;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.80193

Filename

80193