分布式系统原理与范型 考试 2009 答案.pdf

分布式系统 2009春季学期期末考试 北京大学计算机系，2009年6月12日 院系： 学号： 姓名： 一、概念题 （共30分） 1. k fault tolerant (chap 8) A system is said to be k fault tolerant if it can survive faults in k components and still meet its specifications. 2. Availability, Reliability (chap 8) Availability: Readiness for usage 。说明系统已准备好，马上就可以使用。通常，它指在任何 给定的时刻，系统都可以正确地操作，可根据用户的行为来执行它的功能。换句话说，高 度可用的系统在任何给定的时刻都能及时地工作。 Reliability: Continuity of service delivery 。指系统可以无故障地持续运行。与可用性相反， 可靠性是根据时间间隔而不是任何时刻来进行定义的。 3. recovery line (chap 8) A recovery line corresponds to the most recent consistent collection of checkpoints. 4. continuous consistency ranges (chap 7) Deviation in numerical values between replicas, deviation in staleness between replicas, and deviation with respect to the ordering of update operations. These deviations are referred as forming continuous consistency ranges. 5. eventual consistency (chap 7) If no updates take place for a long time, all replicas will gradually become consistent. This form of consistency is called eventual consistency. 6. happens-before relation (chap 6) To synchronize logical clocks, Lamport defined a relation called happens-before. The expression ab is read “a happens before b” and means that all processes agree that first event a occurs, then afterward, event b occurs. The happens-before relation can be observed directly in two situations: 1) If a and b are events in the same process, and a occurs before b, then ab is true. 2) If a is the event of a message being sent by one process, and b is the event of the message being received by another process, the ab is also true. A message cannot be received before 1 it is sent, or even at the same time it is sent, since it takes a finite, nonzero amount of time to arrive. 7. finger table (chap 5) Ins