2026-04-22T21:09:48Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/704452025-01-30T10:20:55Zcom_10324_1165com_10324_931com_10324_894col_10324_1337

Moreton Fernández, Ana González Escribano, Arturo Llanos Ferraris, Diego Rafael 2016 Producción Científica Programming for distributed-memory systems imposes specific challenges. In these systems, minimizing synchronization and communication overheads is key for performance improvement. A typical approach is to use a message-passing paradigm to exploit static partition policies and to generate coarse-grain computations with aggregated communication phases. However, irregular or data-dependent programs that need dynamic data redistributions become more complicated to develop and debug. In this paper we present four abstract array distribution operators that allow to efficiently implement programs on distributed-memory systems, making the data partition, relocation, and data movement transparent to the programmer. Our experimental results show that our approach does not imply significant overheads, while achieving good scalability for combinations of data-dependent, irregular, or recursive parallel structures on distributed-memory systems. application/pdf https://uvadoc.uva.es/handle/10324/70445 eng Informática 1203 Ciencia de Los Ordenadores 3304 Tecnología de Los Ordenadores Four abstract array distribution operators info:eu-repo/semantics/conferenceObject 18 p. TEXT UVaDOC. Repositorio Documental de la Universidad de Valladolid Hispana