operating systems

May 12th, 2014
Anonymous
Category:
Programming
Price: $35 USD

Question description

  1. ( 10 points ) 
    A ring network has 8 logical nodes. Six distinct computers (i.e. each computer has a unique ID ) are to be assigned to the nodes and each node can associate with at most one computer. How many different ways can we assign the 6 computers to the 8 nodes. 
  2. ( 20 points ) 
    A DHT Chord network uses 4 bits (i.e. m = 4 ) to identify machines and keys of entities. At a certain time, machines with identifiers 2, 5, 9, and 11 are attached to and active in the network.
    1. Draw a diagram to show the machine ids and keys of the network.
    2. Find the finger table of each of the machines.
    3. An application running in node 11 is looking for the entity with key value 7. Find the route the system takes to get to the node that has the entity. Show your steps clearly and draw the route on your diagram.
  3. ( 10 points ) 
    1. .
    2. Would you consider a URL such as http://www.acme.org/index.html to be location independent? What about http://www.acme.nl/index.html ?
    3. Consider the behavior of two machines in a distributed system. Both have clocks that are supposed to tick 1000 times per millisecond. One of them actually does, but the other ticks only 990 times per millisecond. If UTC updates come in once a minute, what is the maximum clock skew that will occur?
  4. ( 10 points ) 

    If each process uses a different value for d in the Lamport's clock and vector clock equations, will the logical clocks and vector clocks schemes satisfy the total order relation => and the relation:
    • a → b iff t
    a < tbExplain your argument in detail. 
  5. ( 10 points ) 
    Suppose Process P1 has eventse11, e12, e13, e14, e15 e16 e17P2 has eventse21, e22, e23, e24, e25, e26,P3 has eventse31, e32, e33, e34, e35 e36There are message transits from e12 to e22, e24 to e15, e21 to e32, e35 to e25. Suppose the vector time clocks for e11, e21, and e31 are
    1
    0
    0
    ,  0
    1
    0
    ,  0
    0
    1
    respectively.

    a) Draw a diagram to show all the transitions and events.

    b) Find the vector clocks of all the events.

    c) Give an example for each of the following:

    i) a strongly consistent state

    ii) a consistent but not strongly consistent state

    iii) an inconsistent state

    Your global state should be consisted of the the events given ( e.g. e11 ) but should not contain any event that is sending ( e.g. e12 ) or receiving a message ( e.g. e22 ). 

Tutor Answer

(Top Tutor) mansour
School: UC Berkeley

Studypool has helped 1,244,100 students

Review from student
Anonymous
" Top quality work from this guy! I'll be back! "
Ask your homework questions. Receive quality answers!

Type your question here (or upload an image)

1825 tutors are online

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors