Bachelor of Computer Science & Engineering 4rd Year (VII-VIII Semester) Aktu Lecture Notes
NCS- 701 DISTRIBUTED SYSTEMS
Unit–I:
- Characterization of Distributed Systems: Introduction, Examples of distributed Systems, Resource sharing and the Web Challenges. Architectural models, Fundamental Models.
- Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared memory, Logical clocks,Lamport’s& vectors logical clocks.
- Concepts in Message Passing Systems: causal order, total order, total causal order, Techniques for Message Ordering, Causal ordering of messages, global state, termination detection.
Unit-II:
- Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual exclusion theorem, Token based and non token based algorithms, performance metric for distributed mutual exclusion algorithms.
- Distributed Deadlock Detection: system model, resource Vs communication deadlocks, deadlockprevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms.
Unit–III:
- Agreement Protocols: Introduction, System models, classification of Agreement Problem,Byzantine agreement problem, Consensus problem, Interactive consistency Problem, Solution to Byzantine Agreement problem, Application of Agreement problem, Atomic Commit in Distributed Database system.
- Distributed Resource Management: Issues in distributed File Systems, Mechanism for buildingdistributed file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed Shared Memory.
Unit–IV:
- Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery, Recoveryin Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed Database Systems.
- Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting protocols, Dynamicvotingprotocols.
Unit –V:
- Transactions and Concurrency Control: Transactions, Nested transactions, Locks, OptimisticConcurrency control, Timestamp ordering, Comparison of methods for concurrency control.
- Distributed Transactions: Flat and nested distributed transactions, Atomic Commit protocols,Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. Replication: System model
Text Books:
- Singhal & Shivaratri, "Advanced Concept in Operating Systems", McGraw Hill
- Ramakrishna, Gehrke,” Database Management Systems”, McGraw Hill
- Vijay K.Garg Elements of Distributed Compuitng , Wiley
- Coulouris, Dollimore, Kindberg, "Distributed System: Concepts and Design”, Pearson Education
- Tenanuanbaum, Steen,” Distributed Systems”, PHI
- Gerald Tel, "Distributed Algorithms", Cambridge University Press
Unit II: [DOWNLOAD ]
Unit III: [DOWNLOAD ]
Unit IV: [DOWNLOAD ]
Unit V: [DOWNLOAD ]
*Feeling any trouble in downloading or do you have NOTES of any subject/any Stream ,then plz feel free to contact us or leave your comments in comment box*
loading...
5 Comments
sir i needed a neural network
ReplyDeleteThe writing is not clear ,if anyone had copied it in clear handwriting plz forward it
ReplyDeleteCan't able to download the notes
ReplyDeleteLinks has been update, try downloading now
ReplyDeletethank you very much Sir, Sir can you send HIGH PERFORMANCE COMPUTING notes my Email id is naseemkhan033@gmail.com
ReplyDeleteThank you once again Sir.
We Will Love to Hear From You! Pls Comment Your Views...........