One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems

Authors:
Xingchang Liu;Xiaofan Yang;Min Xiang
Affiliations:
Department of Logistical Information Engineering, Logistical Engineering University, Chongqing 400016, China and College of Computer Science, Chongqing University, Chongqing 400044, China;College of Computer Science, Chongqing University, Chongqing 400044, China;Department of Logistical Information Engineering, Logistical Engineering University, Chongqing 400016, China
Venue:
Journal of Systems and Software
Year:
2009

Citing 16
Cited 3

A O(t3+ |E| ) Fault Identification Algorithm for Diagnosable Systems

IEEE Transactions on Computers - Fault-Tolerant Computing
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach

IEEE Transactions on Computers
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems

IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis

IEEE Transactions on Computers
A Class of Highly Scalable Optical Crossbar-Connected Interconnection Networks (SOCNs) for Parallel Computing Systems

IEEE Transactions on Parallel and Distributed Systems
On the design of hypermesh interconnection networks for multicomputers

Journal of Systems Architecture: the EUROMICRO Journal
Hypermeshes: implementation and performance

Journal of Systems Architecture: the EUROMICRO Journal
Gemini: An Optical Interconnection Network for Parallel Processing

IEEE Transactions on Parallel and Distributed Systems
A partitioning method for efficient system-level diagnosis

Journal of Systems and Software
Diagnosability of regular systems

Journal of Algorithms
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems

Journal of Parallel and Distributed Computing
Hamming hypermeshes: high performance interconnection networks for pin-out limited systems

Performance Evaluation
Characterization of Connection Assignment of Diagnosable Systems

IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems

IEEE Transactions on Computers
A Polynomial Time Algorithm For Fault Diagnosability

SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks

Computer Communications

Conditional diagnosability of hypermeshes under the comparison model

Information Processing Letters
Modeling the effects of hot-spot traffic load on the performance of wormhole-switched hypermeshes

Computers and Electrical Engineering
A fast fault-identification algorithm for bijective connection graphs using the PMC model

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

To maintain high reliability and availability, system-level diagnosis should be considered for the multiprocessor systems. The self-diagnosis problem of hypermesh, emerging potential optical interconnection networks for multiprocessor systems, is solved in this paper. We derive that the precise one-step diagnosability of k^n-hypermesh is n(k-1). Based on the principle of cycle decomposition, a one-step t-fault diagnosis algorithm for k^n-hypermesh which runs in O(k^nn(k-1)) time also is described.