DocumentCode
3163883
Title
A practical hierarchical model of parallel computation
Author
Heywood, Todd ; Ranka, Sanjay
Author_Institution
Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA
fYear
1991
fDate
2-5 Dec 1991
Firstpage
18
Lastpage
25
Abstract
A model of parallel computation is introduced which employs the PRAM as a sub-model, while simultaneously being more reflective of realistic parallel architectures by accounting for and providing abstract control over communication and synchronization costs. Cost control is achieved via the representation of general degrees of locality (`neighborhoods´ of activity). The model organizes `control asynchrony´ via an implicit hierarchy relation, and restricts `communication asynchrony´ in order to obtain determinate algorithms
Keywords
parallel algorithms; parallel architectures; synchronisation; H-PRAM; PRAM; communication asynchrony; control asynchrony; degrees of locality; determinate algorithms; hierarchical model; hierarchy relation; synchronization costs; Communication system control; Computational modeling; Computer architecture; Concurrent computing; Costs; Information science; Partitioning algorithms; Phase change random access memory; Reflectivity;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2310-1
Type
conf
DOI
10.1109/SPDP.1991.218301
Filename
218301
Link To Document