A Low Overhead Minimum Process Global Snapshop Collection Algorithm for Mobile Distributed System

S Kumar, RK Chauhan, P Kumar - arXiv preprint arXiv:1005.5440, 2010 - arxiv.org
Coordinated checkpointing is an effective fault tolerant technique in distributed system as it
avoids the domino effect and require minimum storage requirement. Most of the earlier …

[PDF][PDF] Dealing with frequent aborts in minimum-process coordinated checkpointing algorithm for mobile distributed systems

P Kumar, P Gupta, AK Solanki - International Journal of Computer …, 2010 - academia.edu
While dealing with mobile distributed systems, we come across some issues like: mobility,
low bandwidth of wireless channels and lack of stable storage on mobile nodes …

[PDF][PDF] An Exploration of Methods for Empathetic Cluster Formation Using Mobile Computing Systems

N Zaib, S Jan - 2022 - researchgate.net
A distributed system is a collection of independent units working to solve a problem that
none could solve on their own. Specific tasks in a distributed system known as smartphones …

[PDF][PDF] Anti-message logging based coordinated checkpointing protocol for deterministic mobile computing systems

P Kumar, A Khunteta - International Journal of Computer Applications, 2010 - Citeseer
ABSTRACT A checkpoint algorithm for mobile computing systems needs to handle many
new issues like: mobility, low bandwidth of wireless channels, lack of stable storage on …

[PDF][PDF] Anti-message Logging based Check pointing Algorithm for Mobile Distributed Systems

M Nagpal, P Kumar - International Journal of Computer Applications, 2013 - Citeseer
Checkpointing is one of the commonly used techniques to provide fault tolerance in
distributed systems so that the system can operate even if one or more components have …

[PDF][PDF] A Low-Overhead Minimum Process Coordinated Checkpointing Algorithm for Mobile Distributed System

P Kumar, P Gahlan - International Journal of Computer Applications, 2010 - Citeseer
ABSTRACT A distributed system is a collection of independent entities that cooperate to
solve a problem that cannot be individually solved. A mobile computing system is a …

The Design and performance of a checkpointing scheme for mobile ad hoc networks

R Tuli, P Kumar - … on Parallel Distributed Computing Technologies and …, 2011 - Springer
The mobile ad hoc network architecture consists of a set of mobile hosts that can
communicate with each other without the assistance of a base station. This has brought a …

[PDF][PDF] RESOURCEFUL MINIMUM-PROCESS IMPECCABLE RECLAMATION LINE ACCRETION PROTOCOL FOR FAULT-TOLERANT MOBILE DISTRIBUTED …

R Ohri, SP Singh - romanpub.com
ABSTRACT In Mobile Distributed Computing setup (DCS), we come across some concerns
like: suppleness, small transmittal potentiality of Cellular mediums and dearth of stabilized …

Accomplished Minimum-process Synchronized Consistent Recovery Line Aggregation Algorithm for Fault-Tolerant Mobile Computing Environments

S Sharma, M Kumar, K Shrivastva, S Kumar… - Mathematical …, 2022 - philstat.org
We scheme a minimal-collaborating-proceeding coordinated CRL-aggregation (Consistent
Recovery Line Aggregation) arrangement for non-deterministic mobile distributed …

A Coherent Minimum-Process Dependable Reclamation Line Collation Scheme for Fault-Tolerant Mobile Distributed Systems

D Dagar, A Sharma, S Kumar, A Kumar… - Mathematical Statistician …, 2022 - philstat.org
We advocate a minimal-process coordinated Dependable Reclamation Line Collation
arrangement for non-deterministic mobile distributed interconnection; where no incompetent …