OptimisticWay to Mobile Performance Using Checkpointing Algorithm

Kishore, B and Nagaraj, Srinivasan and Babu, Ganesh C (2014) OptimisticWay to Mobile Performance Using Checkpointing Algorithm. In: International conference on Advanced Computer Theory and Engineering (ICACTE), May 18th, 2014.

[img] PDF
ICACTE-proceedingspaper.pdf - Published Version
Restricted to Registered users only

Download (255kB) | Request a copy


A mobile computing system consists of mobile and stationary nodes, connected to each other by communication network. This system raises several requirement and restrictions, such as limited battery life, mobility, disconnection of hosts and lack of stable storage not taken into account by conventional distributed systems. Our checkpointing algorithm forces a minimum number of processes to take checkpoint and reduces the delay incurred in determining the consistent global state for mobile systems in the comparison of the traditional coordinated checkpointing algorithms. By reducing the checkpoint cost like searching, saving checkpoints, and transmitting data through wireless link we can deal with different checkpointing issues for mobile systems.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Consistent Checkpoints, Coordinated checkpointing, Global Snapshot, Non-blocking, orphan message
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 14 Jan 2015 09:39
Last Modified: 14 Jan 2015 09:39
URI: http://eprints.manipal.edu/id/eprint/141570

Actions (login required)

View Item View Item