DocumentCode :
2634273
Title :
Replication of uniformly accessed shared data for large-scale data-parallel algorithms
Author :
Chen, Chung-Ming ; Lee, Soo-Young
Author_Institution :
Center for Biomed. Eng, Nat. Taiwan Univ., Taipei, Taiwan
fYear :
1995
fDate :
25-28 Apr 1995
Firstpage :
246
Lastpage :
250
Abstract :
In this paper we show how to minimize data sharing overhead required in most parallel algorithms, especially in Large-Scale Data-Parallel (LSDP) algorithms on a 2D mesh. Two specific issues are addressed in this study. One is what the optimal group size is, i.e., how many PEs should share a copy of shared data. The other is where the replicated data should be allocated
Keywords :
parallel algorithms; replicated databases; shared memory systems; data sharing; large-scale data-parallel algorithms; parallel algorithms; replicated data; shared data; Bidirectional control; Biomedical engineering; Computational modeling; Degradation; Erbium; Large-scale systems; Parallel algorithms; Parallel processing; Partitioning algorithms; Reconstruction algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1995. Proceedings., 9th International
Conference_Location :
Santa Barbara, CA
Print_ISBN :
0-8186-7074-6
Type :
conf
DOI :
10.1109/IPPS.1995.395940
Filename :
395940
Link To Document :
بازگشت