Optimal multinode broadcast on a mesh connected graph with reduced bufferization

Abderezak Touzene, Brigitte Plateau

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We present an optimal all-to-all communication procedure for a mesh connected topology of processors with wrap-around (a torus). This procedure is based on a spanning tree method and uses a reduced bufferization space.

Original languageEnglish
Title of host publicationDistributed Memory Computing - 2nd European Conference, EDMCC2, Proceedings
PublisherSpringer Verlag
Pages143-152
Number of pages10
Volume487 LNCS
ISBN (Print)9783540539513
DOIs
Publication statusPublished - 1991
Event2nd European Distributed Memory Computing Conference, EDMCC 1991 - Munich, Germany
Duration: Apr 22 1991Apr 24 1991

Publication series

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

Other

Other2nd European Distributed Memory Computing Conference, EDMCC 1991
CountryGermany
CityMunich
Period4/22/914/24/91

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Optimal multinode broadcast on a mesh connected graph with reduced bufferization'. Together they form a unique fingerprint.

  • Cite this

    Touzene, A., & Plateau, B. (1991). Optimal multinode broadcast on a mesh connected graph with reduced bufferization. In Distributed Memory Computing - 2nd European Conference, EDMCC2, Proceedings (Vol. 487 LNCS, pp. 143-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 487 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0032931