Fault-tolerance analysis of multibus multiprocessor system

DOI10.1007/BF02943365MaRDI QIDQ1262112zbMATH OpenOpenAlexFDO

Authors Rong Yao, Tinghuai Chen, Tai Kang

Publication date 1989

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02943365

zbMATH Keywords

fault-tolerancehypergraphmultibus multiprocessor system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Recommendations

• Design and analysis of fault-tolerant multibus interconnection networks
• An algorithm for routing messages between processing elements in a multiprocessor system which tolerates a maximal number of faulty links
• Performance analysis of multilevel bus networks for hierarchical multiprocessors
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• scientific article; zbMATH DE number 913541

Cites work

• Cut-Set Intersections and Node Partitions
• Implementing fault-tolerance via modular redundancy with comparison
• Markov Models for Multiple Bus Multiprocessor Systems

Cited in

(2)

• Design and analysis of fault-tolerant multibus interconnection networks
• Algorithms for the determination of cutsets in a hypergraph

This page was built for publication: Fault-tolerance analysis of multibus multiprocessor system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262112)