loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
9th International Parallel Processing Symposium
Replication of uniformly accessed shared data for large-scale data-parallel algorithms
Santa Barbara, CA
April 25-April 28
ISBN: 0-8186-7074-6
Chung-Ming Chen, Center for Biomed. Eng, Nat. Taiwan Univ., Taipei, Taiwan
Soo-Young Lee, Center for Biomed. Eng, Nat. Taiwan Univ., Taipei, Taiwan
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.
Index Terms:
parallel algorithms; replicated databases; shared memory systems; shared data; large-scale data-parallel algorithms; data sharing; parallel algorithms; replicated data
Citation:
Chung-Ming Chen, Soo-Young Lee, "Replication of uniformly accessed shared data for large-scale data-parallel algorithms," ipps, pp.246, 9th International Parallel Processing Symposium, 1995
Usage of this product signifies your acceptance of the Terms of Use.