Quantifying fault recovery in multiprocessor systems

DOI10.1016/0895-7177(93)90260-6zbMath0825.68225OpenAlexW2017805452MaRDI QIDQ1310239

Miroslaw Malek, Frank Harary

Publication date: 21 December 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90260-6

zbMATH Keywords

graphsfault recoveryparallel computer architecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Dynamic graph models

Cites Work

• Subcube fault-tolerance in hypercubes
• Parallel concepts in graph theory
• A Graph Model for Fault-Tolerant Computing Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Unnamed Item

This page was built for publication: Quantifying fault recovery in multiprocessor systems