Quantifying fault recovery in multiprocessor systems

DOI10.1016/0895-7177(93)90260-6zbMATH Open0825.68225OpenAlexW2017805452MaRDI QIDQ1310239FDOQ1310239

Authors: Frank Harary, Miroslaw Malek 

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) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Title not available (Why is that?)
• Parallel concepts in graph theory
• A Graph Model for Fault-Tolerant Computing Systems
• Subcube fault-tolerance in hypercubes

Cited In (1)

• Dynamic graph models

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

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