HW3 - CS171 HW3 Due date May 27 th 2009 1 State which communication primitives(reliable atomic causal multicast)will you use and why to achieve a A

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS171- HW3 Due date: May 27 th , 2009 1) State which communication primitives (reliable, atomic, causal multicast)will you use and why to achieve: a) A distributed jigsaw-puzzle is played over the network. All players try to built together the same copy of the puzzle. When the game starts there is one piece on the board. Any piece should be connected to the pieces that currently exist on the board. Only the correct piece matches its place. The target is to finish the jigsaw-puzzle as soon as possible. b) A distributed color map (Assume 4x4 blocks each block of one unique color) is held by servers. Clients can query the color of a certain slot in the map and update it (a client can only act through one server). The color maps held by different servers must stay consistent with each other. There are no process crashes or network partitions. How can you achieve this using group other....
View Full Document

This note was uploaded on 12/27/2011 for the course CMPSC 171 taught by Professor Agrawal during the Fall '09 term at UCSB.

Ask a homework question - tutors are online