Polynomial-time Construction of Optimal MPI Derived Datatype
Trees

D 2016

Polynomial-time Construction of Optimal MPI Derived Datatype Trees

GANIAN, Robert, Martin KALANY, Stefan SZEIDER and Jesper Larsson TRAFF

Basic information

Original name

Polynomial-time Construction of Optimal MPI Derived Datatype Trees

Authors

GANIAN, Robert (203 Czech Republic, guarantor, belonging to the institution), Martin KALANY (40 Austria), Stefan SZEIDER (40 Austria) and Jesper Larsson TRAFF (40 Austria)

Edition

NEW YORK, 2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016), p. 638-647, 10 pp. 2016

Publisher

IEEE

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

RIV identification code

RIV/00216224:14330/16:00093947

Organization unit

Faculty of Informatics

ISBN

978-1-5090-2140-6

ISSN

DOI

http://dx.doi.org/10.1109/IPDPS.2016.13

UT WoS

000391251800066

Keywords in English

MPI; derived datatypes; type reconstruction; dynamic programming

Abstract

V originále

The derived datatype mechanism is a powerful, integral feature of the Message-Passing Interface (MPI) for communicating arbitrarily structured, possibly non-consecutive and non-homogeneous application data. MPI defines a set of derived datatype constructors of increasing generality, which allows to describe arbitrary data layouts in a reasonably compact fashion. The constructors may be applied recursively, leading to tree-like representations of the application data layouts. Efficient derived datatype representations are required for MPI implementations to efficiently access and process structured application data. We study the problem of finding tree-like representations of MPI derived datatypes that are optimal in terms of space and processing cost. More precisely, we consider the so-called MPI TYPE TREE RECONSTRUCTION PROBLEM of determining a least-cost treelike representation of a given data layout for a given set of constructors. In an additive cost model that accounts for the space consumption of the constructors and lower-bounds the processing costs, we show that the problem can be solved in polynomial time for the full set of MPI datatype constructors. Our algorithm uses dynamic programming and requires the solution of a series of shortest path problems on an incrementally built, directed, acyclic graph.

Citovat

GANIAN, Robert, Martin KALANY, Stefan SZEIDER and Jesper Larsson TRAFF. Polynomial-time Construction of Optimal MPI Derived Datatype Trees. Online. In 2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016). NEW YORK: IEEE, 2016, p. 638-647. ISBN 978-1-5090-2140-6. Available from: https://dx.doi.org/10.1109/IPDPS.2016.13.

@inproceedings{1376047,
   author = {Ganian, Robert and Kalany, Martin and Szeider, Stefan and Traff, Jesper Larsson},
   address = {NEW YORK},
   booktitle = {2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016)},
   doi = {http://dx.doi.org/10.1109/IPDPS.2016.13},
   keywords = {MPI; derived datatypes; type reconstruction; dynamic programming},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {NEW YORK},
   isbn = {978-1-5090-2140-6},
   pages = {638-647},
   publisher = {IEEE},
   title = {Polynomial-time Construction of Optimal MPI Derived Datatype Trees},
   year = {2016}
}

TY  - JOUR
ID  - 1376047
AU  - Ganian, Robert - Kalany, Martin - Szeider, Stefan - Traff, Jesper Larsson
PY  - 2016
TI  - Polynomial-time Construction of Optimal MPI Derived Datatype Trees
PB  - IEEE
CY  - NEW YORK
SN  - 9781509021406
KW  - MPI
KW  - derived datatypes
KW  - type reconstruction
KW  - dynamic programming
N2  - The derived datatype mechanism is a powerful, integral feature of the Message-Passing Interface (MPI) for communicating arbitrarily structured, possibly non-consecutive and non-homogeneous application data. MPI defines a set of derived datatype constructors of increasing generality, which allows to describe arbitrary data layouts in a reasonably compact fashion. The constructors may be applied recursively, leading to tree-like representations of the application data layouts. Efficient derived datatype representations are required for MPI implementations to efficiently access and process structured application data. We study the problem of finding tree-like representations of MPI derived datatypes that are optimal in terms of space and processing cost. More precisely, we consider the so-called MPI TYPE TREE RECONSTRUCTION PROBLEM of determining a least-cost treelike representation of a given data layout for a given set of constructors. In an additive cost model that accounts for the space consumption of the constructors and lower-bounds the processing costs, we show that the problem can be solved in polynomial time for the full set of MPI datatype constructors. Our algorithm uses dynamic programming and requires the solution of a series of shortest path problems on an incrementally built, directed, acyclic graph.
ER  -

GANIAN, Robert, Martin KALANY, Stefan SZEIDER and Jesper Larsson TRAFF. Polynomial-time Construction of Optimal MPI Derived Datatype Trees. Online. In \textit{2016 IEEE 30TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2016)}. NEW YORK: IEEE, 2016, p.~638-647. ISBN~978-1-5090-2140-6. Available from: https://dx.doi.org/10.1109/IPDPS.2016.13.

Detailed Information on Publication Record