MC4004 Advances in Operating Systems Syllabus:

MC4004 Advances in Operating Systems Syllabus – Anna University PG Syllabus Regulation 2021

COURSE OBJECTIVES:

 To review the fundamentals of Operating Systems
 To gain knowledge on Distributed Operating System concepts that includes issues, Mutual exclusion algorithms, Deadlock detection algorithms
 To gain insight on the distributed resource management components viz. the algorithms for implementation of distributed shared memory, and distributed scheduling.
 To know the components and management aspects of Real time, Mobile operating systems
 To acquire knowledge on the basics of Linux and Mobile OS like iOS, Android

UNIT I FUNDAMENTALS OF OPERATING SYSTEMS

Overview – Synchronization Mechanisms – Processes and Threads – Process Scheduling – Models of Resources – Deadlocks: Detection, Prevention and Recovery

UNIT II DISTRIBUTED OPERATING SYSTEMS

Issues in Distributed Operating System – Communication Primitives – Lamport’s Logical clocks – Causal Ordering of Messages – Distributed Mutual Exclusion Algorithms – Centralized and Distributed Deadlock Detection Algorithms

UNIT III DISTRIBUTED RESOURCE MANAGEMENT

Distributed File Systems – Design Issues – Distributed Shared Memory – Algorithms for Implementing Distributed Shared Memory – Distributed Scheduling – Issues in Load Distributing – Load Distributing Algorithms

UNIT IV REAL TIME AND MOBILE OPERATING SYSTEMS

Basic Model of Real Time Systems – Characteristics- Applications of Real Time Systems – Real Time Task Scheduling – Handling Resource Sharing – Mobile Operating Systems – Microkernel Design – Client Server Resource Access – Processes and Threads – Memory Management – File system.

UNIT V CASE STUDIES

Linux System: Design Principles – Kernel Modules – Process Management – Scheduling – Memory Management – Input Output Management – File System – Interprocess Communication. iOS and Android: Architecture and SDK Framework – Media Layer – Services Layer – Core OS Layer – File System.

TOTAL: 45 PERIODS

SUGGESTED ACTIVITIES:

1. Consider the following preemption method to prevent deadlocks: All processes are assigned unique priorities that can be totally ordered. A requesting process is allowed to preempt another process that holds the needed resource only if the requesting process has higher priority, otherwise, it is blocked. Demonstrate that this method prevents deadlock.
2. Consider a distributed system where each node has its own clock. Assume that all the clocks in the system are perfectly synchronized. Also, assume that the communication network is reliable. Give an algorithm for recording the global state. Note that your algorithm should be simpler than the Chandy- Lamport algorithm.
3. Predict the performance of the receiver-initiated load sharing algorithm when the entire system workload is generated at only a few nodes in the system instead of equally at all the nodes in the system. (Hint : performance depends on how successful receivers will be in locating senders)
4. Consider two processes, P1 and P2, where p1 = 50, t1 = 25, p2 = 75, and t2 = 30.
a. Can these two processes be scheduled using Rate-Monotonic Scheduling?
Illustrate your answer by displaying a Gantt chart
b. Implement the scheduling of these two processes using Earliest Deadline-First (EDF) scheduling.
5. Developers David and Peter of R & D belong to group A. Administrative staff Jack and Mike belong to group B.
a. Create a shared directory “/ project_a”. The files in this directory can only be read, added, deleted, modified, and executed by developers in the R & D department. Other users cannot perform any access operation in this directory.
b. Create a directory “/ project_b”. The files in this directory can only be read, added, deleted, modified and executed by the staff of the Administration Department, other users cannot do anything to this directory Access operation.
c. Create a directory “/ project”. The files in this directory can be read, added, deleted, modified, and executed by personnel in the R & D department and administrative department. Users in other departments can only use this directory and perform read-only access operations.

TOTAL: 45 PERIODS

COURSE OUTCOMES:

Upon Completion of the course, students should be able to:
CO1: Discuss various synchronization, scheduling and deadlock issues
CO2: Demonstrate mutual exclusion and deadlock detection of Distributed Operating system
CO3: Discuss various resource management techniques for distributed systems
CO4: Identify the different features of real time and mobile operating systems
CO5: Perform administrative tasks on Linux Servers, iOS and Android

REFERENCES

1. Mukesh Singhal, Niranjan G. Shivaratri, “Advanced Concepts in Operating Systems – Distributed, Database, and Multiprocessor Operating Systems”, Tata McGraw-Hill, First Edition, 1994.
2. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System Concepts Essentials”, Ninth Edition, John Wiley & Sons, 2013.
3. Love Robert,” Linux Kernel Development”, Pearson Education India, Third Edition, 2018.
4. Neil Smyth, “iOS 12 App Development Essentials”, Payload media, 2018.
5. Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India, First Edition 2006.