Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Groupware: some issues and experiences
Communications of the ACM
Principles and realization strategies of multilevel transaction management
ACM Transactions on Database Systems (TODS)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Locking Primitives in a Database System
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Causally Ordering Group Communication Protocol
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
A low-overhead recovery technique using quasi-synchronous checkpointing
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Group communication protocol for flexible distributed systems
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Distributed checkpointing based on influential messages
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Communication protocol for group of distributed objects
ICPADS '96 Proceedings of the 1996 International Conference on Parallel and Distributed Systems
Global States of a Distributed System
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In distributed applications, multiple objects are cooperated to achieve some objectives. The objects may suffer from kinds of faults. If some object o is faulty, o is rolled back to the checkpoint and objects which have received messages from o are also required to be rolled back. In this paper, we define influential messages whose receivers are required to be rolled back if the senders are rolled back in the object-based computation model. By using the influential messages, an object-based (O) checkpoints are defined to denote semantically consistent global states of the system while inconsistent with the traditional message-based definition. We show how many checkpoints can be reduced by taking only the O-checkpoints.