Parallel processing subsystems with redundancy in a distributed environment

Authors:
Adrian Kosowski;Michał Małafiejski;Paweł Żyliński
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Institute of Mathematics, University of Gdańsk, Poland
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 10
Cited 1

Planar 3DM is NP-complete

Journal of Algorithms
Generalized planar matching

Journal of Algorithms
The hardness of approximation: gap location

Computational Complexity
Exploiting Redundancy to Speed Up Parallel Systems

IEEE Parallel & Distributed Technology: Systems & Technology
How many disjoint 2-edge paths must a cubic graph have?

Journal of Graph Theory
On packing 3-vertex paths in a graph

Journal of Graph Theory
Evaluation of redundancy in a parallel algorithm

IBM Systems Journal
Weakly cooperative guards in grids

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
Problem structure and dependable architecture

Architecting Dependable Systems III
On preemption redundancy in scheduling unit processing time jobs on two parallel machines

Operations Research Letters

An approximation algorithm for maximum P3-packing in subcubic graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.