hw4 - CSE4/586 (Spring 2009): Homework 4 Due by Feb 24, in...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSE4/586 (Spring 2009): Homework 4 Due by Feb 24, in class. P1 P2 P3 P1.1 P1.2 P1.3 P1.4 P1.5 P2.1 P2.2 P2.3 P2.4 P2.5 P3.1 P3.2 P3.3 P3.4 P3.5 Figure 1: Timeline for P1, P2, and P3 1. (50 points) Answer the following questions using Figure 1. 1. (10 points) List all the events e such that P1.1 “happened before” e . In addition list all the events f that are “concurrent” with P2.2. 2. (15 points) Assign timestamps to all the events in accordance with the logical clock algorithm. Initially, all the local clocks begin with 0. 3. (25 points) Assign timestamps to all the events in accordance with the vector clock algorithm. Initially, all the local clocks begin with 0. 2. (30 points) Consider the following algorithm: Each process j maintains a logical clock (clocks are initially 0). Let T be some integer constant, T > 0. When its logical clock advances to or past T for the first time, each process takes a tentative checkpoint. Whenever the process receives a message that was sent at or before
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/04/2010 for the course CSE 123 taught by Professor Qwerty during the Spring '09 term at École Normale Supérieure.

Page1 / 2

hw4 - CSE4/586 (Spring 2009): Homework 4 Due by Feb 24, in...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online