Course Course Course L T P C

18CSE356T DISTRIBUTED OPERATING SYSTEMS E Professional Elective

Code Name Category 3 0 0 3

Pre-requisite Co-requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale (CLR): The purpose of learning this course is to: Learning Program Learning Outcomes (PLO)
CLR-1 : To recognize the essential concepts of distributed system. 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : To comprehend about the communication that takes place in Distributed systems

Environment & Sustainability

Analysis, Design, Research
CLR-3 : To realize the necessity of synchronization, consistency and Fault tolerance in a Distributed System.

Level of Thinking (Bloom)

Expected Proficiency (%)

Expected Attainment (%)

Individual & Team Work

Engineering Knowledge
CLR-4 : To value the Process management, File systems, Shared memory

Design & Development

Project Mgt. & Finance

Modern Tool Usage
CLR-5 : To acquire apparent scheme regarding distributed object-oriented based systems

Life Long Learning

Society & Culture
Problem Analysis

Communication

PSO – 3
PSO - 1

PSO - 2
Course Learning Outcomes (CLO): At the end of this course, learners will be able to:

Ethics
CLO-1 : Characterize the fundamental hardware and software concepts of distributed systems. 3 80 70 H M M H H M - - H M - H - - -
CLO-2 : Categorize layered protocols and comprehend the communications in distributed systems 3 85 75 H M H M H M - - H M - H - - -
CLO-3 : Implement synchronization of distributed systems using various algorithms. 3 75 70 H H H H H M - - H M - H - - -
CLO-4 : Demonstrate process scheduling and fault tolerance of distributed systems. 3 85 80 H H H H H M - - H M - H - - -
CLO-5 : Evaluate various Distributed Object-Oriented based systems. 3 85 75 H H H M H M - - H M - H - - -

Duration (hour) 9 9 9 9 9
Synchronization in Distributed Systems- Processes and Processors in Distributed
SLO-1 Introduction- Distributed Systems Distributed Shared memory - Introduction
Fundamentals of Clock Synchronization Operating Systems - Threads
S-1 Goals of Distributed Systems Fundamentals of Communication systems
SLO-2 Logical clock, Physical clock Design issues of Threads package Bus-Based Multiprocessors
SLO-2 Work Station Model Switched Multiprocessors
Hardware Concepts- Bus-based
S-2 SLO-1 Layered Protocols Algorithms for Clock synchronization System Model - Introduction Ring-based Multiprocessors
Multiprocessors
SLO-1 Numa Multiprocessors
S-3 ATM networks Mutual Exclusion-Centralized Algorithm Using Idle Work Stations
SLO-2 Switched Multiprocessors Comparison of Shared Memory Systems
Processor Pool Model, Hybrid Model Consistency Models – Strict Consistency,
SLO-1 Client Server model - Blocking Primitives Distributed Algorithm
Casual Consistency, PRAM Consistency
S-4 Bus-based Multicomputers
Weak Consistency, Release Consistency,
SLO-2 Non-Blocking Primitives Token Ring Algorithm Processor Allocation – Allocation Model
Entry Consistency
Design issues for processor Allocation Page Based Distributed Shared Memory –
SLO-1 Buffered Primitives Comparison of all three algorithms
Algorithms Replication, granularity
S-5 Switched Multicomputers
Importance of Election Algorithm Example of processor Allocation
SLO-2 Unbuffered Primitives Finding the Owner,Finding the Copies
Algorithms
SLO-1 Software Concepts-Network Operating Reliable primitives Bully Algorithm Scheduling in Distributed Systems Page Replacement
S-6
SLO-2 System Unreliable primitives Ring Algorithm Load Balancing and Sharing Approach Synchronization
Atomic Transaction- Introduction Shared – Variable Distributed Shared
SLO-1 Message passing and its related issues Fault Tolerance-Component Faults
True Distributed Systems memory
S-7
Transaction Model, Concurrency Control Object Based Distributed Shared memory
SLO-2 System Failures
– DOO Architecture
Multiprocessors Timesharing Systems Remote Procedure Call and its related Synchronous versus Asynchronous
S-8 SLO-1 Deadlock in Distributed Systems Distributed Object-Oriented Process
issues Systems
 Fault tolerance Using Active Replication,
SLO-2 Distributed Deadlock Detection Distributed Object-oriented Communication
Primary-backup
SLO-1 Real Time Distributed Systems-
Case Study - Amoeba
Distributed Deadlock Prevention Communication
S-9 Design Issues-Distributed Systems Case Studies: SUN RPC, DEC RPC
SLO-2
Real Time Scheduling Mach-OS, Chorus

3. Mukesh Singhal, Niranjan G Shivratri ―Advanced concepts in Operating Systems ―, Mc Graw Hill
1. Andrew S. Tanenbaum, ―Distributed Operating Systems ―PearsonEducation, 2011.
Learning International 2011.
2. Pradeep K. Sinha ―DistributedOperatingSystems Concepts and Design ―PHI 2012.
Resources 4. http://www.seas.gwu.edu/~jstanton/courses/cs251/
5.http://cse.yeditepe.edu.tr/~sbaydere/courses new/cse532/

Learning Assessment
Continuous Learning Assessment (50% weightage)
Bloom’s Final Examination (50% weightage)
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)#
Level of Thinking
Theory Practice Theory Practice Theory Practice Theory Practice Theory Practice
Remember
Level 1 40% - 30% - 30% - 30% - 30% -
Understand
Apply -
Level 2 40% - 40% 40% - 40% - 40% -
Analyze
Evaluate -
Level 3 20% - 30% 30% - 30% - 30% -
Create
Total 100 % 100 % 100 % 100 % -
# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
JP Vinjamoori, Director, Pavartha Software Pvt.Ltd, Mrs. S. Aruna, Dr.G. Maragatham, Mrs. A.
Dr. E.Sivasankar,NIT,Trichy
[email protected] Jackulin Mahriba, SRMIST