2026-04-27T01:38:33Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/291202025-01-30T10:22:26Zcom_10324_1165com_10324_931com_10324_894col_10324_1335

Moreton Fernández, Ana González Escribano, Arturo 2018-03-17T11:18:44Z 2019-01-01T00:40:28Z 2018 Concurrency and Computation, Practice and Experience. 1532-0634 http://uvadoc.uva.es/handle/10324/29120 10.1002/cpe.4430 Many real-world applications feature data accesses on periodic domains. Manually implementing the synchronizations and communications associated to the data dependences on each case is cumbersome and error-prone. It is increasingly interesting to support these applications in high-level parallel programming languages or parallelizing compilers. In this paper, we present a technique that, for distributed-memory systems, calculates the specific communications derived from data-parallel codes with or without periodic boundary conditions on affine access expressions. It makes transparent to the programmer the management of aggregated communications for the chosen data partition. Our technique moves to runtime part of the compile-time analysis typically used to generate the communication code for affine expressions, introducing a complete new technique that also supports the periodic boundary conditions. We present an experimental study to evaluate our proposal using several study cases. Our experimental results show that our approach can automatically obtain communication codes as efficient as those found in MPI reference codes, reducing the development effort. eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/4.0/ Wiley Attribution 4.0 International Automatic Runtime Calculation of Communications for Data-Parallel Expressions with Periodic Conditions info:eu-repo/semantics/article