Citation Context

... processes in the computer to which a mobile host is currently attached. Neither of the above approaches needs the checkpointing coordination, however, they may enforce a large number of checkpoints. =-=[11]-=- proposed a communication induced checkpointing, in which two types of checkpoints are taken; one is saved locally without consuming network bandwidth to be used for the recovery of soft failures, and...

Citation Context

...m-process algorithm by introducing the concept of mutable checkpoints. The number of useless checkpoints in [5] may be exceedingly high in some situations [19]. Kumar et al. [19] and Kumar et al. [16] reduced the height of the checkpointing tree and the number of useless checkpoints by keeping non-intrusiveness intact, at the extra cost of maintaining and collecting dependency vectors, computing the minimum set and broadcasting the same on the static network along with the checkpoint request. Koo and Toeg [15], and Cao and Singhal [4] proposed minimum-process blocking algorithms. Neves et al. [22] gave a loosely synchronized coordinated protocol that removes the overhead of synchronization. Higaki and Takizawa [13] proposed a hybrid checkpointing protocol where the mobile stations take checkpoints asynchronously and fixed ones synchronously using the algorithm [15]. Kumar and Kumar [20] proposed a minimum-process coordinated checkpointing algorithm where the number of useless checkpoints and blocking are reduced by using a probabilistic approach. A process takes its mutable checkpoint only if the probability that it will get the checkpoint request in the current initiation is high. Tra...

Citation Context

...ase station based on specific patterns of checkpointing and communication (z-dependencies) [19]. Neves and Fuchs developed a time-based checkpointing and recovery protocol for wireless mobile systems =-=[15]-=-. This protocol uses time to indirectly coordinate processes to establish consistent recovery points [15, 20]. The technique avoids a large number of forced checkpoints and only logs unacknowledged me...

Citation Context

...mp carded in a message makes the processes to eventually take globally consistent checkpoints. For the mobile computing environment, some extended algorithms of this checkpointing scheme are proposed =-=[16, 15]-=-. However, when the recovery is concerned, checkpointing-only schemes have a common problem in rollback. Because of the livelock problem [13], which causes recursive rollbacks, either the rollback of ...

Citation Context

...n Reliable Distributed Systems (SRDS’03) 1060-9857/03 $17.00 © 2003 IEEE they roam around in mobile environments. This flexibility, however, causes more probable physical damage to mobile hosts (MHs) =-=[15]-=-. In addition, MHs have low battery power and wireless links suffer limited bandwidth and long transfer delay, making transient failures more likely. Thus, nomadic computing requires techniques to pro...