Declarative Data Flow in a Graph-Based Distributed Memory Runtime System

CC BY

Saved in:
Bibliographic Details
Main Authors: Fabian, Knorr, Peter, Thoman, Thomas, Fahringer
Format: Book
Language:English
Published: Springer 2023
Subjects:
HPC
MPI
Online Access:https://link.springer.com/article/10.1007/s10766-022-00743-4
https://dlib.phenikaa-uni.edu.vn/handle/PNK/8261
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:localhost:PNK-8261
record_format dspace
spelling oai:localhost:PNK-82612023-04-25T02:20:14Z Declarative Data Flow in a Graph-Based Distributed Memory Runtime System Fabian, Knorr Peter, Thoman Thomas, Fahringer HPC MPI CC BY Runtime systems can significantly reduce the cognitive complexity of scientific applications, narrowing the gap between systems engineering and domain science in HPC. One of the most important angles in this is automating data migration in a cluster. Traditional approaches require the application developer to model communication explicitly, for example through MPI primitives. Celerity, a runtime system for accelerator clusters heavily inspired by the SYCL programming model, instead provides a purely declarative approach focused around access patterns. In addition to eliminating the need for explicit data transfer operations, it provides a basis for efficient and dynamic scheduling at runtime. 2023-04-25T02:20:14Z 2023-04-25T02:20:14Z 2022 Book https://link.springer.com/article/10.1007/s10766-022-00743-4 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8261 en application/pdf Springer
institution Digital Phenikaa
collection Digital Phenikaa
language English
topic HPC
MPI
spellingShingle HPC
MPI
Fabian, Knorr
Peter, Thoman
Thomas, Fahringer
Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
description CC BY
format Book
author Fabian, Knorr
Peter, Thoman
Thomas, Fahringer
author_facet Fabian, Knorr
Peter, Thoman
Thomas, Fahringer
author_sort Fabian, Knorr
title Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
title_short Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
title_full Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
title_fullStr Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
title_full_unstemmed Declarative Data Flow in a Graph-Based Distributed Memory Runtime System
title_sort declarative data flow in a graph-based distributed memory runtime system
publisher Springer
publishDate 2023
url https://link.springer.com/article/10.1007/s10766-022-00743-4
https://dlib.phenikaa-uni.edu.vn/handle/PNK/8261
_version_ 1764177435774943232
score 8.881002