Scribd
Upload
21 views1 page

DS Syllabus

This document outlines the topics covered in 5 units on distributed systems. Unit I introduces distributed systems concepts like message passing and shared memory models. It covers logical clocks, process communication models and physical clock synchronization. Unit II discusses message ordering, group communication and global state snapshot algorithms. Unit III presents distributed mutual exclusion algorithms. Unit IV covers distributed deadlock detection, checkpointing and rollback recovery algorithms. Unit V examines peer-to-peer computing, overlay networks, distributed shared memory and other advanced topics. The document lists two textbooks for reference.

Uploaded by

ROhit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views1 page

DS Syllabus

This document outlines the topics covered in 5 units on distributed systems. Unit I introduces distributed systems concepts like message passing and shared memory models. It covers logical clocks, process communication models and physical clock synchronization. Unit II discusses message ordering, group communication and global state snapshot algorithms. Unit III presents distributed mutual exclusion algorithms. Unit IV covers distributed deadlock detection, checkpointing and rollback recovery algorithms. Unit V examines peer-to-peer computing, overlay networks, distributed shared memory and other advanced topics. The document lists two textbooks for reference.

Uploaded by

ROhit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

UNIT I

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 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 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
Check pointing and rollback recovery: Introduction – Background and definitions – Issues
in failure recovery – Checkpoint-based recovery – Log-based rollback recovery –
Coordinated check pointing algorithm – Algorithm for asynchronous check pointing 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
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

Text Books:
1) Distributed Systems Concepts and Design, George Coulouris, Jean Dollimore and Tim Kindberg, Fifth Edition,
Pearson Education, 2012.
2) Distributed computing: Principles, algorithms, and systems, Ajay D Kshemkalyani and Mukesh Singhal,
Cambridge University Press, 2011.

You might also like