Parallel Processing Subsystems with Redundancy in a Distributed Environment
We consider the problem of dividing a distributed system into subsystems for parallel processing with redundancy for fault tolerance, where every subsystem has to consist of at least three units. We prove that the problem of determining the maximum number of subsystems with redundancy for fault tolerance is NP-hard even in cubic planar 2-connected system topologies. We point out that this problem is APX-hard on cubic bipartite graphs. At last, for subcubic topologies without units connected to only one other unit, we give a linear time 4/3-approximation algorithm.
KeywordsBipartite Graph Fault Tolerance Depth First Search Pendant Vertex System Topology
Unable to display preview. Download preview PDF.
- 6.Jackson, M.: Problem Structure and Dependable Architecture. In: Architecting Dependable Systems, vol. III, Springer, Heidelberg (2005)Google Scholar