skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Broadcasting a message in a parallel computer

Abstract

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

Inventors:
 [1];  [1]
  1. Rochester, MN
Publication Date:
Research Org.:
International Business Machines Corp., Armonk, NY (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1026666
Patent Number(s):
7,991,857
Application Number:
12/053,902
Assignee:
International Business Machines Corporation (Armonk, NY)
DOE Contract Number:  
B554331
Resource Type:
Patent
Resource Relation:
Patent File Date: 2008 Mar 24
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING

Citation Formats

Berg, Jeremy E, and Faraj, Ahmad A. Broadcasting a message in a parallel computer. United States: N. p., 2011. Web.
Berg, Jeremy E, & Faraj, Ahmad A. Broadcasting a message in a parallel computer. United States.
Berg, Jeremy E, and Faraj, Ahmad A. Tue . "Broadcasting a message in a parallel computer". United States. https://www.osti.gov/servlets/purl/1026666.
@article{osti_1026666,
title = {Broadcasting a message in a parallel computer},
author = {Berg, Jeremy E and Faraj, Ahmad A},
abstractNote = {Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.},
doi = {},
url = {https://www.osti.gov/biblio/1026666}, journal = {},
number = ,
volume = ,
place = {United States},
year = {2011},
month = {8}
}

Patent:

Save / Share:

Works referenced in this record:

Computing parallel prefix and reduction using coterie structures
conference, January 1992

  • Herbordt, M. C.; Weems, C. C.
  • [1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation
  • https://doi.org/10.1109/FMPC.1992.234895

Optimization of MPI collectives on clusters of large-scale SMP's
conference, January 1999


Universality of mixed action extrapolation formulae
journal, April 2009


Computing the Hough transform on a scan line array processor (image processing)
journal, March 1989


DADO: A tree-structured machine architecture for production systems
report, March 1982


Efficient MPI Collective Operations for Clusters in Long-and-Fast Networks
conference, September 2006


Bandwidth Efficient All-reduce Operation on Tree Topologies
conference, March 2007


Interleaved all-to-all reliable broadcast on meshes and hypercubes
journal, May 1994


Efficient algorithms for all-to-all communications in multiport message-passing systems
journal, January 1997