Replication and Consistency WPI复制和一致性指数.pptVIP

CS-4513, D-Term 2007 Replication and Consistency Replication and Consistency CS-4513D-Term 2007 (Slides include materials from Operating System Concepts, 7th ed., by Silbershatz, Galvin, Gagne, Modern Operating Systems, 2nd ed., by Tanenbaum, and Distributed Systems: Principles Paradigms, 2nd ed. By Tanenbaum and Van Steen) Problem Given that synchronization and locking is so difficult, do we really need it in a distributed system? Is there a better way? Example Grapevine registry contains a list of items Groups Individuals If we need to update one item, do we need to lock entire registry? Where do we update that one item? How does it get propagated to other replicas? Replication The art and science of keeping multiple copies of data in a distributed system Two reasons:– Reliability Performance Example 1 Grapevine keeps replicas of each registry on at least three Registration Servers At least one is located far away Performance Registries accessed frequently – spread the load Updates happen often enough that locking a registry would be a real bottleneck Reliability Destination registry needed for sending a message Even if a server is down or network is partitioned Example 2 DNS (Domain Name Service) allows owner of a domain to replicate name database Same two reasons Performance Reliability Also Scaling technique Replication Data centric I.e., try to keep data consistent across replicas Client centric Weaker condition Only maintain consistency for each client separately General Approach Update a single item in local replica Atomically Time-stamp – e.g., logical clock Replica propagates update to all of its other replicas Periodically Receiving replica merges update with its own copy Conflicting updates resolved arbitrarily to latest time-stamp Consistency Strict consistency (in time) Not strict consistency Consistency (continued) All processes see updates in same order Processes see updates in opposite order! Consider three processes Three shared variab