Download 1. Pradeep K Sinha - Distributed Operating System: Concepts and

1
FACULTY OF SCIENCE AND HUMANITIES
Course Code
Course Title
Semester
Course Time
:
:
:
:
DEPARTMENT OF COMPUTER APPLICATIONS
LESSON PLAN(CICP)
MC13E21
Distributed Operating System
V
Dec – Mar 2015
Day
Hour
4
1,3
5
I
III
V
Location
Timing
11:45 AM – 12: 35 PM
09:00 AM – 09:50, 10:55 AM – 11: 45 AM
01:50 PM – 02:40 PM
: Tech Park - Ground Floor
Faculty Details
Sec.
1
Name
Office
Office hour
Mail id
T.K.SIVAKUMAR
Tech Park –
Ground Floor
Lab
9.00 AM to 3.35 PM
[email protected]
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
Surprise Test
Model Exam
:
:
:
10 Marks
05 Marks
20 Marks
2
2 Assignments
Attendance
Total
Test Schedule
S.No.
1
2
:
:
10 Marks
05 Marks
:
50 Marks
DATE
21-Jan-2015
18-Mar- 2015
TEST
Cycle Test
Model
TOPICS
I, II Units
All five Units
DURATION
2 Periods
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
on
No.
1
2
3
4
Topics to be covered
Introduction to Distributed Systems
WHAT IS A DISTRIBUTED SYSTEM?
GOALS
Advantages of Distributed Systems over
Centralized Systems
Advantages of Distributed Systems over
Independent PCs
Disadvantages of Distributed Systems
HARDWARE CONCEPTS
Bus-Based Multiprocessors
Switched Multiprocessors
Bus-Based Multicomputers
Switched Multicomputers
SOFTWARE CONCEPTS
Network Operating Systems
True Distributed Systems
Multiprocessor Timesharing Systems
Time
(min)
Ref
Teaching
Method
50
1
BB
50
1
BB
50
1
BB
50
1
BB
Testing Method
Discussion
Discussion
Group discussion
Discussion
3
DESIGN ISSUES
Transparency,Flexibility,Reliability,
Performance, Scalability
layered protocols
5
6
7
ATM Networks
client server model
8
Remote Procedure calls
9
10
Group Communication
Comparative Study
50
1
BB
50
1
BB
Discussion
50
1
BB
50
1
BB
Comparative Study
Group discussion
50
1
BB
Comparative Study
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
12
13
14
15
16
mutual exclusion
Election algorithms
Atomic transactions - Transaction
Implementation and Concurrency control
Deadlocks
50
50
50
50
50
1
1
1
1
1
BB
BB
BB
BB
BB
Discussion
Assignment
Group discussion
Discussion
Discussion
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
17
18
19
20
THREADS-Thread Usage,Design Issues
for Threads Packages, Implementing a
Threads Package
SYSTEM MODELS - The Workstation
Model ,Using Idle Workstations The
Processor Pool Model, A Hybrid Model
PROCESSOR ALLOCATIONAllocation Models, Design Issues for
Processor Allocation Algorithms,
Implementation Issues for Processor
Allocation Algorithms, Example
Processor Allocation Algorithms
Group discussion
50
1
BB
50
1
BB
50
1
BB
50
1
BB
Discussion
Discussion
Assignment
21
A Graph-Theoretic Deterministic
50
1
BB
Group Discussion
22
Algorithm
A Centralized Algorithm
A Hierarchical Algorithm
50
1
BB
Discussion
4
23
Use of redundancy
50
1
BB
Discussion
24
Real time distributed systems
50
1
BB
Discussion
50
1
BB
Discussion
25
Real time Scheduling and communication
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
COMPARISON
35
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
39
40
41
42
43
44
45
AMOEBA, Processes,Threads
MEMORY MANAGEMENT IN
AMOEBA – Segments, Mapped
Segments
The FLIP Interface
Operation of the FLIP Layer
Locating Put-Ports
FLIP over Wide-Area Networks
THE AMOEBA SERVERS - The Bullet
Server, The Bullet Server Interface
INTRODUCTION TO MACH
History of Mach ,Goals of Mach
The Mach Microkernel,
Process Management
Memory management
Communication
Prepared by
T.K.SIVAKUMAR
Discussion
50
1
BB
50
1
BB
Group discussion
50
1
BB
Discussion
Discussion
50
1
BB
50
50
50
1
1
1
BB
BB
BB
Discussion
Discussion
Discussion
HOD/MCA