Distributed Systems detail syllabus for Computer Science & Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (CS8603), Category (PC), Contact Periods/week (3), Teaching hours/week (3), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other cse 6th sem syllabus for be 2017 regulation anna univ you can visit Cse 6th Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for distributed systems is as follows.”
Course Objective:
- To understand the foundations of distributed systems.
- To learn issues related to clock Synchronization and the need for global state in distributed systems.
- To learn distributed mutual exclusion and deadlock detection algorithms.
- To understand the significance of agreement, fault tolerance and recovery protocols in Distributed Systems.
- To learn the characteristics of peer-to-peer and distributed shared memory systems.
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Message Ordering and Snapshots
Message ordering and group communication: Message ordering paradigms -Asynchronous execution with synchronous communication -Synchronous program order on an asynchronous system -Group communication – Causal order (CO) – Total order. Global state and snapshot recording algorithms: Introduction -System model and definitions -Snapshot algorithms for FIFO channels
Unit III
Distributed Mutex and Deadlock
Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamports algorithm -Ricart-Agrawala algorithm – Maekawas algorithm – Suzuki-Kasamis broadcast algorithm. Deadlock detection in distributed systems: Introduction – System model – Preliminaries -Models of deadlocks – Knapps classification – Algorithms for the single resource model, the AND model and the OR model.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Peer To Peer and Distributed Shared Memory
Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Chord – Content addressable networks – Tapestry. Distributed shared memory: Abstraction and advantages – Memory consistency models -Shared memory Mutual Exclusion.
Course Outcome:
At the end of this course, the students will be able to:
- Elucidate the foundations and issues of distributed systems
- Understand the various synchronization issues and global state for distributed systems.
- Understand the Mutual Exclusion and Deadlock detection algorithms in distributed systems
- Describe the agreement protocols and fault tolerance mechanisms in distributed systems.
- Describe the features of peer-to-peer and distributed shared memory systems
Text Books:
- Kshemkalyani, Ajay D., and Mukesh Singhal. Distributed computing: principles, algorithms, and systems. Cambridge University Press, 2011.
- George Coulouris, Jean Dollimore and Tim Kindberg, Distributed Systems Concepts and Design, Fifth Edition, Pearson Education, 2012.
References:
- Pradeep K Sinha, “Distributed Operating Systems: Concepts and Design”, Prentice Hall of India, 2007.
- Mukesh Singhal and Niranjan G. Shivaratri. Advanced concepts in operating systems. McGraw-Hill, Inc., 1994.
- Tanenbaum A.S., Van Steen M., Distributed Systems: Principles and Paradigms, Pearson Education, 2007.
- Liu M.L., Distributed Computing, Principles and Applications, Pearson Education, 2004.
- Nancy A Lynch, Distributed Algorithms, Morgan Kaufman Publishers, USA, 2003.
For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 6th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.