+

Chen et al., 1999 - Google Patents

Path-Based Fault-Tolerant Multicasting in Mesh-Connected Multicomputers

Chen et al., 1999

View PDF
Document ID
6207391522105279912
Author
Chen X
Wu J
Publication year
Publication venue
Proc. of the IASTED Parallel and Distributed Computing and Systems Conference

External Links

Snippet

We present a deadlock-free path-based fault-tolerant multicast algorithm in 2-D meshes. The fault model considered is the faulty block model with inter-block distance of at least three. The path is Hamiltonian that does not need to be reconstructed when a faulty block is …
Continue reading at cis.temple.edu (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
    • G06F15/8023—Two dimensional arrays, 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/76—Architectures of general purpose stored programme computers
    • G06F15/78—Architectures of general purpose stored programme computers comprising a single central processing unit
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/48—Routing tree calculation
    • 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
    • G06F11/16—Error detection or correction of the data by redundancy in hardware
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/06—Deflection routing, e.g. hot-potato routing

Similar Documents

Publication Publication Date Title
Gomez et al. A routing methodology for achieving fault tolerance in direct networks
Boppana et al. Fault-tolerant wormhole routing algorithms for mesh networks
Chiu The odd-even turn model for adaptive routing
Tseng et al. A trip-based multicasting model in wormhole-routed networks with virtual channels
Su et al. Adaptive deadlock-free routing in multicomputers using only one extra virtual channel
Sivaram et al. Efficient broadcast and multicast on multistage interconnection networks using multiport encoding
Boppana et al. On multicast wormhole routing in multicomputer networks
Lakhotia et al. Accelerating Allreduce with in-network reduction on Intel PIUMA
Kesavan et al. Multiple multicast with minimized node contention on wormhole k-ary n-cube networks
Chen et al. Path-Based Fault-Tolerant Multicasting in Mesh-Connected Multicomputers
Nordbotten et al. A fully adaptive fault-tolerant routing methodology based on intermediate nodes
Robinson et al. Efficient multicast in all-port wormhole-routed hypercubes
US20040158663A1 (en) Interconnect topology for a scalable distributed computer system
Izadi et al. Enhanced cluster k-ary n-cube, a fault-tolerant multiprocessor
Fan et al. Turn grouping for multicast in wormhole-routed mesh networks supporting the turn model
Hameenanttila et al. The flexible hypercube: A new fault-tolerant architecture for parallel computing
Wu A fault-tolerant adaptive and minimal routing scheme in n-D meshes
Wu et al. Cube-connected-cubes network
Tsai et al. Broadcast in all-port wormhole-routed 3D mesh networks using extended dominating sets
Boppana et al. Fault-tolerant multicast communication in multicomputers
Zhuang et al. A recursion-based broadcast paradigm in wormhole routed networks
Ravikumar et al. Adaptive routing in k-ary n-cubes using incomplete diagnostic information
Park et al. Fault-tolerant broadcasting in wormhole-routed torus networks
Yang et al. Incremental design of scalable interconnection networks using basic building blocks
Ashir Embeddings, fault tolerance and communication strategies in k-ary n-cube interconnection networks
点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载