A consistent checkpointing-recovery protocol for minimal number of nodes in mobile computing system

6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The vast computing potential of mobile computing systems is often hampered by their susceptibility to transient and independent failures. To add reliability and high availability to such systems, checkpoint based rollback recovery is one of the widely used ones for scientific computing, database, telecommunication and mission critical applications. This paper presents a coordinated nonblocking checkpointing and recovery technique for such systems that handles the constraints posed by the underlying wireless network, efficiently. Here an initiator (an MSS) sends checkpoint requests to all other MSSs and the MSSs send this request only to those MHs, which have communicated in the last checkpointing interval (relieving the wireless network from synchronization overhead). Also all acknowledged messages are logged at the home station of the receiver MH so that only the faulty MHs need to recover in case of failure and no other process is affected by this fault and subsequent recovery. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Chowdhury, C., & Neogy, S. (2007). A consistent checkpointing-recovery protocol for minimal number of nodes in mobile computing system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4873 LNCS, pp. 599–611). Springer Verlag. https://doi.org/10.1007/978-3-540-77220-0_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free