CS8603 Distributed Systems Syllabus Notes Question Paper Question Banks with answers Anna University
Anna University Distributed Systems Syllabus Notes Question Bank Question Papers Regulation 2017
CS8603 Distributed Systems Syllabus Regulation 2017
Introduction: Definition –Relation to computer system components –Motivation –Relation to parallel systems – Message-passing systems versus shared memory systems –Primitives for distributed communication –Synchronous versus asynchronous executions –Design issues and challenges. A model of distributed computations: A distributed program –A model of distributed executions –Models of communication networks –Global state – Cuts –Past and future cones of an event –Models of process communications. Logical Time: A framework for a system of logical clocks –Scalar time –Vector time – Physical clock synchronization: NTP.
UNIT II MESSAGE ORDERING & 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 & DEADLOCK
Distributed mutual exclusion algorithms: Introduction – Preliminaries – Lamport‘s algorithm – Ricart-Agrawala algorithm – Maekawa‘s algorithm – Suzuki–Kasami‘s broadcast algorithm. Deadlock detection in distributed systems: Introduction – System model – Preliminaries – Models of deadlocks – Knapp‘s classification – Algorithms for the single resource model, the AND model and the OR model.
UNIT IV RECOVERY & CONSENSUS
Checkpointing and rollback recovery: Introduction – Background and definitions – Issues in failure recovery – Checkpoint-based recovery – Log-based rollback recovery – Coordinated checkpointing algorithm – Algorithm for asynchronous checkpointing and recovery. Consensus and agreement algorithms: Problem definition – Overview of results – Agreement in a failure –free system – Agreement in synchronous systems with failures.
UNIT V P2P & 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.
Click below link to download Distributed Systems Syllabus Notes Question papers Question Banks 2 marks with answers Part B Questions with answers download.
CS8603 Notes 1 link download – Click here
CS8603 Notes 2 link download – Click here
CS8603 Question Bank download – click here
CS8603 Two Marks with Answers download – click here*
If you have any problem in downloading the above material, you can comment below.
Other useful links:
Anna University internal Marks Out of 20 check here
Anna University Notes download for all Department – Click here to download
Anna University Previous year Question Paper Collections – Click Here
Check Anna University results updates
UG Syllabus regulation 2017 – Click here
PG Syllabus regulation 2017 – Click here
Anna University Result date – Click here to check
Search by students
CS8603 Distributed Systems Regulation 2017 notes
Anna university UG Notes
Anna University Regulation 2017 Notes Syllabus
Regulation 2017 Syllabus Notes Anna University
CS8603 Distributed Systems Notes Syllabus
CS8603 Distributed Systems Notes
CS8603 Distributed Systems Syllabus
CS8603 Distributed Systems Question papers
CS8603 Distributed Systems Question Bank