AC 17 (05) COURSE PLAN - THEORY CORE 1. CLASS : M.E.

CSE : CS9222 : ADVANCED OPERATING SYSTEMS

: PG

2. COURSE CODE 3. COURSE TITLE 4. COURSE STATUS 5. SEMESTER 6. FACULTY

: II : Dr B.Surendiran

7. COURSE DESCRIPTION To teach the basic concepts, phases and types of various operation systems along with several representations, specification and Phase management. 8. PREREQUISITE Basic knowledge is required about operating system concepts. 9. LEARNING OBJECTIVES At the end of the course the students would Be able to learn basic concepts, phases and types of various operating systems along with several representations, specification and mechanisms. Learn the role of distributed operating systems and the essential services needed for the distributed systems through various algorithms. Learn the distributed file systems concepts though various distributed file management, scheduling algorithms, fault tolerant and failure recovery methods. Learn concepts of Synchronization and concurrency controlling algorithms for distributed and database operating systems. ASSIGNMENTS

10. SESSION PLAN UNIT HOURS TOPICS Overview - Functions of an Operating System , Design 1-2 Approaches, Types of Advanced Operating System Synchronization Mechanisms Concept of a Process, 3-4 Concurrent Processes , The Critical Section Problem Other Synchronization Problems, Language Mechanisms 5-6 for Synchronization, Axiomatic Verification of Parallel Programs Process Deadlocks - Preliminaries ,Models of Deadlocks, 7-8 Resources, System State. Necessary and Sufficient conditions for a Deadlock 9 Systems with Single-Unit Requests, Consumable Resources, Reusable Resources I -Introduction

Assignment 1

10
II- DISTRIBUTED OPERATING SYSTEMS 11

Review of Unit-I Introduction Issues , Communication Primitives. Inherent Limitations- Lamports Logical Clock; Vector Clock; Causal Ordering; Global State; Cuts; Termination Detection. Distributed Mutual Exclusion Non-Token-Based Algorithms ,Lamports Algorithm, Token-Based Algorithms, Suzuki-Kasamis Broadcast Algorithm. Distributed Deadlock Detection Issues , Centralized Deadlock-Detection Algorithms, Distributed DeadlockDetection Algorithms Agreement Protocols Classification - Solutions Applications Review of UNIT II Distributed File systems -Architecture ,Mechanisms, Design Issues Distributed Shared Memory Architecture , Algorithm ,Protocols , Design Issues. Distributed Scheduling Issues, Components, Algorithms CASE Study* Review of unit III Basic Concepts, Classification of Failures, Basic Approaches to Recovery, Recovery in Concurrent System Synchronous and Asynchronous Check pointing and Recovery. Check pointing in Distributed Database Systems; Fault Tolerance; Issues Two-phase and Non-blocking Commit Protocols Voting Protocols, Dynamic Voting Protocols, Case Study* Review Multiprocessor OS Structures, Design Issues , Threads Process Synchronization Processor Scheduling , Memory Management,

12-13

14-16

17-18 19 20

IV- FAILURE RECOVERY AND FAULT TOLERANCE III -DISTRIBUTED RESOURCE MANAGEMENT

21-23 24-26 27-29

30

31-32

Assignment 2

33-35

36-37 38-39

40

41-42 43-45

46-47 48-49

Reliability, Fault Tolerance Database Operating Systems - Introduction, Concurrency Control Distributed Database Systems, Concurrency Control Algorithms.

V- MULTIPROCESSOR AND DATABASE OPERATING SYSTEMS

50

Review of Unit V & University question papers revision

Students are expected to come prepared for each class after revising the previous class topics as the knowledge of fundamental chapters is needed. Since the topics require a good deal of advanced operating system concepts, students are advised to attend all classes without fail. No repetition of topics for absentee students will be entertained. * - portions outside the syllabus.

11. TEST TOPICS S.No 1 2 3 4 5 Test Internal Examination-I Internal Examination-II Internal Examination-III Internal ExaminationIV Internal Examination-V TOPIC Unit I Unit II Unit III Unit IV, Unit V Complete syllabus

All tests are compulsory and absenteeism in any test will lead to reduction of internal marks.

12. EVALUATION COMPONENTS S.No.

1 2 3

COMPONENT
Tests Attendance University examination (Conducted for 100 Marks)

MARKS
15 5 ** 80

TOTAL

100

Attendance % >95.5 >90.5 and <95.5 >85.5 and <90.5 >80.5 and <85.5 >75 and <80.5 <75

Marks 5 4 3 2 1 0

13. a) TEXT BOOK : 1. Mukesh Singhal and N. G. Shivaratri, Advanced Concepts in Operating Systems, McGrawHill, 2000. b) REFERENCE BOOKS 1. Abraham Silberschatz, Peter B. Galvin, G. Gagne, Operating System Concepts, Sixth Edition, Addison Wesley Publishing Co., 2003. 2. Andrew S. Tanenbaum, Modern Operating Systems, Second Edition, Addison Wesley, 2001. c) WEBSITES 1. http://www.annaunivonline.com/qbank/cse.html 2. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/Operating %20Systems/New_index1.html

(Dr.B.Surendiran) Staff In charge

HoD

Secretary