1

FACULTY OF SCIENCE AND HUMANITIES

DEPARTMENT OF COMPUTER APPLICATIONS

LESSON PLAN(CICP)
Course Code : MC13E21
Course Title : Distributed Operating System
Semester : V
Course Time : Dec – Mar 2015
Day
Hour Timing
I 4 11:45 AM – 12: 35 PM
III 1,3 09:00 AM – 09:50, 10:55 AM – 11: 45 AM
V 5 01:50 PM – 02:40 PM

Location : Tech Park - Ground Floor

Faculty Details
Sec. Name Office Office hour Mail id
Tech Park –
1 T.K.SIVAKUMAR Ground Floor 9.00 AM to 3.35 PM sivakumar.tk@ktr.srmuniv.ac.in
Lab

Required Books:
1. Andrew S Tanenbaum - Distributed Operating Systems - Pearson Education,2001.
2. Mukesh Singal Niranjan G Shivrartri, -Advanced Concepts in Operating Systems - Mc Graw
Hill International , 1994.

Reference Books:
1. Pradeep K Sinha - Distributed Operating System: Concepts and Design – Wiley Publications,
1996

Web resources

http://www.e-reading.link/book.php?book=143358
Objectives
To gain depth knowledge of challenges and issues of incorporating distributed OS concepts and to
understand operating system principles, Distributed Computing techniques, Synchronization and
Processes, Shared Data access files
And Case study.

Assessment Details
Cycle Test : 10 Marks
Surprise Test : 05 Marks
Model Exam : 20 Marks
 2
2 Assignments : 10 Marks
Attendance : 05 Marks

Total : 50 Marks
Test Schedule
S.No. DATE TEST TOPICS DURATION
1 21-Jan-2015 Cycle Test I, II Units 2 Periods
2 18-Mar- 2015 Model All five Units 3 Hours

Outcomes
Students who have successfully completed this course will have full understanding of the
following concepts

Course outcome

The Concepts of operating system

The Concepts of distributed system
Synchronization memory
Case Study: Amoeba
Program outcome
The concepts of Distributed System can be applied in the industry to share the system
resources and can improve the performance of the system New Distributed System project can be
developed and implemented

Detailed Session Plan

UNIT : I INTRODUCTION & COMMUNICATION OF DISTRIBUTED SYSTEMS

Introduction & Goals - Hardware Concepts - Software concepts - Design issues - layered protocols -
ATM Networks - client server model - Remote Procedure calls - Group Communication

Sessi
Time Teaching
on Topics to be covered Ref Testing Method
(min) Method
No.
Introduction to Distributed Systems Discussion
1 50 1 BB
WHAT IS A DISTRIBUTED SYSTEM?
GOALS
Advantages of Distributed Systems over
Centralized Systems Discussion
2 Advantages of Distributed Systems over 50 1 BB
Independent PCs
Disadvantages of Distributed Systems
HARDWARE CONCEPTS
Bus-Based Multiprocessors
Group discussion
3 Switched Multiprocessors 50 1 BB
Bus-Based Multicomputers
Switched Multicomputers
SOFTWARE CONCEPTS
Network Operating Systems
4 50 1 BB Discussion
True Distributed Systems
Multiprocessor Timesharing Systems
 3

DESIGN ISSUES
Comparative Study
5 Transparency,Flexibility,Reliability, 50 1 BB
Performance, Scalability
layered protocols
6 50 1 BB Discussion
7 ATM Networks 50 1 BB Comparative Study
client server model Group discussion
8 50 1 BB

9
Remote Procedure calls 50 1 BB Comparative Study
Group Communication
10 50 1 BB Discussion
UNIT 2: SYNCHRONIZATION IN DISTRIBUTED SYSTEMS
Clock synchronization - mutual exclusion - Election algorithms - Atomic transactions - Transaction
model - Implementation and Concurrency control - Deadlocks
Clock synchronization Discussion
11 50 1 BB
mutual exclusion 1 Discussion
12 50 BB
Election algorithms 1 Assignment
13 50 BB
Atomic transactions - Transaction 1 Group discussion
14 50 BB
15 Implementation and Concurrency control 50 1 BB Discussion
Deadlocks 1 Discussion
16 50 BB
UNIT 3: PROCESSES AND PROCESSORS IN DISTRIBUTED SYSTEMS
Threads - Threads design issues and implementation - System models - processor allocation - Design &
implementation issues - Example processor allocation algorithms and Scheduling Fault tolerance –Types
- Use of redundancy - Real time distributed systems - Real time Scheduling and communication

