A fault-tolerant FPGA-based multi-stage interconnection network for space applications

2003 ◽  
Author(s):  
M. Alderighi ◽  
F. Casini ◽  
S. D'Angelo ◽  
D. Salvi ◽  
G.R. Sechi
Keyword(s):  
Fault Tolerant ◽  
Interconnection Network ◽  
Space Applications ◽  
Multi Stage

Performance Evaluation, Comparison and Identification of Efficient Hypercube Interconnection Networks

2021 ◽  
Author(s):  
Karthik K ◽  
Sudarson Jena ◽  
Venu Gopal T
Keyword(s):  
Interconnection Networks ◽  
Interconnection Network ◽  
Research Work ◽  
Processing Unit ◽  
Network Cost ◽  
Multi Stage ◽  
Memory Modules ◽  
Effective Performance ◽  
Twisted Cube ◽  
Hypercube Network

Abstract A Multiprocessor is a system with at least two processing units sharing access to memory. The principle goal of utilizing a multiprocessor is to process the undertakings all the while and support the system’s performance. An Interconnection Network interfaces the various handling units and enormously impacts the exhibition of the whole framework. Interconnection Networks, also known as Multi-stage Interconnection Networks, are node-to-node links in which each node may be a single processor or a group of processors. These links transfer information from one processor to the next or from the processor to the memory, allowing the task to be isolated and measured equally. Hypercube systems are a kind of system geography used to interconnect various processors with memory modules and precisely course the information. Hypercube systems comprise of 2n nodes. Any Hypercube can be thought of as a graph with nodes and edges, where a node represents a processing unit and an edge represents a connection between the processors to transmit. Degree, Speed, Node coverage, Connectivity, Diameter, Reliability, Packet loss, Network cost, and so on are some of the different system scales that can be used to measure the performance of Interconnection Networks. A portion of the variations of Hypercube Interconnection Networks include Hypercube Network, Folded Hypercube Network, Multiple Reduced Hypercube Network, Multiply Twisted Cube, Recursive Circulant, Exchanged Crossed Cube Network, Half Hypercube Network, and so forth. This work assesses the performing capability of different variations of Hypercube Interconnection Networks. A group of properties is recognized and a weight metric is structured utilizing the distinguished properties to assess the performance exhibition. Utilizing this weight metric, the performance of considered variations of Hypercube Interconnection Networks is evaluated and summed up to recognize the effective variant. A compact survey of a portion of the variations of Hypercube systems, geographies, execution measurements, and assessment of the presentation are examined in this paper. Degree and Diameter are considered to ascertain the Network cost. On the off chance that Network Cost is considered as the measurement to assess the exhibition, Multiple Reduced Hypercube stands ideal with its lower cost. Notwithstanding it, on the off chance that we think about some other properties/ scales/metrics to assess the performance, any variant other than MRH may show considerably more ideal execution. The considered properties probably won't be ideally adequate to assess the effective performance of Hypercube variations in all respects. On the off chance that a sensibly decent number of properties are utilized to assess the presentation, a proficient variation of Hypercube Interconnection Network can be distinguished for a wide scope of uses. This is the inspiration to do this research work.

Multi-Stage Cryocooler for Space Applications

Cryocoolers 8 ◽  
1995 ◽  
pp. 93-102 ◽  
Author(s):  
H. Carrington ◽  
W. J. Gully ◽  
M. Hubbard ◽  
C. Varner ◽  
P. Arter
Keyword(s):  
Space Applications ◽  
Multi Stage

scholarly journals Planning Fail-Safe Trajectories for Space Robotic Arms

2021 ◽  
Vol 8 ◽  
Author(s):  
Oliver Porges ◽  
Daniel Leidner ◽  
Máximo A. Roa
Keyword(s):  
Degrees Of Freedom ◽  
Fault Tolerant ◽  
Robotic Manipulators ◽  
Task Completion ◽  
Joint Failure ◽  
Space Applications ◽  
Robotic Arms ◽  
Hazardous Environments ◽  
Potential Risks ◽  
Fail Safe

