JNTUK R20 3-1 Distributed Systems Material/Notes PDF Download

JNTUK R20 3-1 Distributed Systems Material/Notes PDF Download

Students those who are studying JNTUK R20 CSE Branch, Can Download Unit wise R20 3-1 Distributed Systems Material/Notes PDFs below.

JNTUK R20 3-1 Distributed Systems Material/Notes PDF Download

OBJECTIVES:

• 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-1

Distributed Systems: 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.

Download UNIT-1 Material PDF | Reference-2

UNIT-2

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.

Download UNIT-2 Material PDF | Reference-2

UNIT-3

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.

Download UNIT-3 Material PDF | Reference-2

UNIT-4

Recovery & Consensus: 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.

Download UNIT-4 Material PDF | Reference-2

UNIT-5

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.

Download UNIT-5 Material PDF | Reference-2

e-Resources:

https://nptel.ac.in

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.

REFERENCE BOOKS:

1. Distributed Operating Systems: Concepts and Design, Pradeep K Sinha, Prentice Hall of India, 2007.
2. Advanced concepts in operating systems. Mukesh Singhal and Niranjan G. Shivaratri, McGraw-Hill, 1994.
3. Distributed Systems: Principles and Paradigms, Tanenbaum A.S., Van Steen M.,Pearson Education, 2007.

OUTCOMES:

• Elucidate the foundations and issues of distributed systems
• Illustrate the various synchronization issues and global state for distributed systems
• Illustrate the Mutual Exclusion and Deadlock detection algorithms in distributed systems
• Describe the agreement protocols and fault tolerance mechanisms in distributed systems
• Describe the features of peer-to-peer and distributed shared memory systems