CP4001 Advanced Operating System Syllabus:

CP4001 Advanced Operating System Syllabus – Anna University PG Syllabus Regulation 2021

COURSE OBJECTIVES

 To get a comprehensive knowledge of the architecture of distributed systems.
 To understand the deadlock and shared memory issues and their solutions in distributed environments.
 To know the security issues and protection mechanisms for distributed environments.
 To get a knowledge of multiprocessor operating systems and database operating systems.

UNIT I INTRODUCTION

Architectures of Distributed Systems – System Architecture types – issues in distributed operating systems – communication networks – communication primitives. Theoretical Foundations – inherent limitations of a distributed system – lamport’s logical clocks – vector clocks – causal ordering of messages – global state – cuts of a distributed computation – termination detection. Distributed Mutual Exclusion – introduction – the classification of mutual exclusion and associated algorithms – a comparative performance analysis.

UNIT II DISTRIBUTED DEADLOCK DETECTION AND RESOURCE MANAGEMENT

Distributed Deadlock Detection -Introduction – deadlock handling strategies in distributed systems – issues in deadlock detection and resolution – control organizations for distributed deadlock detection – centralized and distributed deadlock detection algorithms –hierarchical deadlock detection algorithms. Agreement protocols – introduction-the system model, a classification of agreement problems, solutions to the Byzantine agreement problem, applications of agreement algorithms. Distributed resource management: introduction-architecture – mechanism for building distributed file systems – design issues – log structured file systems.

UNIT III DISTRIBUTED SHARED MEMORY AND SCHEDULING

Distributed shared memory-Architecture– algorithms for implementing DSM – memory coherence and protocols – design issues. Distributed Scheduling – introduction – issues in load distributing – components of a load distributing algorithm – stability – load distributing algorithms – performance comparison – selecting a suitable load sharing algorithm – requirements for load distributing -task migration and associated issues. Failure Recovery and Fault tolerance: introduction– basic concepts – classification of failures – backward and forward error recovery, backward error recovery- recovery in concurrent systems – consistent set of checkpoints – synchronous and asynchronous checkpointing and recovery – checkpointing for distributed database systems recovery in replicated distributed databases.

UNIT IV DATA SECURITY

Protection and security -preliminaries, the access matrix model and its implementations.-safety in matrix model- advanced models of protection. Data security – cryptography: Model of cryptography, conventional cryptography- modern cryptography, private key cryptography, data encryption standard- public key cryptography – multiple encryption – authentication in distributed systems.

UNIT-V MULTIPROCESSOR AND DATABASE OPERATING SYSTEM

Multiprocessor operating systems – basic multiprocessor system architectures – interconnection networks for multiprocessor systems – caching – hypercube architecture. Multiprocessor Operating System – structures of multiprocessor operating system, operating system design issues- threads process synchronization and scheduling. Database Operating systems :Introduction- requirements of a database operating system Concurrency control : theoretical aspects – introduction, database systems – a concurrency control model of database systems- the problem of concurrency control – serializability theory- distributed database systems, concurrency control algorithms – introduction, basic synchronization primitives, lock based algorithms-timestamp based algorithms, optimistic algorithms – concurrency control algorithms: data replication.

TOTAL: 45 PERIODS

COURSE OUTCOMES:

After the completion of this course, student will be able to
CO1:Understand and explore the working of Theoretical Foundations of OS.
CO2:Analyze the working principles of Distributed Deadlock Detection and resource management
CO3:Understand the concepts of distributed shared memory and scheduling mechanisms
CO4:Understand and analyze the working of Data security
CO5:Apply the learning into multiprocessor system architectures.

REFERENCES:

1. Mukesh Singhal, Niranjan G.Shivaratri, “Advanced concepts in operating systems: Distributed, Database and multiprocessor operating systems”, TMH, 2001
2. Andrew S.Tanenbaum, “Modern operating system”, PHI, 2003
3. Pradeep K.Sinha, “Distributed operating system-Concepts and design”, PHI, 2003.
4. Andrew S.Tanenbaum, “Distributed operating system”, Pearson education, 2003.