Pages that link to "Item:Q3347791"
From MaRDI portal
The following pages link to Dynamically Restructurable Fault-Tolerant Processor Network Architectures (Q3347791):
Displaying 13 items.
- Upper bounds on the connection probability for 2-D meshes and tori (Q433405) (← links)
- Nonplanar switchable arrays (Q921927) (← links)
- Chordal rings as fault-tolerant loops (Q1199459) (← links)
- A depth-first search routing algorithm for star graphs and its performance evaluation (Q1328866) (← links)
- IEH graphs. A novel generalization of hypercube graphs (Q1902299) (← links)
- Incrementally extensible hypercube networks and their fault tolerance (Q1921084) (← links)
- Balanced computation of two-dimensional transforms on a tree machine (Q2277820) (← links)
- Run-Time Recovery Mechanism for Transient and Permanent Hardware Faults Based on Distributed, Self-Organized Dynamic Partially Reconfigurable Systems (Q2985303) (← links)
- Task Migration for Fault-Tolerant FlexRay Networks (Q3163914) (← links)
- The<i>g</i>-network and its inherent fault tolerant properties (Q4009711) (← links)
- On fault-tolerant structure, distributed fault-diagnosis, reconfiguration, and recovery of the array processors (Q4732082) (← links)
- A regular scalable fault tolerant interconnection network for distributed processing (Q5958608) (← links)
- Enabling high reliability via matroidal connectivity and conditional matroidal connectivity on arrangement graph networks (Q6652460) (← links)
