Time cost analysis of parallel structures with multi-communication nodes in a shared memory

Author

Hu, Mei-Yu ; Ammar, Reda A.

Author_Institution

Dept. of Comput. Sci. & Eng., Connecticut Univ., Storrs, CT, USA

fYear

1992

fDate

1-3 April 1992

Firstpage

47

Lastpage

54

Abstract

The time costs of several parallel computation structures are analyzed. These analyses are based on assumptions that the processes communicate implicitly via the shared memory and that a locking mechanism is imposed on the access to shared variables. In previous work, an approach to estimating a set of special parallel computation structures has been developed. The authors expand this approach and propose a new technique for covering more general parallel computation structures.<>

Keywords

computational complexity; parallel programming; shared memory systems; locking mechanism; multi-communication nodes; parallel computation structures; parallel structures; shared memory; shared variables; time costs; Communication system control; Computational efficiency; Computational modeling; Computer science; Concurrent computing; Costs; Data flow computing; Flow graphs; Time measurement; Time sharing computer systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Computers and Communications, 1992. Conference Proceedings., Eleventh Annual International Phoenix Conference on

Conference_Location

Scottsdale, AZ, USA

Print_ISBN

0-7803-0605-8

Type

conf

DOI

10.1109/PCCC.1992.200537

Filename

200537