[go: up one dir, main page]

Nitzberg et al., 1999 - Google Patents

The P-Mesh-a commodity-based scalable network architecture for clusters

Nitzberg et al., 1999

View PDF
Document ID
11714191576407417144
Author
Nitzberg B
Kuszmaul C
Stockdale I
Becker J
Jiang J
Wong P
Publication year
Publication venue
Proceedings of the 32nd Annual Hawaii International Conference on Systems Sciences. 1999. HICSS-32. Abstracts and CD-ROM of Full Papers

External Links

Snippet

We designed a new network architecture, the P-Mesh, which combines the scalability and fault resilience of a torus with the performance of a switch. We compare the scalability, performance and cost of the hub, switch, torus, tree and P-Mesh architectures. The latter …
Continue reading at ntrs.nasa.gov (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17356—Indirect interconnection networks
    • G06F15/17368—Indirect interconnection networks non hierarchical topologies
    • G06F15/17381—Two dimensional, e.g. mesh, torus
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake
    • G06F15/17337—Direct connection machines, e.g. completely connected computers, point to point communication networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/76—Architectures of general purpose stored programme computers
    • G06F15/80—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8007—Architectures of general purpose stored programme computers comprising an array of processing units with common control, e.g. single instruction multiple data processors single instruction multiple data [SIMD] multiprocessors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/25—Routing or path finding through a switch fabric
    • H04L49/253—Connections establishment or release between ports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/10—Switching fabric construction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/30—Peripheral units, e.g. input or output ports
    • H04L49/3009—Header conversion, routing tables or routing tags

Similar Documents

Publication Publication Date Title
Lin et al. A multiple LID routing scheme for fat-tree-based InfiniBand networks
Dandamudi et al. Hierarchical interconnection networks for multicomputer systems
JP4857274B2 (en) Optimization of application layout on massively parallel supercomputer
US10409766B2 (en) Computer subsystem and computer system with composite nodes in an interconnection structure
US8433816B2 (en) Network topology for a scalable multiprocessor system
Lakhotia et al. Polarfly: A cost-effective and flexible low-diameter topology
EP2759100B1 (en) Optimising data transmission in a hypercube network
Shang et al. Efficient breadth-first search on large graphs with skewed degree distributions
Nitzberg et al. The P-Mesh-a commodity-based scalable network architecture for clusters
Bansal et al. Quad tree: a cost-effective fault-tolerant multistage interconnection network
Jeng et al. Design and analysis of dynamic redundancy networks
US20040158663A1 (en) Interconnect topology for a scalable distributed computer system
Avresky et al. Performance Modeling of ServerNet™ SAN Topologies
Tarraga-Moreno et al. Scalable and Efficient Intra-and Inter-node Interconnection Networks for Post-Exascale Supercomputers and Data centers
Alleyne et al. Expanded delta networks for very large parallel computers
US20250190396A1 (en) Computing array using global node processing
Kumar et al. A Survey on Efficient Interconnects for Neuromorphic Systems
Javadi et al. Performance modeling and analysis of heterogeneous meta-computing systems interconnection networks
Chi-Hsiu et al. Performance evaluation of multi-exaflops machines using Equality network topology
Mahgoub et al. A novel scheme to improve fault-tolerant capabilities of multistage interconnection networks
Li et al. Mirrored K‐Ary N‐Tree and its efficiency of fault tolerance
Dubinski et al. High performance commodity networking in a 512-cpu teraflop beowulf cluster for computational astrophysics
Rahman et al. Hierarchical tori connected mesh network
Lin et al. A high performance fault-tolerant switching network for ATM
Sarbazi-Azad et al. A performance model of adaptive wormhole routing in k-ary n-cubes in the presence of digit-reversal traffic