Affine Dependence Classification for Communications Minimization |
| |
Authors: | Catherine Mongenet |
| |
Affiliation: | (1) Laboratoire ICPS, Pôle API, Université Louis Pasteur de Strasbourg, Boulevard Sébastien Brant, 67400 Illkirch, France |
| |
Abstract: | This paper introduces results on placement and communications minimization for systems of affine recurrence equations. We show how to classify the dependences according to the number and nature of communications they may result in. We give both communication-free conditions and conditions for an efficient use of broadcast or neighbor-to-neighbor communication primitives. Since the dependences of a problem can generally not be all communication-free, we finally introduce a heuristic to globally minimize the communications based on the classification of dependences. |
| |
Keywords: | Parallelization techniques localization optimization communications minimization systems of recurrence equations loops |
本文献已被 SpringerLink 等数据库收录! |