Order preserving event aggregation in TBONs

Tobias Hilbrich, Matthias S. Müller, Martin Schulz, Bronis R. De Supinski

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

Runtime tools for MPI applications must gather information from all processes to a tool front-end for presentation. Scalability requies that tools aggregate and reduce this information so tool developers often use a Tree Based Overlay Network (TBON). TBONs aggregate multiple associated events through a hierarchical communication structure. We present a novel algorithm to execute multiple aggregations while, at the same time, preserving relevant event orders. We implement this algorithm in our tool infrastructure that provides TBON functionality as one of its services. We demonstrate that our approach provides scalability with experiments for up to 2048 tasks.

Original languageEnglish
Title of host publicationRecent Advances in the Message Passing Interface - 18th European MPI Users' Group Meeting, EuroMPI 2011, Proceedings
Pages19-28
Number of pages10
DOIs
StatePublished - 2011
Externally publishedYes
Event18th European Message Passing Interface Users' Group Meeting, EuroMPI 2011 - Santorini, Greece
Duration: 18 Sep 201121 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6960 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th European Message Passing Interface Users' Group Meeting, EuroMPI 2011
Country/TerritoryGreece
CitySantorini
Period18/09/1121/09/11

Fingerprint

Dive into the research topics of 'Order preserving event aggregation in TBONs'. Together they form a unique fingerprint.

Cite this