Course details of CS 451 - Distributed Systems

Course Name Distributed Systems
Total Credits 6
Type T
Lecture 6
Tutorial 1
Practical 0
Selfstudy 0
Half Semester N
Prerequisite
Text Reference H. Attiya and J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics, McGraw-Hill, 1998. G. F. Colouris, and J. Dollimore, Distributed Systems: Concepts and design, Addison Wesley, 1988. N. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996. S. Mullender (Ed.), Distributed Systems, 2nd Edition, Addison Wesley, 1993. Tel Gerard, Introduction to distributed algorithms Cambridge University Press, Cambridge, 1994. Michel Raynal, Distributed algorithms and protocols Wiley, Chichester, 1988. Valmir C. Barbosa, An Introduction to Distributed Algorithms, MIT Press, 1996.
Description Introduction to Distributed Computing: absence of global states; causal ordering of events. Distributed architectures: shared memory and message passing, Programming Models such as PVM; MPI; Linda; ORCA, Distributed algorithms: mutual exclusion, consensus, leader election. Clock synchronization, distributed termination. Fault Tolerance:fail-stop and byzantine models.
Last Update 03-04-2003 16:18:14