A frequent concern for robot manipulators deployed in dangerous and hazardous environments for humans is the reliability of task executions in the event of a joint failure. A redundant robotic manipulator can be used to mitigate the risk and guarantee a post-failure task completion, which is critical for instance for space applications. This paper describes methods to analyze potential risks due to a joint failure, and introduces tools for fault-tolerant task design and path planning for robotic manipulators. The presented methods are based on off-line precomputed workspace models. The methods are general enough to cope with robots with any type of joint (revolute or prismatic) and any number of degrees of freedom, and might include arbitrarily shaped obstacles in the process, without resorting to simplified models. Application examples illustrate the potential of the approach.

scholarly journals Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks (THLNs)

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1066
Author(s):  
Huifeng Zhang ◽  
Xirong Xu ◽  
Qiang Zhang ◽  
Yuansheng Yang
Keyword(s):  
Topological Structure ◽  
Large Scale ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Graph Embedding ◽  
Linear Arrays ◽  
Critical Issues ◽  
Vertex Set ◽  
Network Operation ◽  
Host Graph

It is known widely that an interconnection network can be denoted by a graph G = ( V , E ) , where V denotes the vertex set and E denotes the edge set. Investigating structures of G is necessary to design a suitable topological structure of interconnection network. One of the critical issues in evaluating an interconnection network is graph embedding, which concerns whether a host graph contains a guest graph as its subgraph. Linear arrays (i.e., paths) and rings (i.e., cycles) are two ordinary guest graphs (or basic networks) for parallel and distributed computation. In the process of large-scale interconnection network operation, it is inevitable that various errors may occur at nodes and edges. It is significant to find an embedding of a guest graph into a host graph where all faulty nodes and edges have been removed. This is named as fault-tolerant embedding. The twisted hypercube-like networks ( T H L N s ) contain several important hypercube variants. This paper is concerned with the fault-tolerant path-embedding of n-dimensional (n-D) T H L N s . Let G n be an n-D T H L N and F be a subset of V ( G n ) ∪ E ( G n ) with | F | ≤ n - 2 . We show that for two different arbitrary correct vertices u and v, there is a faultless path P u v of every length l with 2 n - 1 - 1 ≤ l ≤ 2 n - f v - 1 - α , where α = 0 if vertices u and v form a normal vertex-pair and α = 1 if vertices u and v form a weak vertex-pair in G n - F ( n ≥ 5 ).

THE CUBE-OF-RINGS INTERCONNECTION NETWORK

1998 ◽  
Vol 09 (01) ◽  
pp. 25-37 ◽  
Author(s):  
THOMAS J. CORTINA ◽  
ZHIWEI XU
Keyword(s):  
Graph Theory ◽  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithm ◽  
Parallel Computers ◽  
Closed Form Expression ◽  
Form Expression ◽  
Graph Theoretic ◽  
Basic Graph

We present a family of interconnection networks named the Cube-Of-Rings (COR) networks along with their basic graph-theoretic properties. Aspects of group graph theory are used to show the COR networks are symmetric and optimally fault tolerant. We present a closed-form expression of the diameter and optimal one-to-one routing algorithm for any member of the COR family. We also discuss the suitability of the COR networks as the interconnection network of scalable parallel computers.

scholarly journals Fault tolerant solid state mass memory for space applications

2005 ◽  
Vol 41 (4) ◽  
pp. 1353-1372 ◽  
Author(s):  
G.C. Cardarilli ◽  
M. Ottavi ◽  
S. Pontarelli ◽  
M. Re ◽  
A. Salsano
Keyword(s):  
Solid State ◽  
Fault Tolerant ◽  
Space Applications
Sign in / Sign up

Export Citation Format

Share Document