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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baptiste, P., Timkovsky, V.G.: On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters 28, 205–212 (2001)
Berman, F., Johnson, D., Leighton, T., Shor, P.W., Snyder, L.: Generalized planar matching. J. of Alg. 11, 153–184 (1990)
De Bontridder, K.M.J., Haldórsson, B.V., Haldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Mathematical Programming 98, 477–491 (2003)
Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. of Alg. 7, 174–184 (1986)
I-Ling, Y., Leiss, E.L., Bastani, F.B.: Exploiting redundancy to speed up parallel systems. IEEE Parallel & Distributed Technology: Sys. & Appl. 1, 51–60 (1993)
Jackson, M.: Problem Structure and Dependable Architecture. In: Architecting Dependable Systems, vol. III, Springer, Heidelberg (2005)
Kaneko, A., Kelmans, A., Nishimura, T.: On packing 3-vertex paths in a graph. J. of Graph Theory 36, 175–297 (2001)
Kelmans, A., Mubayi, D.: How many disjoint 2-edge paths must a cubic graph have? J. of Graph Theory 45, 57–79 (2004)
Małafiejski, M., Żyliński, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 647–656. Springer, Heidelberg (2005)
Masuyama, S., Ibaraki, T.: Chain packing in graphs. Algorithmica 6, 826–839 (1991)
Petrank, E.: The hardness of approximations: gap locations. Computational Complexity 4, 133–157 (1994)
Shedler, G.S., Lehman, M.M.: Evaluation of redundancy in a parallel algorithm. IBM Systems Journal 6, 142–149 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A., Małafiejski, M., Żyliński, P. (2006). Parallel Processing Subsystems with Redundancy in a Distributed Environment. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2005. Lecture Notes in Computer Science, vol 3911. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11752578_121
Download citation
DOI: https://doi.org/10.1007/11752578_121
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34141-3
Online ISBN: 978-3-540-34142-0
eBook Packages: Computer ScienceComputer Science (R0)