From kdickey@theory.lcs.mit.edu Wed Aug 28 15:58:27 2002 MIME-Version: 1.0 From: "Kathleen Dickey" To: "'Joanne Talbot Hanley'" Subject: Date: Wed, 28 Aug 2002 15:58:26 -0400 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0039_01C24EAB.BF00CCB0" X-Priority: 3 (Normal) X-MSMail-Priority: Normal Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 X-Spam-Status: No, hits=4.5 required=5.0 tests=BIG_FONT,SUBJ_MISSING version=2.20 X-Spam-Level: **** This is a multi-part message in MIME format. ------=_NextPart_000_0039_01C24EAB.BF00CCB0 Content-Type: multipart/alternative; boundary="----=_NextPart_001_003A_01C24EAB.BF00CCB0" ------=_NextPart_001_003A_01C24EAB.BF00CCB0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Kathleen Dickey MIT Laboratory for Computer Science NE43-330 200 Technology Square, Cambridge, MA 02139 USA 617 253 3037 kdickey@theory.lcs.mit.edu ------=_NextPart_001_003A_01C24EAB.BF00CCB0 Content-Type: text/html; charset="us-ascii" Content-Transfer-Encoding: quoted-printable

 

 

Kathleen Dickey

 

MIT Laboratory for Computer Science =

NE43-330

200 Technology Square, = Cambridge, MA 02139 USA

617 253 3037

kdickey@theory.lcs.mit.edu

 

------=_NextPart_001_003A_01C24EAB.BF00CCB0-- ------=_NextPart_000_0039_01C24EAB.BF00CCB0 Content-Type: text/html; name="course6895.html" Content-Transfer-Encoding: quoted-printable Content-Disposition: attachment; filename="course6895.html" Course Schedule for 6.895 Advanced Distributed Algorithms/ = Professor Nancy Lynch/ MIT

Massachusetts Insitute for Technology
6.895 Advanced Distributed Algorithms
Professor Nancy Lynch

 

Course Schedule

September:


Class 1: Thursday, Sept. 5, Nancy Lynch
Introduction to the course. Shared memory algorithms: Mutual = exclusion.

Papers covered:
Lamport. A Fast Mutual Exclusion Algorithm
Friedberg, Peterson. An Efficient Solution to the Mutual Exclusion = Algorithm=20 Using Weak Semaphores.

Class 2: Tuesday, Sept. 10, Nancy Lynch
Shared memory: Renaming. Snapshot and collect.

Papers covered:
Moir, Anderson. Wait-free Algorithms for Fast, Long-Lived Renaming. =
Attiya, Fouren. Adaptive and Efficient Algorithms for Lattice = Agreement and=20 Renaming.

Class 3: Thursday, Sept. 12, Nancy Lynch
Shared memory: Computing with faulty objects. Computing with an = unknown set=20 of participants.

Class 4: Tuesday, Sept. 17
Client-server computing: Byzantine quorum systems.

Class 5: Thursday, Sept. 19
Client-server computing: Data replication.

Class 6: Tuesday, Sept. 24
Client-server computing: Disk Paxos. Disk Paxos with infinitely many = processes.=20

Class 7: Thursday, Sept. 26
Networks with known participants: Logical time. Clock synchronization. =

October:

Class 8: Tuesday, Oct. 1
Networks with known participants: Failure detectors

Class 9: Thursday, Oct. 3
Failure detectors.

Class 10: Tuesday, Oct. 8
Networks with known participants: Fault-tolerant broadcasts.

Class 11: Thursday, Oct. 10
Networks with known participants: Consensus. The Paxos algorithm.

Tuesday, Oct. 15: Columbus Day, Vacation---NO CLASS.

Class 12: Thursday, Oct. 17
Consensus: Early stopping algorithms

Class 13: Tuesday, Oct. 22
Networks with known participants: Data replication.

Class 14: Thursday, Oct. 24
Networks with known participants: Performing work in distributed = systems.

Class 15: Tuesday, Oct. 29
Networks with known participants: Self-stabilizing systems.

Class 16: Thursday, Oct. 31
Self-stabilizing systems.

November:

Class 17: Tuesday, Nov. 5
Networks with unknown participants: End-to-end communication and = routing. Building=20 communication structures.

Class 18: Thursday, Nov. 7
Group communication

Class 19: Tuesday, Nov. 12
Group communication

Class 20: Thursday, Nov. 14
Peer-to-peer networks: Location services.

Class 21: Tuesday, Nov. 19
Location services, continued

Class 22: Thursday, Nov. 21
Reconfigurable atomic memory: The RAMBO algorithm.

Class 23: Tuesday, Nov. 26
Mobile computing: Topology control.

December:

Class 24: Tuesday, Dec. 3
Mobile computing: Routing and end-to-end communication.

Class 25: Thursday, Dec. 5
Mobile computing: Leader election, mutual exclusion and other = problems.

Class 26: Tuesday, Dec. 10

Mobile computing: Coordinated robots.

 


------=_NextPart_000_0039_01C24EAB.BF00CCB0--