article · 2007
Communication Optimization on Automatic Program Parallelization
Dong Chun-Li, Zhao Rong-Cai, Ma Zhuo-Jie, Li Dong-Hong
Cited by 0Abstract and details only
Abstract
Minimizing communication by increasing the locality of data references is an important optimization for achieving high performance on distributed memory machines. But in the progress of decomposition, reorganization is inevitable. And the communication produced by reorganization is inevitable too. In this paper, the authors present a linear decomposition algorithm that automatically finding computation and data decomposition, including finding data and computations decomposition that has data reorganization communication. And the authors improve the method and reduce the communication cost by merging parallel regions with the same data decomposition.
Cite this paper
Chun-Li, D., Rong-Cai, Z., Zhuo-Jie, M., & Dong-Hong, L. (2007). Communication Optimization on Automatic Program Parallelization. https://doi.org/10.1109/snpd.2007.380
Chun-Li, Dong, et al. “Communication Optimization on Automatic Program Parallelization.” vol. 5, 2007, pp. 437–42, https://doi.org/10.1109/snpd.2007.380.
Chun-Li, Dong, Zhao Rong-Cai, Ma Zhuo-Jie, and Li Dong-Hong. 2007. “Communication Optimization on Automatic Program Parallelization.” https://doi.org/10.1109/snpd.2007.380.
Chun-Li, D. et al. (2007) ‘Communication Optimization on Automatic Program Parallelization’. Available at: https://doi.org/10.1109/snpd.2007.380.
@article{chunli2007communication,
title = {{Communication Optimization on Automatic Program Parallelization}},
author = {Chun-Li, Dong and Rong-Cai, Zhao and Zhuo-Jie, Ma and Dong-Hong, Li},
volume = {5},
pages = {437--442},
year = {2007},
doi = {10.1109/snpd.2007.380}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.