Affine Transformations of Loop Nests for Parallel Execution and Distribution of Data over Processors

Simple item page
dc.creatorAdutskevich, E. V.
dc.creatorBakhanovich, S. V.
dc.creatorLikhoded, N. A.
dc.date2006-06-07
dc.date.accessioned2026-07-07T07:13:01Z
dc.date.available2026-07-07T07:13:01Z
dc.descriptionThe paper is devoted to the problem of mapping affine loop nests onto distributed memory parallel computers. A method to find affine transformations of loop nests for parallel execution and distribution of data over processors is presented. The method tends to minimize the number of communications between processors and to improve locality of data within one processor. A problem of determination of data exchange sequence is investigated. Conditions to determine the ability to arrange broadcast is presented.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/cs/0606028
dc.identifierhttp://arxiv.org/abs/cs/0606028
dc.identifierPreprint / The National Academy of Sciences of Belarus. Institute of Mathematics: N 3 (574). Minsk, 2005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/112289
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleAffine Transformations of Loop Nests for Parallel Execution and Distribution of Data over Processors
dc.typetext

Files

Collections

arXiv