Automatic mapping of sequential programs to parallel computers with distributed memory

This work is aimed at creating an automatically parallelizing compiler for a distributed memory computing system. The conditions for the correctness of parallelization of the considered sequential programs on a computing system with distributed memory are described. The article considers the problem...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science Vol. 229; pp. 236 - 244
Main Authors: Bagliy, A.P., Krivosheev, N.M., Steinberg, B.Ya
Format: Journal Article
Language:English
Published: Elsevier B.V 2023
Subjects:
automation of parallelization
data placement
data transfers
distributed memory
program transformations
automation of parallelization
data transfers
distributed memory
data placement
program transformations
ISSN:1877-0509, 1877-0509
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work is aimed at creating an automatically parallelizing compiler for a distributed memory computing system. The conditions for the correctness of parallelization of the considered sequential programs on a computing system with distributed memory are described. The article considers the problem of placing data in distributed memory with minimization of interprocessor transfers for a program represented by a sequence of parallelizable loops. To solve this problem, an auxiliary bipartite “statements-variables” graph (SVG) is constructed and analyzed from the text of the program. The problem of grouping transfers of small data volumes into a smaller number of transfers of large data volumes is considered. The solution of this problem also leads to minimization of the time for data transfer. New chips with distributed local memory of thousands of cores have higher performance than the previous ones. Therefore, the development of compilers for the development of such microcircuits is necessary and relevant.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2023.12.025