DocumentCode
3202955
Title
Matching algorithms and architecture in hierarchical shared-memory multiprocessor (HSM) systems
Author
Khokhar, Ashfaq ; Dubois, Michel
Author_Institution
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear
1992
fDate
23-26 Mar 1992
Firstpage
558
Lastpage
561
Abstract
The authors map several interprocessor communication and linear algebra algorithms on a memory coherent hierarchical shared-memory multiprocessor (HSM) system and their communication complexities are evaluated. The results show that the hierarchical architecture is ill-suited to algorithms exhibiting no temporal locality on data accesses or to the algorithms with point-to-point communication
Keywords
communication complexity; parallel algorithms; shared memory systems; communication complexities; data accesses; hierarchical architecture; interprocessor communication algorithms; linear algebra algorithms; memory coherent hierarchical shared-memory multiprocessor; point-to-point communication; temporal locality; Algorithm design and analysis; Clustering algorithms; Joining processes; Linear algebra; Multiprocessor interconnection networks; Parallel algorithms; Process design; Protocols; Very large scale integration; Yarn;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location
Beverly Hills, CA
Print_ISBN
0-8186-2672-0
Type
conf
DOI
10.1109/IPPS.1992.222968
Filename
222968
Link To Document