Saturday, December 31, 2011

Distributed Operating System / Distributed System : BE - [Comp & IT]

    An important and very interesting subject introduced in the final year, final semester of the Engineering Curriculum. The subject requires Operating System as a pre-requisite. Syllabus for Computer & IT differs in a small perspective. The Syllabus for Computer Engineering is as follows: 

Unit I
Fundamentals – Fundamentals of OS, What is Distributed System? Evolution of Distributed Computing System, Distributed Computing System Models , Distributed Computing gaining popularity Issues in Designing Distributed System, Introduction to Distributed Computing Environment, Protocols for Distributed System, Network, Interprocess Communication, Issues in Interprocess Communication
Message Passing - Introduction , Desirable features of good message passing system, Issues in IPC by Message passing, RPC, RMI Synchronization, Buffering, Multidatagram messages, Encoding and decoding of message data, Process addressing, Failure Handling, Group communication, Case Study: RMI, CORBA. Advances in Distributed Systems

Unit II
Architecture of Distributed System – Introduction, Motivations, Concepts of Distributed System, Process Synchronization, System architecture types, Distributed operating system, NOS, Middleware Communication Networks, Communication primitives, Architectural models of Distributed System
Introduction, Inherent Limitations of a Distributed System, Lamport’s logical clock, Vector clock, Global states, Concept of Process, Process Migration, Threads Clock synchronization, Event ordering, Mutual Exclusion, Deadlock, Election Algorithms
Issues in Designing Distributed System and role of middleware in Distributed System

Unit III
Distributed Mutual Exclusion – Introduction, Classification of mutual exclusion algorithms, Preliminaries, A simple solution to distributed mutual exclusion, non token based algorithms, Ricart Agrawala algorithm, Token based algorithms, Suzuki Kasami’s broadcast algorithms
Distributed Deadlock detection – Introduction, Preliminaries , Deadlock handling strategies , Issues in deadlock detection and resolution, Control organizations for distributed deadlock detection, Centralized deadlock detection algorithms, Distributed deadlock detection algorithms, Avoidance and Prevention algorithms, Hierarchical deadlock detection algorithms
Agreement Protocols – Introduction, System Model, Classification of agreement problems, Solutions to the Byzantine Agreement problem, Applications of Agreement algorithm, Distributed Synchronization and Agreement Protocol, Concepts of Mutual exclusion, Deadlock Solution to Distributed Mutual exclusion

Unit IV
Distributed Resource Management, Concepts of File System, Scheduling Algorithms
Distributed File System :Introduction , Architecture, Mechanisms for building distributed file system, Design issues, Case studies, Log structured file systems, Google FS
Distributed Shared Memory – Introduction, Architecture and Motivation, algorithms for implementing DSM, Memory Coherence, Coherence protocols, Design issues, Case studies-Linda
Distributed Scheduling – Introduction, Motivation, Issues in load distribution, Components of load distributing algorithms, Stability, Load distributing algorithms, Performance Comparison, Selecting a suitable load sharing algorithms, Requirements for load distributing, Load sharing policies, Task migration
Distributed File System: Comparisons

Unit V
Recovery and Security mechanism, Concepts of Database system Security, Basic concepts of Recovery and Types of Failures Recovery – Introduction, Basic concepts, Classification of failures, Backward and forward error recovery, Backward error recovery, Recovery in concurrent systems, Consistent set of checkpoints, Synchronous and Asynchronous check pointing and recovery
Fault tolerance – Introduction, Issues, Atomic actions and committing, Commit Protocols, Non blocking Commit protocols, Voting protocols, Majority based Dynamic Voting protocol, Dynamic vote, Reassignment protocols, Failure Resilient Processes, Reliable communication, Case studies-BAR Fault Tolerance, Targon/32 UNIX
Access and Flow control – Introduction, Preliminaries, Access matrix Model, Implementations of Access Matrix, Safety in Access matrix model, advanced models of protection, Case studies-Unix OS
Distributed Fault tolerance and Security, Advances in Recovery and security mechanisms

Unit VI
Emerging Trends in Distributed System, Concepts of Cluster, Concepts of Grid Computing
Grid Computing
Introduction to GRID Computing, How Grid Computing Works, Grid Middleware, Grid Architecture, Types of Grids Grid Computing Applications, Simulators
SOA: Basic SOA Definition, Overview of SOA, SOA and Web Services, Service Oriented Grid, SOA Design and Development, Advantages and Future of SOA
Grid computing, Cloud and SOA

Syllabus for IT Engineering is as follows :

Unit I: Introduction

Introduction to Distributed Systems: Goals, Architecture, Examples of Distributed Systems, Characteristics, Hardware and Software Concepts, Design Issues, Challenges.
System Models: Architectural models, fundamental models and Failure Model.

Unit II :
Inter-process Communication and Coordination

Message Passing Communication: Communication Primitives, Message Synchronization and Buffering, Pipe, Pipe and Socket APIs, Group Communication, Multicasting Remote Procedural Call: Basic Operation, Implementation and Call Semantics,
Failure Handling, LRPC
Object Oriented Distributed Computing Technologies – Basics, design issues of various technologies like RMI and CORBA with semantics and executions.

Unit III: Synchronization and Election

Clock Synchronization: Logical and Physical Clocks, Algorithms and Uses
Mutual Exclusion: Centralize, Distributed and Token Ring Algorithms, Comparison
Logical Clocks: Lamport’s Logical Clock, Vector Clocks
Global State: Needs, Properties and Various Global States
Election Algorithm: Bully and Ring Algorithm

Unit IV: Distributed File Systems

Introduction, Characteristics, File Service Architecture Sun Network and CODA File System: Overview of NFS, Communication, Processes, Naming, Synchronization, Consistency and Replication, Fault Tolerance and Security
Naming Services: Case Study of Global Name Service and X.500 Directory Service

Unit V: Distributed Shared Memory

Replication: Introduction, Reasons for Replication, Object Replication and Scaling Technique
Distributed Shared Memory: Design and Implementation Issue;
Data Centric Consistency Models - Strict, Sequential, Casual, PRAM, Weak, Release, Entry
Client-Centric Consistency Models: Eventual, Monotonic Reads, Monotonic Writes, Read Your Writes, Writes Follow Reads

Unit VI: Fault Tolerant and Recovery

Fault Tolerance: Concepts, Failure Models, Failure Masking by Redundancy
Process Resilience: Design Issues, Failure Masking and Replication, Agreement in Faulty Systems
Recovery: Introduction, Check-pointing, Message Logging – Synchronous and Asynchronous, Adaptive Logging 

Books for Download :

Distributed Systems – Concept and Design
Coulouris, Dollimore, Kindberg

File Type : PDF
Size : 36.09 MB

Distributed Systems – Principles andParadigms
Tanenbaum , Steen

File Type : PDF
Size : 9 MB

Distributed Systems Architecture


File Type : PDF
Size : 1.8 MB


Distributed Systems
Andrew S. Tannenbaum, Marteen Steen

Download Now
File Type : PDF
Size : 32MB

Video Lectures

Introduction  to Distributed System

 ..... a few more comming soon