Republic of the Philippines
ISABELA STATE UNIVERSITY
Echague, Isabela
Institute of Information and Communication Technology
COURSE NUMBER : MIT 101
COURSE TITLE : Advanced Operating Systems and Networking
DEPARTMENT/PROGRAM : MS Information Technology
SCHOOL : ISU – ECHAGUE CAMPUS
SEMESTER AND SCHOOL YEAR : First Semester, SY 2017 – 2018
INSTRUCTOR : RICARDO Q. CAMUNGAO
COURSE DESCRIPTION
.
COURSE OBJECTIVES
COURSE OUTLINE AND TIMEFRAME
CHAPTERS TOPICS AND READINGS DATE
Statement of the Vision, Mission of the University, Week 1 & 2
Goals and Objectives of the Institute of
Information and Communication Technology
CHAPTER I Evolution of Operating Systems
Characteristics of Typical Operating Systems
Different Views of Operating systems
Design and Implementation of Operating Systems
Week 3, 4 & 5
CHAPTER II Functions of Operating Systems
Design Approaches
Types of Advanced Operating Systems
Synchronization Mechanisms
Concept of a Process
The Critical Section Problems and Other
Synchronization Problems
Language Mechanisms for Synchronization
Process Deadlocks
Preliminaries
Models of Deadlocks, Resources and System State
Necessary and Sufficient Condition for a Deadlock
System with Single – Unit Requests, Consumable
Resources and Reusable Resources
Week 6 and 7
CHAPTER III Communication Primitives
Inherent Limitations
Lampert’s Logical Clock; Evtor Clock; Causal
ordering; Global State; Cuts; Termination
Detection and Distributed Mutual Exclusion
Non – Token-Based Algorithm
Suzuki – Kasumi’s Broadcast Algorithm
Distributed Deadlock Detection
Centralized Deadlock – Detection Algorithm
Distributed Deadlock – Detection Algorithm
CHAPTER IV Distributed File System Week 8 and 9
Architecture
Mechanisms
Design Issues
Distributed Shared Memory
Protocols
Design Issues of Distributed Scheduling
Components Algorithms
CHAPTER V Basic Concepts of Classification of Failures Week 10, 11 and 12
Basic Approaches to Recovery
Recovery in Concurrent Systems
Synchronous and Asynchronous Check –
Pointing Recovery
Check – Pointing Recovery in Distributed
Systems
Fault Tolerance
Issues
Two – Phase and Non – Blocking Commit
Protocols
Voting Protocols
Dynamic Voting Protocols
CHAPTER VI Structures Week 13 and 14
Design Issues
Threads
Process Synchronization
Process Scheduling
Memory Management
Reliability/Fault Tolerance; Database Operating
System
Concurrency Control
Distributed Database system
Concurrency Control Algorithm
Course Requirement Week 15, 16 and 17
INSTRUCTIONAL MATERIALS NEEDED
Whiteboard /Board Marker
LCD Projector/LCD Screen
Hands out for the students
Compilation of assessment task (case analysis)
Powerpoint presentations
REFERENCES/READING MATERIALS
Distributed operating Systems Concepts & Design – Pradeep K Sinha
Distributed Operating Systems- Andrew S Tanenbaum, Tata McGraw Hill
Modern Operating Systems – Andrew S Tanenbaum, Pearson
Operating System principles=Abraham Silberschanz, Peter B Galvin, Greg Gagne, Wiley Asia
SUBJECT REQUIREMENT
Student should at least incur 75% of the total number of items in every evaluative measures (quizzes, seat
works, assignment, recitation, major exam etc.)
Minimum of 80% attendance of the total contact hours in the subject is required (checking is done every
meeting)
Failure to attend regular classes after taking the prelim exam means of grade of 5.0 in the subject
CONSULTATION HOURS
Prepared by
RICARDO Q. CAMUNGAO, DIT
Subject Instructor
Noted by:
IRMA T. PLATA, DIT
Associate Dean
