CSCE 668: Distributed Algorithms and Systems
Spring 2014
Homework

General Instructions:


[Homework 1] [Homework 2] [Homework 3] [Homework 4] [Homework 5] [Homework 6] [Homework 7]


Homework 1: Due Fri, Jan 24, 10:20 AM

Problems:

Paper Review: (If you are behind the TAMU firewall, following the links should give you access to the full text of the papers.)

  1. "A New Proof of the GHS Minimum Spanning Tree Algorithm," Y. Moses and B. Shimony, International Symposium on Distributed Computing (DISC) 2006.

  2. Johannes Schneider, Roger Wattenhofer: An optimal maximal independent set algorithm for bounded-independence graphs. Distributed Computing 22(5-6): 349-361 (2010)

Homework 2: Due Fri, Feb 7, 10:20 AM

Problems:

Paper Review: (If you are behind the TAMU firewall, following the links should give you access to the full text of the papers.)

  1. Thomas Moscibroda and Rotem Oshman, "Resilience of mutual exclusion algorithms to transient memory faults". In Proceedings of the 30th annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pp. 69-78, 2011.

  2. Ranganath Atreya, Neeraj Mittal, Sathya Peri: A Quorum-Based Group Mutual Exclusion Algorithm for a Distributed System with Dynamic Group Set. IEEE Trans. Parallel Distrib. Syst. 18(10): 1345-1360 (2007)

Homework 3: Due Mon, Mar 3, 10:20 AM

Problems:

Paper Review: (If you are behind the TAMU firewall, following the link should give you access to the full text of the paper.)


Homework 4: Due Mon, Mar 24, 10:20 AM

Problems:

Paper Reviews: (If you are behind the TAMU firewall, following the links should give you access to the full text of the papers.)


Homework 5: Due Wed, Apr 2, 10:20 AM

Problems:

(No paper review)


Homework 6: Due Mon, Apr 21, 10:20 AM

This assignment has fewer problems and more paper reviews (3) than the others. It is now complete.

Problems:

Paper Reviews: (If you are behind the TAMU firewall, following the links should give you access to the full text of the papers.)


Homework 7: Due Tue, Apr 29, 10:20 AM

Problems:

Paper Review: (If you are behind the TAMU firewall, following the link should give you access to the full text of the paper.)