Welcome to Mini-Project on Distributed Agorithms for Channel Allocation homepageThe course deals with implementing distributed algorithms for problems such as Vertex Coloring, Edge Coloring, Maximal Independent Set, Maximal Matching, and their variations. The first lecture will take place on Sunday, 21/10/12. The lecture will include an overview of the course requierments, and introduction to distributed algorithm and the network algorithms simulator.
Notice the updated submission dates below.
LecturesLecture 1 - 21/10/12.
Lecture 2 - 28/10/12.
Lecture 3 - 4/11/12.
Topics for ProjectsSee the list of topics.
Final Report RequiermentsSee the report requierments.
You should submit the final report, the project source files, and a readme file describing how to run the program to the submission system. Last date for submission is
You should also schedule an appoitment with the lecturer for frontal presentation.
The appointment should take place before
Network Algorithms SimulatorThe algorithms should be implemented using a simulation of networks on a single computer.
To this end you can use Simulator for Network Algorithms.
BibliographyDavid Peleg, Distributed Computing: a Locality-Sensitive Approach, SIAM, Philadelphia, PA, 2000.
Chapters 1-2, 7-8.