I320: Distributed Systems and Collaborative Computing
 |
Class announcements
appear below, in reverse chronological order.
Bullet items are
things to do! |
CORBA class notes and code
Remote method invocation class notes and code and
advanced RMI notes
UDP, Multicasting, and Object-oriented Design with
MulticastChat.java
Introduction to networking
Assignment 4
Threads and synchronization problems and
code
- Assignment 3
- Read chapters 3 and 5.
- On Tuesday, 2/10, turn in the following exercises from
chapter 2: 2, 3, 5, 9 (use telnet time.nist.gov), and 14 (use telnet
whale.cs.indiana.edu 25, enter any name in the HELO line, and note that
responses vary from those in the book). Think about, but do not turn in,
exercises 1 and 8.a.
Programming assignments 1 and 2 are due at the beginning of
lab on 2/6.
Deadlock, box layout, and serialization
and code
Streams and simple server notes. and
code.
- Programming assignment 2: Modify
GuiInfoClient.java to invoke and display all three of the web information
fetches in your solution to the last assignment. Maintain the MVC architecture
and notifier pattern.
- Read chapters 2 and 4.
- Programming assignment 1: due 1/23. Modify
InfoClient.java to fetch three different kinds of information from
the web other than the world population. In one of these, do not use the
regular expression dotall, (?s), mode (you don't have to use regular expressions
at all, just string methods). Submit all programming assignments via
email to chaynes.
- On Tuesday, January 27th, if your schedule allows it, go to the colloquium
on public-key encryption in the IMU Persimmon Room from 10:30 - 11:30 a.m.
(Public-key encryption is fundamental to distributed system security.) No
regular I320 class that day because the times overlap. In the following class,
turn in a one paragraph description of some point in the colloquium that was
of most interest to you. If you have a scheduling conflict with the
colloquium, study something about public-key encryption from some book or the
web and write a one page description of what you found most interesting.
- Do the following exercises from chapter 1. On 1/20 (next Tuesday) in class turn in a
paper with your answers to exercises indicated by * below (handwritten paper
is fine). The others you can do in your head and/or on paper you keep.
- exercise 2.a (skip subpart i)
- * exercise 3
- * exercise 4, skipping parts f, h.iii, and j. Do part d before b and c.
The first 3 lines of the table in d is enough. On some system, use the command
host instead of nslookup. For part b, use indiana.edu.
For part i, can you think of a distributed computing situation in which use of
PIDs is especially appropriate?
- * exercise 5.
- By T 1/20, finish reading chapter 1.
- By R 1/15, carefully read chapter 1 through section 5
Email
chaynes@indiana.edu
with questions or comments about this course web.