On Dependability Evaluation of Mesh-Connected Processors
Analytical techniques for reliability and availability prediction of mesh-connected systems are proposed in this paper. The models are based on the submesh requirements. First, a reliability model is proposed assuming that a submesh can be always ...
Distributed Fault Diagnosis in Multistage Network-Based Multiprocessors
This paper is concerned with a distributed, system-level fault diagnosis scheme for multistage network-based multiprocessors. The target system, which we choose as a representative, employs a multistage interconnection network (MIN) with 4 4 switching ...
Compiler-Assisted Multiple Instruction Rollback Recovery Using a Read Buffer
Multiple instruction rollback (MIR) is a technique that has been implemented in mainframe computers to provide rapid recovery from transient processor failures. Hardware-based MIR designs eliminate rollback data hazards by providing data redundancy ...
Subcube Fault Tolerance in Hypercube Multiprocessors
In this paper, we study the problem of constructing subcubes in faulty hypercubes. First a divide-and-conquer technique is used to form the set of disjoint subcubes in the faulty hypercube. The concept of irregular subcubes is then introduced to take ...
A Fault-Tolerant GEQRNS Processing Element for Linear Systolic Array DSP Applications
In this work, the design of a Galois enhanced quadratic residue number system (GEQRNS) [9], [7] processor is presented, which can be used to construct linear systolic arrays. The processor architecture has been optimized to perform multiply-accumulate ...
Avalanche Characteristics of Substitution-Permutation Encryption Networks
This paper develops analytical models for the avalanche characteristics of a class of block ciphers usually referred to as substitution-permutation encryption networks or SPNs. An SPN is considered to display good avalanche characteristics if a one bit ...
Fixed Priority Scheduling with Limited Priority Levels
This paper develops necessary and sufficient conditions for analyzing the schedulability of fixed priority algorithms on resources with limited priority levels. We introduce the degree of schedulable saturation (Smax) as an objective function. A ...
An Optimal O(NlgN) Algorithm for Permutation Admissibility to Extra-Stage Cube-Type Networks
A k-EMCTN is obtained by adding k more stages in front of a multistage cube-type network (MCTN). It is shown that a permutation is admissible to a k-EMCTN if and only if the conflict graph is 2k-colorable. For the case k= 1, an O(NlgN) algorithm is ...
A Differential Cryptanalysis of Tree-Structured Substitution-Permutation Networks
We propose a differential attack on tree-structured substitution-permutation networks. The number of chosen plaintexts required for the differential attack to succeed is called the complexity. Our main result is to show that the expected complexity of ...
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
Hypercube network is an attractive structure for parallel processing due to its symmetry and regularity. In this paper, we use the concept of free dimensions to achieve fault tolerance in hypercubes without requiring additional spare processing nodes; ...
An Efficient Algorithm-Based Concurrent Error Detection for FFT Networks
In this brief contribution a new algorithm-based concurrent error detection scheme employing the checksum approach is proposed for FFT networks. Our design allows high error coverage with low false alarm rate by applying the linear weight factors to the ...
A Limited-Global-Information-Based Multicasting Scheme for Faulty Hypercubes
We study the multicast problem in hypercubes with faulty nodes. We assume that each node has limited global information of fault distribution, which is captured by the safety level associated with the node. Basically, the safety level is an approximate ...
