8 CS 4.1-DISTRIBUTED SYSTEMS |
Units: I |
CHARACTERIZATION OF DISTRIBUTED SYSTEMS: Introduction, Examples of distributed Systems, Resource sharing
and the Web Challenges. System Models: 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, Causal ordering of messages, global state, termination. 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.
|
Units: II |
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. 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. |
Units: III |
DISTRIBUTED OBJECTS AND REMOTE INVOCATION: Communication between distributed objects, Remote procedure
call, Events and notifications, Java RMI case study. SECURITY: Overview of security techniques, Cryptographic
algorithms, Digital signatures Cryptography pragmatics, Case studies: Needham Schroeder, Kerberos, SSL & Millicent.
DISTRIBUTED FILE SYSTEMS: File service architecture, Sun Network File System, The Andrew File System, Recent
advances.
|
Units: IV |
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.
|
Units: V |
DISTRIBUTED ALGORITHMS: Introduction to communication protocols, Balanced sliding window protocol,
Routing algorithms, Destination based routing, APP problem, Deadlock free Packet switching, Introduction to Wave &
traversal algorithms, Election algorithm. CORBA CASE STUDY: CORBA RMI, CORBA services.
|
|