## Description

**Read Chapter 6, 7, 8****(5 points)**What are the design issues of distributed scheduling?**(5 points)**Why is message logging useful in Checkpointing? Discuss.**(5 points)**In Fig. 7.7 of the text, is signature 001001 valid for sequential consistent memory? Explain your answer.**(5 points)**Suppose that two processes detect the demise of the coordinator simultaneously and both decide to hold an election using the bull algorithm. What happens?**(10 points)**Explain in your own words what the main reason is for considering weak consistency models.**(10 points)**For active replication to work in general, it is necessary that all operations be carried out in the same order at each replica. Is this ordering always necessary?**(10 points)**What kind of consistency would you use to implement an electronic stock market? Explain your answer.**(10 points)**Give an example where client-centric consistency can easily lead to write-write conflicts.**(10 points)**A file is replicated on 10 List all the combinations of read quorum and write quorum that are permitted by the voting algorithm.**(10 points)**Explain the difference between linearizability and sequential consistency, and why the latter is more practical to implement, in general.**(10 points)**During the discussion of consistency models, we often referred to the contract between the software and data store. Why is such a contract needed?**(10 points)**Describe a simple implementation of read-your-writes consistency for displaying Web pages that have just been updated.**(10 points)**Is the following sequence of events allowed with a sequentially-consistent store? What about a causally-consistent data store? Explain your answer.