FREE
AKTU Distributed System (BCS077H) Syllabus PDF – B.Tech 4th Year
Distributed System BCS077H
All syllabus, notes, question bank & PYQ for this subject
Free
Download now
- English
- Semester 7
- 0 downloads
- 0 views
Official AKTU syllabus of Distributed System (BCS077H) for B.Tech 4th Year – 3 credits, L-T-P 3-0-0. Read the unit-wise course content, course outcomes, evaluation pattern and recommended books online, or download the PDF.
Syllabus — Distributed System
Download PDFBCS077H · 3 credits · L-T-P 3-0-0
Course Outcomes
At the end of course , the student will be able to understand
| CO 1 | To provide hardware and software issues in modern distributed systems. | K1 , K2 |
| CO 2 | To get knowledge in distributed architecture, naming, synchronization, consistency and replication, fault tolerance, security, and distributed file systems. | K2 |
| CO 3 | To analyze the current popular distributed systems such as peer-to-peer (P2P) systems will also be analyzed. | K4 |
| CO 4 | To know about Shared Memory Techniques and have Sufficient knowledge about file access | K1 |
| CO 5 | Have knowledge of Synchronization and Deadlock. | K1 |
Course Content
L-T-P: 3-0-0
| Unit | Topic | Proposed Lecture |
|---|---|---|
| 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. | 08 |
| 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, deadlock prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection, path pushing algorithms, edge chasing algorithms. | 08 |
| 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 building distributed file systems, Design issues in Distributed Shared Memory, Algorithm for Implementation of Distributed Shared Memory. | 08 |
| IV | Failure Recovery in Distributed Systems: Concepts in Backward and Forward recovery, Recovery in Concurrent systems, Obtaining consistent Checkpoints, Recovery in Distributed Database Systems. Fault Tolerance: Issues in Fault Tolerance, Commit Protocols, Voting protocols, Dynamic voting protocols | 08 |
| V | Transactions and Concurrency Control: Transactions, Nested transactions, Locks, Optimistic Concurrency 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 and group communication, Fault - tolerant services, highly available services, Transactions with replicated data. | 08 |
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 5. Tenanuanbaum, Steen,” Distributed Systems”, PHI
Ratings & Reviews
No reviews yet — share your experience with this item.