Broadcasting a message in a parallel computer
Abstract
Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.
- Inventors:
- Issue Date:
- Research Org.:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1083445
- Patent Number(s):
- 8422402
- Application Number:
- 12/060,492
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04L - TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- DOE Contract Number:
- B554331
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Archer, Charles J, and Faraj, Ahmad A. Broadcasting a message in a parallel computer. United States: N. p., 2013.
Web.
Archer, Charles J, & Faraj, Ahmad A. Broadcasting a message in a parallel computer. United States.
Archer, Charles J, and Faraj, Ahmad A. Tue .
"Broadcasting a message in a parallel computer". United States. https://www.osti.gov/servlets/purl/1083445.
@article{osti_1083445,
title = {Broadcasting a message in a parallel computer},
author = {Archer, Charles J and Faraj, Ahmad A},
abstractNote = {Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2013},
month = {4}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Interleaved all-to-all reliable broadcast on meshes and hypercubes
journal, May 1994
- Sunggu Lee, ; Shin, K. G.
- IEEE Transactions on Parallel and Distributed Systems, Vol. 5, Issue 5
Computing the Hough transform on a scan line array processor (image processing)
journal, March 1989
- Fisher, A. L.; Highnam, P. T.
- IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 11, Issue 3
Bandwidth Efficient All-reduce Operation on Tree Topologies
conference, March 2007
- Patarasuk, Pitch; Yuan, Xin
- 2007 IEEE International Parallel and Distributed Processing Symposium
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
Towards Efficient Execution of MPI Applications on the Grid: Porting and Optimization Issues
journal, January 2003
- Keller, Rainer; Gabriel, Edgar; Krammer, Bettina
- Journal of Grid Computing, Vol. 1, Issue 2
Optimizing threaded MPI execution on SMP clusters
conference, January 2001
- Tang, Hong; Yang, Tao
- Proceedings of the 15th international conference on Supercomputing - ICS '01
Extending the message passing interface (MPI)
conference, January 1995
- Skjellum, A.; Doss, N. E.; Viswanathan, K.
- Proceedings Scalable Parallel Libraries Conference
Efficient MPI Collective Operations for Clusters in Long-and-Fast Networks
conference, September 2006
- Matsuda, Motohiko; Kudoh, Tomohiro; Kodama, Yuetsu
- 2006 IEEE International Conference on Cluster Computing
Efficient algorithms for all-to-all communications in multiport message-passing systems
journal, January 1997
- Bruck, J.; Kipnis, S.
- IEEE Transactions on Parallel and Distributed Systems, Vol. 8, Issue 11
Coprocessor design to support MPI primitives in configurable multiprocessors
journal, April 2007
- Ziavras, Sotirios G.; Gerbessiotis, Alexandros V.; Bafna, Rohan
- Integration, the VLSI Journal, Vol. 40, Issue 3, p. 235-252
Optimization of MPI collectives on clusters of large-scale SMP's
conference, January 1999
- Sistare, Steve; vandeVaart, Rolf; Loh, Eugene
- Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '99
DADO: A tree-structured machine architecture for production systems
report, March 1982
- Stolfo, Salvatore; Shaw, David Elliot
- Columbia University, 15 p.
- CUCS-24-82