Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While there is a polynomial time algorithm for finding vertex disjoint paths in networks, we will show that the equivalent problem in computation systems with multiple inputs is NP-hard. Our main results are as follows. We present a general model for fault tolerant computation systems with multiple inputs: AND/OR graphs. We show that it is NP-hard to find two vertex disjoint solution graphs in an AND/OR graph. It follows that in the general case redundancy cannot help to achieve survivability, assuming P= NP.
Słowa kluczowe
Wydawca
Czasopismo
Rocznik
Tom
Strony
61--73
Opis fizyczny
bibliogr. 20 poz.
Twórcy
autor
autor
autor
- Department of Combinatorics and Optimization, University of Waterloo, ON, N2L 3G1, Canada, ygwang@cacr.math.uwaterloo.ca
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS1-0008-0003