CS8603 DS Syllabus
Anna University Regulation 2017 CSC CS8603 DS Syllabus for all 5 units are provided below. Download link for CSC 6th Sem CS8603 DISTRIBUTED SYSTEMS Engineering Syllabus is listed down for students to make perfect utilization and score maximum marks with our study materials.
Anna University Regulation 2017 CSC Engineering (CSC) 6th Sem CS8603 DISTRIBUTED SYSTEMS Engineering Syllabus
CS8603 DISTRIBUTED SYSTEMS
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 INTRODUCTION
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.
To Download Syllabus – Click here
If you require any other notes/study materials, you can comment in the below section.
For CS8603 DS Previous Year Question Papers – Click here
For CS8603 DS Question Bank/2marks 16marks with answers – Click here
For CS8603 DS Important Questions/Answer Key – Click here
For CS8603 DS Lecture Handwritten Notes – Click here
CS8603 DS Syllabus
Anna University 6th Sem CSC DS Syllabus
CS8603 DISTRIBUTED SYSTEMS Engineering Syllabus free download
Anna University CSC DS Syllabus Regulation 2017
CS8603 Syllabus, DS Unit wise Syllabus – CSC 6th Semester