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

Title: Class network routing

Patent ·
OSTI ID:988822
 [1];  [2];  [3];  [4];  [5];  [6];  [7];  [5];  [5];  [8]
  1. Princeton, NJ
  2. Ridgefield, CT
  3. Croton On Hudson, NY
  4. Yorktown Heights, NY
  5. Mount Kisco, NY
  6. Irvington, NY
  7. Cortlandt Manor, NY
  8. Bedford Hills, NY
+ Show Author Affiliations

Class network routing is implemented in a network such as a computer network comprising a plurality of parallel compute processors at nodes thereof. Class network routing allows a compute processor to broadcast a message to a range (one or more) of other compute processors in the computer network, such as processors in a column or a row. Normally this type of operation requires a separate message to be sent to each processor. With class network routing pursuant to the invention, a single message is sufficient, which generally reduces the total number of messages in the network as well as the latency to do a broadcast. Class network routing is also applied to dense matrix inversion algorithms on distributed memory parallel supercomputers with hardware class function (multicast) capability. This is achieved by exploiting the fact that the communication patterns of dense matrix inversion can be served by hardware class functions, which results in faster execution times.

Research Organization:
Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
Sponsoring Organization:
USDOE
DOE Contract Number:
W-7405-ENG-48
Assignee:
International Business Machines Corporation (Armonk, NY)
Patent Number(s):
7,587,516
Application Number:
10/468,999
OSTI ID:
988822
Country of Publication:
United States
Language:
English

References (4)

Multicast routing in internetworks and extended LANs conference January 1988
Performance Evaluation of Multicast Wormhole Routing in 2d-Torus Multicomputers journal September 1992
A systolic architecture for fast dense matrix inversion journal March 1989
An optimal scheduling procedure for matrix inversion on linear array at a processor level journal August 1994

Similar Records

Optimal software multicast in wormhole-routed multistage networks
Book · Sat Dec 31 00:00:00 EST 1994 · OSTI ID:988822
Relay approach message routing in hypercube multiprocessors
Conference · Fri Jan 01 00:00:00 EST 1988 · OSTI ID:988822
Routing schemes for the augmented data manipulator network in an MIMD system
Journal Article · Wed Dec 01 00:00:00 EST 1982 · IEEE Trans. Comput.; (United States) · OSTI ID:988822

Related Subjects

97 MATHEMATICS AND COMPUTING