CSI 5308
PRINCIPLES OF DISTRIBUTED COMPUTING
(Fall 2017)


TOPICS
The course deals with techniques to design algorithms in distributed environments and to analyze their cost.
Although it is not a formal prerequisite, an undergraduate course in "design and analysis of algorithms" is necessary for understanding the material.
Topics include: broadcast, control algorithms, leader election, routing, sense of direction, distributed data, algorithms by mobile agents, algorithms for mobile robots.


PROFESSOR
Paola Flocchini
Office: SITE 5064
Phone: (613) 562-5800 ext. 6582
Office Hours: TBA
Email: pflocchi @ uottawa.ca

TEACHING ASSISTANT
TBA


SCHEDULE

MON: 11:30-13:00 and THU: 13:00-14:30 in room THN124



The course should be available on Blackboard where I will keep posting updated versions of the slides and I will post announcements.


MATERIAL

  • Textbook:
    N. Santoro, "Design and Analysis of Distributed Algorithms".
    John Wiley & Sons, 2007. (available at AGORA)

  • Additional material will be provided later and/or distributed in class.

  • The slides projected in class are available HERE.
    Note that the slides are continuously updated, the most up-to-date version is on Blackboard

  • French version of the slides.


    ASSIGNMENTS

    There will be three assignments/projects and two tests. The details will be given in class and on Blackboard.


    SOME TOOLS FOR ANIMATION AND SIMULATION

  • JBotSim and DAVIS
    Link with information about the tool

  • DisJ -A Simulator by Rody Piyasin - modified by Ruogu Luo
    Tips about setting up DisJ
    Cookbook

    DisJ (THE LATEST VERSION)
    An example (Depth First Traversal)


    MARKING SCHEME (Tentative - to be discussed in class)
    Assignment 1: 15%, Assignment 2: 20%, Assignment 3: 20%, Test1: 15%, Test2: 30%