FUNCTIONS ASSIGNING THE DEPENDENCES OF GRAINED ALGORITHMS
Abstract
In case of parallel grained affine algorithm a method of obtaining dependences is developed. Propositions to formalize the dependences in parallel grained algorithms are stated and proved.
About the Authors
N. A. LIKHODED
Белорусский государственный университет, Минск
Belarus
Belarus
A. A. TOLSTIKOV
Белорусский государственный университет, Минск
Belarus
Belarus
References
1. Xue J., Cai W. // Parallel Computing. 2002. Vol. 28, N 5. P. 915–939.
2. Kim D. G., Rajopadhye S. // Technical Report CS-09-101, Colorado State University, Department of Computer Science, February. 2009. – 21 p.
3. Tavarageri S., Hartono A., Baskaran M. et al. // Proc. 15th Workshop on Compilers for Parallel Computers. Vienna, Austria. 2010. July.
4. Baskaran M., Ramanujam J., Sadayappan P. // Proceedings of the Compiler Construction, 19th International Conference. Part of the Joint European Conferences on Theory and Practice of Software. Paphos, Cyprus. 2010. March.
5. Di P., Ye D., Su Yu et al. // 41st International Conference on Parallel Processing. Pittsburgh, 2012. P. 350–359.
6. Bandishti V., Pananilath I., Bondhugula U. // Proceedings of Supercomputing. Los Alamitos, CA, USA. IEEE Computer Society Press, 2012. P. 40:1–40:11.
7. Воеводин В. В., Воеводин Вл. В. Параллельные вычисления. СПб., 2002. – 608 с.
8. Лиходед Н. А., Соболевский П. И. // Докл. НАН Беларуси. 2011. Т. 55, № 2. С. 22–26.
9. Толстиков А. А., Лиходед Н. А. // Тез. докл. Междунар. науч. конф. «XI Белорусская математическая конференция». Минск, 5–8 нояб. 2012 г. Минск, 2012. Ч. 3. С. 23–24.
Review
Views: 670
Email this article 