![]() ![]() ![]() ![]() ![]() Next: Strict Up: Replica Control Strategies Previous: Replica Control Strategies   Contents   Index |
Note, giving such guarantees requires some sort of locking (on the server).
The normal definition of a pessimistic replication strategy is that it allows an update--to any (logical) file at any given time--to be made to at most one of the replicas (of the file) throughout the system. This is a more restrictive definition than mine; with my definition two clients cannot be pessimistic about the same file, but it is possible for a client to do optimistic updates (see Section 3.3.3) to a file even if the file is locked due to another client being pessimistic (but the optimistic clients are almost certain to fail). This could be the case if a client could not get in contact with the server and decided to do updating anyway (being optimistic).
![]() ![]() ![]() ![]() ![]() Next: Strict Up: Replica Control Strategies Previous: Replica Control Strategies   Contents   Index |