The run-time efficiency of parallel asynchronous algorithms

Author

Dubois, Michel ; Briggs, Fayé A.

Author_Institution

Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA

Volume

40

Issue

11

fYear

1991

fDate

11/1/1991 12:00:00 AM

Firstpage

1260

Lastpage

1266

Abstract

The problem studied is similar to the problems found in multiprocessor operating systems. The lockout problem in multiprocessor operating systems is a direct result of multiple processors attempting to process common data structures asynchronously. There are numerous such shared data structures. The models developed are applicable to the study of contention for software and hardware resources in multiprocessor operating systems. The authors introduce an approximate analytical model to evaluate the performance of asynchronous processes found in asynchronous algorithms, including the combined effects of software lockout on critical sections and on job queues, and of shared-memory access conflicts. Because of the strong similarities between the two effects, the same model can be used for both, leading to a uniform and elegant formulation. The models are combined to find the run-time efficiency of asynchronous iterations

Keywords

data structures; network operating systems; parallel algorithms; performance evaluation; approximate analytical model; hardware resources; job queues; multiprocessor operating systems; parallel asynchronous algorithms; performance evaluation; run-time efficiency; shared data structures; shared-memory access conflicts; software lockout; software resources; Algorithm design and analysis; Concurrent computing; Dynamic scheduling; Hardware; Iterative algorithms; Partial differential equations; Processor scheduling; Runtime; Scheduling algorithm; Software algorithms;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/12.102830

Filename

102830