Replication of Uniformly Accessed Shared Data for Large-scale Data-Parallel Algorithms*

In this paper, we show how t o minimize data shar-ang overhead required in most pamllel a1 oriihms, es-pecially in Large-scale Data-Parallel &SDP) algo-n thms, on a 2D mesh. T w o s ecific issues are ad-dressed in this study. O n e is w!at the optimal group s u e as, i.e., how many PES should share a copy of shared data. The other is where $he replicated data should be allocated.