Models of asynchronous distributed computing systems. Fundamental concepts of concurrency and synchronization, communication, reliability, topological and geometric constraints, time and space complexity, and distributed algorithms.
The course will also cover recent research in peer-to-peer systems (and distributed hash tables), overlay networks, routing algorithms, and wide-area Internet behavior.
aphid bumblebee cardinal chameleon cicada
cobra cricket frog gator giraffe
grizzly hare hippo hornet jaguar
koala ladybug leopard lion macaw
monkey newt peacock perch python
rattlesnake rhino scorpion swan termite
tick tiger tucan turtle viper
zebra
The server of these PCs is called artemis. To access these PCs, you can either directly login from their consoles in the Zoo, or just remotely login from other machines across the campus.
If you plan to take the course for credit, you should get an account on these machines in the first week. Please also visit the following web site to create a cs425 class directory:
http://www.yale.edu/zooaccts/zooacct.html
Do not allow anyone else to use your accounts for any purpose
. They are for your use alone, and you are responsible for any misuse. Your
passwords control access to your accounts and should be kept secret.
In addition, we will also have access to the Planetlab system for your course projects
.
Exams are scheduled in advance; unless prior arrangements are made, a grade of zero will be recorded for missed exams.
lynx
.