A Resilient Hierarchical Checkpointing Algorithm for Distributed Systems Running on Cluster Federation

Mansouri, Houssem; Pathan, Al-Sakib Khan

doi:10.1007/978-981-15-4825-3_8

Cited by 3 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The groundwork mechanisms that interconnect directly with the Mob-Hosts are called Mobile Support Stations (M_S_Sts). A cubicle is a logical or topographical exposure area under an M_S_St [9,19,20].…”

Section: Introductionmentioning

confidence: 99%

Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

2021

IJATCSE

View full text Add to dashboard Cite

Minimum-process harmonized checkpointing is well thought-out an attractive methodology to acquaint with fault tolerance in mobile systems patently. We design a minimum- process synchronous checkpointing algorithm for mobile distributed system. We try to minimize the intrusion of processes during checkpointing. We collect the transitive dependencies in the beginning, and therefore, the obstructive time of processes is bare minimum. During obstructive period, processes can do their normal computations, send messages and can process selective messages. In case of failure during checkpointing, all applicable processes are necessitated to abandon their transient snapshots only. In this way, we try to reduce the loss of checkpointing effort when any process fails to take its checkpoint in coordination with others. We also try to minimize the harmonization message complexity during checkpointing.

show abstract

Section: Introductionmentioning

confidence: 99%

Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

2021

IJATCSE

View full text Add to dashboard Cite

show abstract

A Communication-Induced Checkpointing Algorithm for Consistent-Transaction in Distributed Database Systems

Mansouri

Pathan

2021

Communications in Computer and Information Science

View full text Add to dashboard Cite

Effectual Non-Intrusive Minimum-Process Synchronous Checkpointing Protocol for Mobile Distributed Systems

Kumar

Arora

2021

IJSRST

View full text Add to dashboard Cite

While dealing with Mobile Distributed systems, we come across some issues like: mobility, low bandwidth of wireless channels and dearth of stable storage on mobile nodes, disconnections, inadequate battery power and high failure rate of mobile nodes. Minimum-process coordinated checkpointing is considered an attractive methodology to introduce fault tolerance in mobile systems transparently. In this paper, we propose a non-blocking coordinated global state compilation algorithm for mobile computing systems, which requires only a minimum number of processes to take permanent recovery points. We reduce the communication complexity as compared to the Cao-Singhal algorithm [4], while keeping the number of useless recovery points unchanged. Finally, the paper presents an optimization technique, which significantly reduces the number of useless recovery points at the cost of minor increase in the communication complexity. In coordinated global state compilation, if a single process fails to take its tentative recovery point; all the recovery point effort is aborted. We try to reduce this effort by taking soft recovery points in the first phase at Mobile Hosts.

show abstract

A Resilient Hierarchical Checkpointing Algorithm for Distributed Systems Running on Cluster Federation

Cited by 3 publications

References 10 publications

Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

Transient-Snapshot based Minimum-process Synchronized Check pointing Etiquette for Mobile Distributed Systems

A Communication-Induced Checkpointing Algorithm for Consistent-Transaction in Distributed Database Systems

Effectual Non-Intrusive Minimum-Process Synchronous Checkpointing Protocol for Mobile Distributed Systems

Contact Info

Product

Resources

About