THE METHOD OF OBTAINING THE BOUNDARIES OF THE DOMAINS OF THE FUNCTIONS OF GLOBAL DEPENDENCES IN PARALLELING COMPUTATION PROBLEMS
Abstract
A method to obtain the domains of the functions of global dependences based on the refined approximations of the set of tiles is developed. The exact presentation of the boundaries of the domains of the functions of global dependences avoids redundant computations in the performance of communication operations and provides more opportunities for granular paralleling algorithms.
About the Authors
P. I. Sobolevsky
Institute of Mathematics of the National Academy of Sciences of Belarus, Minsk
Belarus
Belarus
N. A. Likhoded
Belarusian State University, Minsk
Belarus
Belarus
P. A. Mandrik
Belarusian State University, Minsk
Belarus
Belarus
References
1. Xue J, Cai W. // Parallel Computing. 2002. Vol. 28, N 5. P. 915-939.
2. Kim D., Rajopdhye S. Parameterized tiling for imperfectly nested loops // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February 2009.
3. Tavarageri S., Hartono A., Baskaran M. et al. Parametric tiling of affine loop nests // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria, July 2010.
4. Baskaran M., Ramanujam J., Sadayappan, P. Automatic C-to-CUDA code generation for affine programs // Proc. of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus, March 2010.
5. Толстиков А. А., Лиходед Н. А. Функции, определяющие информационную структуру зернистых алгоритмов // XI Белорусская математическая конференция: тез. докл. Междунар. науч. конф. Минск, Респ. Беларусь, 5-8 нояб. 2012 г. Минск, 2012. Ч. 3. С. 23-24.
6. Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002.
7. Соболевский П. И., Баханович С. В. // Весщ НАН Беларуи. Сер. фiз.-мат. навук. 2012. № 4. С. 111-117.
Review
Views: 688
Email this article 