Distributed Systems
Instructor: Tom Anderson
Textbook: Reliable Distributed System by Kenneth Birman
Download Slides from here
Lamport, Shostak and Pease. The Byzantine Generals Problem. ACM TOPLAS, July 1982. (pdf)
OPTIONAL: Lowell, Chandra, Chen. Exploring Failure Transparency and the Limits of Generic Recovery, OSDI 2000. (pdf)
OPTIONAL: Birman, Chapter 24
Rowstron and Druschel, Storage Management and Caching in PAST, A Large Scale Peer-to-Peer Storage Utility, SOSP 2001. (pdf)
Adya et al., FARSITE: Federated, Available Reliable Storage for an Incompletely Trusted Environment, OSDI 2002. (pdf)
Ghemawat et al., The Google File System, SOSP 2003. (pdf)
Instructor: Thomas W.Deoppner
Textbook: Foundations Of Multithreaded , parallel ,and Distributed Programming
Course Title: Distributed Systems and Advanced Distributed Systems
Branch: Computer science and Engineering
Author: Dr. Stephen W. Turner
University: University of Michigan-Flint
Download Slides here:
Distributed Systems
Solutions to concurrent programming problems
Notes
Slides Introducing Distributed Systems printable version
Slides on Threads printable version
Slides on Thread Creation printable version
Slides on Thread Interaction printable version
Slides on Concurrent Programming patterns printable version
Slides on Deadlocks printable version
Slides on the Message Passing Interface printable version
Slides on Network Overview printable version
Slides on Client Server paradigm printable version
Slides on Remote Procedure Calls printable version
Slides on XML printable version
Slides on Synchronization printable version
Slides on Distributed Mutual Exclusion printable version
Slides on Leader Election printable version
Slides on Transactions printable version
Slides on the C# language printable version
Slides on WSDL printable version
Slides on .NET Remoting printable version
Slides on Web Services printable version
Notes on Web Technology
Slides on Web Technology
Notes on Socket Programming printable version
Slides on Security printable version
Slides on Kerberos printable version
Examples and Downloads
A simple .NET application
A simple two process distributed mutual exclusion algorithm
A free implementation of MPI is available at http://www-unix.mcs.anl.gov/~ashton/mpich.nt/
Source code for example client and server programs:All of these programs have the same functionality and are interchangeable. The client program sends a message to the server which responds by sending a message back to the client. Both programs then terminate.
client and server from chapter 30 of "Computer Networks and Internets" by D. Comer., ISBN 0-13-143351-2
client and server in C using TCP by Dr. Williams
client for Windows and client for Unix in C++ using TCP by Dr. Williams
client and server in C using UDP by Dr. Williams
client and server in Java using UDP by Dr. Williams
CSP examples
Dr. Xu's slides on Distributed Simulation
A User s Guide to MPI by Peter S. Pacheco of the Department of Mathematics University of San Francisco
Distributed Systems II
Download Slides:
Lecture 1: Introduction. Slides: pptx
Lecture 2: Fault-Tolerant Broadcasting. Slides: ppt
Assignment Lecture 1: Introduction to lab 1. Slides: ppt pdf
Lecture 3: Broadcasting, Replication part 1. Slides: pptx
Lecture 4: Replication part 2. Slides: pptx. On view synchronous group communication: pdf
Lecture 5: Replication part 3, Quorum Consensus. Slides: pptx
Assignment Lecture 2: Introduction to lab 2. Slides: ppt pdf
Lecture 6: Denial of Service attacks. Slides: pptx
Lecture 7: Distributed Transactions. Slides: pptx
Lecture 8: Byzantine agreement ppt
Lecture 9: Distributed Algorithms pdf, Extra reading material on Byzantine agreement pdf
Assignment Lecture 4: Introduction to TinyOS (Selected slides from Turgay Korkmaz) ppt and presentation of lab 3 ppt
Lecture 10: Routing in sensor networks (Selected slides from Roger Watterhofer): ppt
Lecture 11: Mutual Exclusion and Resource Allocation. Dining Philosophers. Slides: pdf
Lecture 12: Generalization of the Dining Philosophers. Slides: pdf
Lecture 13: Drinking Philosophers and Efficient Resource Allication. Slides: pdf
Lecture 14: Efficient Resource Allication Continued. Slides: pptx
Instructor: Tom Anderson
Textbook: Reliable Distributed System by Kenneth Birman
Download Slides from here
· Motivating Examples
- Eric Brewer, Lessons from Giant Scale Services, IEEE Internet Computing, 2001. (pdf)
Distributed Synchronization
- Leslie Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, Vol. 21, No. 7 (July 1978), pp. 558-565. (pdf)
Process Groups / Causal Ordering
- Slides for this week (CSENetId-protected)
Distributed Agreement
- Slides for this week (CSENetId-protected)
- Leslie Lamport, Part Time Parliament, ACM TOCS vol. 16, no. 2, 133-169. (pdf)
- Leslie Lamport, Paxos Made Simple, ACM SIGACT News, 2001. (pdf)
Programming Models: RPC, SOAP, web services, Grid, AJAX
- Slides: Atomic Commit (pdf), GENI (pdf), Consistency (ppt)
- J. Ousterhout. The Role of Distributed State. CMU Computer Science: A 25th Anniversary Birman, Chapter 4 (preferred)
or
Andrew D. Birrell and Bruce Jay Nelson. Implementing Remote Procedure Calls. ACM Trans. on Computer Systems 2(1), February 1984, pp. 39-59. (pdf)
· Fault Tolerance
- Slides:
- Paxos (slide 24+) (pdf)
- Paxos Wrapup (slides 1-8) (pdf)
- State Machine Replication (pdf)
- More State Machine Replication (pdf)
- Byzantine Fault Tolerance (slides 135-167) (pdf)
- Paxos Byzantine Fault Tolerance (pdf)
Weakly Consistent Distributed Systems
- Guest Lecturer: Arvind Krishnamurthy (his slides)
- System. SOSP 1995. (pdf)
Scalability and Peer to Peer
- Kleinberg, Navigation in a Small World, Nature, 2000. (pdf)
- OPTIONAL: T. Anderson, M. Dahlin, J. Neefe, D. Patterson, D. Roselli, and R. Wang. Serverless Network File Systems. ACM TOCS 1996. (pdf)
Security and Robustness
- Slides for this week: (ppt)
- Lampson, Computer Security in the Real World, 2001. (pdf) (ppt)
- Anderson et al., Design Considerations for Robust Internet Protocols, HotNets 2002. (pdf)
Putting it all Together
- Slides for this week:
Parallel And Distributed Programming PDF Slides
Textbook: Foundations Of Multithreaded , parallel ,and Distributed Programming
Course Title: Distributed Systems and Advanced Distributed Systems
Branch: Computer science and Engineering
Author: Dr. Stephen W. Turner
University: University of Michigan-Flint
Download Slides here:
Chapter | 1-up Format | 2-up Format | 4-up Format | Supplemental Material |
---|---|---|---|---|
Chapter 1, Introduction | ch01.pdf | ch01-2.pdf | ch01-4.pdf | |
Chapter 2, Architectures | ch02.pdf | ch02-2.pdf | ch02-4.pdf | ch02.zip |
Chapter 3, Processes | ch03.pdf | ch03-2.pdf | ch03-4.pdf | |
Chapter 4, Communication | ch04.pdf | ch04-2.pdf | ch04-4.pdf | |
Chapter 5, Naming | ch05.pdf | ch05-2.pdf | ch05-4.pdf | |
Chapter 6, Synchronization | ch06.pdf | ch06-2.pdf | ch06-4.pdf | |
Chapter 7, Consistency and Replication | ch07.pdf | ch07-2.pdf | ch07-4.pdf | |
Chapter 8, Fault Tolerance | ch08.pdf | ch08-2.pdf | ch08-4.pdf | |
Chapter 9, Security | ch09.pdf | ch09-2.pdf | ch09-4.pdf | |
Chapter 10, Distributed Object-Based Systems | ch10.pdf | ch10-2.pdf | ch10-4.pdf | |
Chapter 11, Distributed File Systems | ch11.pdf | ch11-2.pdf | ch11-4.pdf | |
Chapter 12, Distributed Web-Based Systems | ch12.pdf | ch12-2.pdf | ch12-4.pdf | |
Chapter 13, Distributed Coordination-Based Systems | ch13.pdf | ch13-2.pdf | ch13-4.pdf |
Distributed Systems
taught by Dr. Ken Williams
Text Book:
The textbook for COMP750 Distributed Systems is “Distributed Systems: Principles and Paradigms” by Andrew S. Tanenbaum and Maarten van Steen, Prentice Hall, 2002,
ISBN: 0-13-088893-1
WSDL exampleISBN: 0-13-088893-1
Solutions to concurrent programming problems
Notes
Slides Introducing Distributed Systems printable version
Slides on Threads printable version
Slides on Thread Creation printable version
Slides on Thread Interaction printable version
Slides on Concurrent Programming patterns printable version
Slides on Deadlocks printable version
Slides on the Message Passing Interface printable version
Slides on Network Overview printable version
Slides on Client Server paradigm printable version
Slides on Remote Procedure Calls printable version
Slides on XML printable version
Slides on Synchronization printable version
Slides on Distributed Mutual Exclusion printable version
Slides on Leader Election printable version
Slides on Transactions printable version
Slides on the C# language printable version
Slides on WSDL printable version
Slides on .NET Remoting printable version
Slides on Web Services printable version
Notes on Web Technology
Slides on Web Technology
Notes on Socket Programming printable version
Slides on Security printable version
Slides on Kerberos printable version
Examples and Downloads
A simple .NET application
A simple two process distributed mutual exclusion algorithm
A free implementation of MPI is available at http://www-unix.mcs.anl.gov/~ashton/mpich.nt/
Source code for example client and server programs:All of these programs have the same functionality and are interchangeable. The client program sends a message to the server which responds by sending a message back to the client. Both programs then terminate.
client and server from chapter 30 of "Computer Networks and Internets" by D. Comer., ISBN 0-13-143351-2
client and server in C using TCP by Dr. Williams
client for Windows and client for Unix in C++ using TCP by Dr. Williams
client and server in C using UDP by Dr. Williams
client and server in Java using UDP by Dr. Williams
CSP examples
Dr. Xu's slides on Distributed Simulation
A User s Guide to MPI by Peter S. Pacheco of the Department of Mathematics University of San Francisco
Distributed Systems II
Download Slides:
Lecture 1: Introduction. Slides: pptx
Lecture 2: Fault-Tolerant Broadcasting. Slides: ppt
Assignment Lecture 1: Introduction to lab 1. Slides: ppt pdf
Lecture 3: Broadcasting, Replication part 1. Slides: pptx
Lecture 4: Replication part 2. Slides: pptx. On view synchronous group communication: pdf
Lecture 5: Replication part 3, Quorum Consensus. Slides: pptx
Assignment Lecture 2: Introduction to lab 2. Slides: ppt pdf
Lecture 6: Denial of Service attacks. Slides: pptx
Lecture 7: Distributed Transactions. Slides: pptx
Lecture 8: Byzantine agreement ppt
Lecture 9: Distributed Algorithms pdf, Extra reading material on Byzantine agreement pdf
Assignment Lecture 4: Introduction to TinyOS (Selected slides from Turgay Korkmaz) ppt and presentation of lab 3 ppt
Lecture 10: Routing in sensor networks (Selected slides from Roger Watterhofer): ppt
Lecture 11: Mutual Exclusion and Resource Allocation. Dining Philosophers. Slides: pdf
Lecture 12: Generalization of the Dining Philosophers. Slides: pdf
Lecture 13: Drinking Philosophers and Efficient Resource Allication. Slides: pdf
Lecture 14: Efficient Resource Allication Continued. Slides: pptx
No comments:
Post a Comment