This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern
June 2007 (vol. 56 no. 6)
pp. 853-858
Communication-induced checkpointing protocols are mechanisms used to produce checkpoints and communication patterns which enjoy desirable properties, such as No-Z-Cycle (NZC). NZC guarantees that each checkpoint can be part of a global consistent checkpoint. It would be nice to define communication-induced checkpointing protocols that enforce NZC, adding a minimum number of checkpoints to remove all the Z-cycles from the distributed computation. In this paper, we prove that this is impossible by formulating the Minimum Z-Cycle Removal (MinZCR) problem and showing that there are no online competitive protocols for it. Moreover, we prove that the problem of enforcing NZC with an optimal number of checkpoints is difficult even if the whole input instance is known because its decision version is NP-complete. Finally, we also prove that MinZCR is difficult to approximate: it is APX-hard and this implies that no Polynomial Time Approximation Scheme exists for the problem.
Index Terms:
Distributed computing, checkpointing, Z-cycles, progressive retry, online versus offline analysis, competitive analysis, NP-complete problem.
Citation:
Luca Allulli, Roberto Baldoni, Luigi Laura, Sara Tucci Piergiovanni, "On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern," IEEE Transactions on Computers, vol. 56, no. 6, pp. 853-858, June 2007, doi:10.1109/TC.2007.1044
Usage of this product signifies your acceptance of the Terms of Use.