A method for finding best place with the least possible for forced chechpoints in communication - induced chekpointing

This paper is focused communication – induced check pointing (CIC) method works with the concepts of Z-path and Z-cycle . the Z-cycle recognized in the systems are useless checkpoint and will never become a part of global consistent state. This can be solved by forced checkpoints. In this paper by recognizing Z-cycle , the number of appropriate place to force the additional checkpoints is calculated so that the best place for adding just on checkpoint to remove each Z-cycle is obtained. Additionally , a method is introduced in this paper in which it find shared parts between Z-cycle and calculates the best place to force only one additional checkpoint, so that all the nested Z-cycle are removed. Since forcing additional checkpoints cause an overhead, we have attempted to force checkpoints as fewer as possible.

کلیدواژه ها:

communication - induced chechpointing ، domino effect ، z-cycle ، forced checkpointihg