a hybrid coordinated checkpointing protocol for deterministic mobile distributed systems
Clicks: 224
ID: 155478
2010
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
224 views
46 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #11 of 22 articles by views in current eye research
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
In this chapter, we propose a hybrid checkpointing scheme for deterministic mobile distributed systems where an all process checkpoint is enforced after running minimum process checkpointing algorithm for certain number of times. In the minimum process checkpointing, no useless checkpoints are taken, no blocking of processes takes place and anti-messaging of very few messages are logged during checkpointing. It balances the checkpointing overhead and loss of computation on recovery.
| Reference Key |
kumar2010journala
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Parveen Kumar;R. K. Chauhan;Sunil Kumar Gupta |
| Journal | current eye research |
| Year | 2010 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.