Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

L. Kumar

dblp:40/3960 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 83% Embedded and real-time systems · 17%
Computer networks
1 paper
Edge and fog computing · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › fault tolerance
checkpointing
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Distributed systems › fault tolerance › checkpointing
coordinated checkpointing
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Distributed systems
fault tolerance
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Embedded and real-time systems › mobile computing
mobile distributed systems
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Distributed systems › fault tolerance › checkpointing
mutable checkpoints
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Distributed systems › fault tolerance › checkpointing
nonblocking checkpointing
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
Edge and fog computing
distributed mobile computation
0.012003
Low Overhead Optimal Checkpointing for Mobile Distributed Systems · ICDE 2003
YearPublicationVenuePosition
2003 Low Overhead Optimal Checkpointing for Mobile Distributed Systems
abstract
A checkpoint algorithm for a mobile distributed computing system (MDCS) needs to handle many new issues like: mobility, low bandwidth of wireless channels, lack of stable storage on mobile nodes, disconnections, limited battery power and high failure rate of mobile nodes. These issues make traditional checkpointing techniques unsuitable for mobile distributed systems. Coordinated checkpointing may be useful to checkpoint MDCS if it is nonblocking and require minimum number of processes to checkpoint. Cao and Singhal [G. Cao et al., (2001)] achieved both by introducing the concept of mutable checkpoints. Many of these mutable checkpoints may be useless. We propose a nonblocking minimum process coordinated checkpointing protocol that not only minimizes useless checkpoints but also minimizes overall bandwidth required over wireless channels.
L. Kumar, Muldip Mishra, Ramesh Chandra Joshi
ICDE1