THREADS-Thread Usage,Design Issues

Group discussion
17 for Threads Packages, Implementing a 50 1 BB
Threads Package
SYSTEM MODELS - The Workstation
18 Model ,Using Idle Workstations The 50 1 BB Discussion
Processor Pool Model, A Hybrid Model
PROCESSOR ALLOCATION-
Allocation Models, Design Issues for
Assignment
19 Processor Allocation Algorithms, 50 1 BB
Implementation Issues for Processor
Allocation Algorithms, Example
Processor Allocation Algorithms
20 50 1 BB Discussion

21 A Graph-Theoretic Deterministic 50 1 BB Group Discussion

Algorithm
22 A Centralized Algorithm 50 1 BB Discussion
A Hierarchical Algorithm
 4
23 Use of redundancy 50 1 BB Discussion
24 Real time distributed systems 50 1 BB Discussion
Real time Scheduling and communication
25 50 1 BB Discussion
UNIT 4: DISTRIBUTED FILE SYSTEMS AND SHARED MEMORY
Distributed File Systems Design - DFS Implementation - Example DFS - Trends - Shared memory
Introduction - Consistency models - Page-based distributed shared memory - Shared-variable
distributed shared memory - Object-based distributed shared memory - Comparison
DISTRIBUTED FILE SYSTEM
26 IMPLEMENTATION - File Usage, 50 1 BB Group discussion
System Structure, Caching, Cache
Consistency, Replication
27 Update Protocols, NFS Architecture 50 1 BB Discussion
NFS Protocols, NFS Implementation
TRENDS IN DISTRIBUTED FILE
28 50 1 BB Discussion
SYSTEMS - New Hardware, Scalability
Wide Area Networking , Mobile Users
29 50 1 BB Group discussion
Fault Tolerance
WHAT IS SHARED MEMORY?
On-Chip Memory,Bus-Based
30 Multiprocessors,Ring-Based 50 1 BB Group discussion
Multiprocessors, Switched
Multiprocessors,NUMA Multiprocessors
CONSISTENCY MODELS
31 Strict Consistency ,Sequential 50 1 BB Discussion
Consistency, Causal Consistency
PAGE-BASED DISTRIBUTED Discussion
32 SHARED MEMORY 50 1 BB
Basic Design – Replication - Granularity
SHARED-VARIABLE DISTRIBUTED
SHARED MEMORY
33 Munin - Release Consistency,Multiple 50 1 BB Discussion
Protocols , Directories, Synchronization
Midway
OBJECT-BASED DISTRIBUTED
34 SHARED MEMORY
Objects ,Linda,Tuple Space
35 COMPARISON 50 1 BB Discussion
UNIT 5: CASE STUDY
Introduction to amoeba - Object and Capabilities - Process Management - Memory management -
Group Communication – FLIP - Amoeba Servers - Introduction to MACH - Process Management -
Memory management - Communication
Case Study 1: Amoeba
36 INTRODUCTION TO AMOEBA 50 1 BB Discussion
History of Amoeba,Research Goals
OBJECTS AND CAPABILITIES IN
AMOEBA
37 50 1 BB Discussion
Capabilities,Object Protection,Standard
Operations
38 PROCESS MANAGEMENT IN 50 1 BB Group discussion
 5
AMOEBA, Processes,Threads
MEMORY MANAGEMENT IN
AMOEBA – Segments, Mapped Discussion
39 50 1 BB
Segments

The FLIP Interface

Operation of the FLIP Layer
40 50 1 BB Group discussion
Locating Put-Ports
FLIP over Wide-Area Networks
THE AMOEBA SERVERS - The Bullet
41 50 1 BB Discussion
Server, The Bullet Server Interface
INTRODUCTION TO MACH Discussion
42 History of Mach ,Goals of Mach 50 1 BB
The Mach Microkernel,
43 Process Management 50 1 BB Discussion
44 Memory management 50 1 BB Discussion
45 Communication 50 1 BB Discussion

Prepared by HOD/MCA

T.K.SIVAKUMAR