CPSC662 -- Distributed Computing Systems (Spring 1999)

Slides   | Tests  | Homeworks | Resources   | Projects

In this course, we will study some of the most important concepts in the design of distributed operating systems. Throughout the course, we will try to relate the material covered to the support of large-scale computing on the Internet. We will tentatively discuss the following issues (a tentative guess for the allocated number of lessons per topic is given in brackets) :
 

Introduction [2]  Characterization of Distributed Systems  Network OSs vs. distributed OSs  Research and design issues  Interprocess Communication [2]  Issues in message passing  Client-server communication  Remote Procedure Call [2]  Design issues for RPCs  Case study: Sun RPC  Synchronization [3]  Event ordering / synchronization  Centralized vs. distributed schemes  Group Communication [5]  Virtual synchrony  Ordered, reliable, and casual multicast  Group membership  Atomic group multicast  Case study: ISIS  Service Replication

Distributed Shared Memory [4]  Shared memory Consistency models Design issues Case studies: Ivi/Munin Distributed File Services [5]  Model  Case study: NFS  Case study: AFS  Case study: CODA  Distributed Naming Services [5]  Names, addresses, routes, capabilities  Naming facilities, name distribution, name resolution  Migration  Distributed Object-Oriented Technology and Friends  Issues CORBA, RMI Supporting Internet Applications of the Future Issues Active networks, Liquid software, ... WebOS, Legion, JavaSpaces, ...

As you see, most of the material served in the lectures is pretty basic. The idea is to provide a solid basis. We will complement this with a very strong hands-on component.

• " Distributed Systems: Concepts and Design"

by G. Coulouris, J. Dollimore, T. Kindberg, Addison Wesley (ISBN 0-201-61918-0)

Reference Books

Below is a list of reference books. These books are thought to complement the textbook. Perusing them may help you better understand some issues discussed in class. More reference material will be added as we go along.

• "Distributed Operating Systems"

by A. Tanenbaum, Prentice Hall
• "Distributed Operating Systems & Algorithms"

by R. Chow and T. Johnson, Addison Wesley

Assessment Method

The course will consist of a considerable number of challenging programming projects, a midterm (to be scheduled), and a final exam (tentativel to be held on May 11th). Perhaps we will have a small number of homeworks.

The weight will be tentatively distributed as no less than 55% for projects and at most 35% for tests. (If we will have homeworks, the weights will be adjusted accordingly, roughly 50% for projects, 20% for homeworks, and 35% for tests.)

Ideally, grades will be assigned along the following lines:

• A: Understanding of the material presented in class and in the literature. Indication of ability to indipendently develop new ideas based on material learned in class.
• B: Good understanding of material presented in class and in required reading.
• C: Unsatisfactory understanding of material presented in class and required reading.
• D: ....

Prerequisites

The official prerequisites are CPSC-410 or CPSC-463. I recommend you have a good idea of both. I reserve the right to enforce the prerequisites, maybe even in form of a quiz at the beginning of the semester !

Projects

In this course we will not limit ourselves to talking about distributed computing systems, but will get our hands dirty messing around with such systems.

The projects have shown to be very demanding. If you do not know how to program at a sophisticated level, this is a good time to rethink your plans of taking this course! Experience with previous times this course was given has shown that you will not be able to learn the programming part as you go.

More information about projects will be posted soon.

The projects will be done in groups of two students each. This means that it is a good idea to start looking for a partner soon.

Things may change, so please check back later!

Late-Submission Policy

• All the submission deadlines will include extra time for the consideration of accidental events such as (not limited to) unavailable resource (machines are down,) sickness of students, stock market collapse, etc. This means that additional extensions are generally not granted.
• I reserve the right to penalize lateness with one third of the earned points of the item per class day.

Last But Not Least

Feel free to make comments, suggestions, and such things.