Login with Facebook
Login
Books
NCERT
CBSE
AIEEE
IITJEE
Tamilnadu
BITS MSSS
ANU
IPE
UPSC
Advanced Concepts in Operating Systems
(
2
,
0
,
6
0
)
Share
1
,
0
0
by
Tri Tung Truong
|
link
add note
see all notes
Part - I
1. Over View
23
1.1 Introduction
1.2 Functions of an Operating System
1.3 Design Approaches
1.4 Why Advanced Operating systems
1.5 Types of Advanced Operating Systems
1.6 Ab Overview of the Book
1.7 Summary
1.8 Further Reading
2. Synchronization Mechanisms
2.1 Introduction
2.2 Concept of a process
2.3 Concurrent Processes
2.4 The Critical Section Problem
1
2.5 other Synchronization Problems
2.6 Language Mechanisms for Synchronization
2.7 Axiomatic Verification of Parallel Programs
2.8 Summary
2.9 Further Reading
3. Process Deadlocks
3.1 Introduction
3.2 Preliminaries
3.3 Models of Deadlocks
3.4 Models of Resources
3.5 A Graph Theoretic Model of a System State
3.6 Necessary and Sufficient Conditions for a Deadlock
3.7 Systems with-Single Unit Requests
3.8 Systems with only Consumable Resources
3.9 System with Reusable Resources
3.10 Summary
3.11 Further Reading
4. Architectures of Distributed Systems
4.1 Introduction
4.2 Motivations
4.3 System Architecture Types
4.4 Distributed Architecture Systems
4.5 Issues in Distributed Operating Systems
4.6 Communication Networks
4.7 Communication Primitives
4.8 Summary
4.9 Further Reading
5. Theoretical Foundations
5.1 Introduction
5.2 Inherent Limitations of a Distributed System
5.3 Lamport's Logical Clocks
5.4 Vector clocks
5.5 Casual Ordering of Messages
5.6 Global State
5.7 Cuts of a Distributed Computation
5.8 Termination Detection
5.9 Summary
5.10 Further Reading
6. Distributed Mutual Exclusion
6.1 Introduction
6.2 The Classification of Mutual Exclusive Algorithms
6.3 Preliminaries
6.4 A Simple Solution to Distributed Mutual Exclusion
6.5 Non-Token-Based Algorithms
6.6 Lamport's Algorithm
6.7 The Rickart Agrawala - Algorithm
6.8 Maekawa's Algorithm
6.9 A Generalized Non- Token- Based Algorithm
6.10 Token-Based Algorithm
6.11 Suzuki Kasami's Broadcast Algorithm
6.12 Singhal's Heuristic algorithm
6.13 Raymond's Tree-Based Algorithm
6.14 A Comparative Performance Analysis
6.15 Summary
6.16 Further Reading
7. Distributed Deadlock Detection
7.1 Introduction
7.2 preliminaries
7.3 Deadlock Handling Strategies in Distributed Systems
7.4 Issues in Deadlock Detection and Resolution
7.5 Control organizations for Distributed Distributed Deadlock Detection
7.6 Centralized Deadlock - Detection Algorithms
7.7 Distributed Deadlock Detection Algorithms
7.8 Hierarchal Deadlock Detention Algorithms
7.9 Perspective
7.10 Summary
7.11 Further Reading
8. Agreement Protocols
8.1 Introduction
8.2 The System Model
8.3 A Classification of Agreement Problems
8.4 Solutions to the Byzantine Agreement Problem
8.5 Applications of Agreement Algorithms
8.6 Summary
8.7 Further Reading
Part - III Distributed Resource Management
9. Distributed File Systems
9.1 Introduction
9.2 Architecture
9.3 Mechanisms for Building Distributed File Systems
9.4 Design Issues
9.5 Case Studies
9.6 Log-Structured File Systems
9.7 Summary
9.8 Further Reading
10. Distributed Shared Memory
10.1 Introduction
10.2 Architecture and Motivation
10.3 Algorithms for Implementing DSM
10.4 Memory Coherence
10.5 Coherence protocols
10.6 Design Issues
10.7 Case Studies
10.8 Summary
10.9 Further Reading
11. Distributed Scheduling
11.1 Introduction
11.2 Motivation
11.3 Issues in Load Distributing
11.4 Components of a Load Distributing Algorithm
11.5 Stability
11.6 Local Distributing Algorithms
11.7 Performance Comparison
11.8 Selecting a Suitable Load Sharing Algorithm
11.9 Requirements for Load Distributing
11.10 Load sharing Policies: Case Studies
11.11 Task Migration
11.12 Issues in Task Migration
11.13 Summary
11.14 Further Reading
Part - IV Failure Recovery and Fault Tolerance
12. Recovery
12.1 Introduction
12.2 Basic Concepts
12.3 Classification of Failures
12.4 Backward and Forward Error Recovery
12.5 Backward - Error Recovery; Basic Approaches
12.6 Recovery in Concurrent Systems
12.7 Consistent Set of Check points
12.8 Synchronous Check Point and Recovery
12.9 Asynchronous CheckPointing and Recovery
12.10 Checkpointing for Distributed Database Systems
12.11 Recovery in Replicated Distributed Database Systems
12.12 Summary
12.13 Further Reading
13. Fault Tolerance
13.1Introductions
13.2 Issues
13.3 Atomic Actions and Committing
13.4 Committ Protocols
13.5 NonBlocking Committ Protocols
13.6 Voting Protocols
13.7 Dynamic Voting protocols
13.8 The Majority Based Dynamic Voting Protocol
13.9 Dynamic Vote Reassignment Protocol
13.10 Failure Resilient Program
13.11 Reliable Communication
13.12 Case Studies
13.13 Summary
13.14 Further Reading
14. Resource Security and Protection: Access and Flow Control
14.1 Introduction
14.2 Preliminaries
14.3 The Access Matrix Model
14.4 Implementation of Access Matrix
14.5 Safety in the Access Matrix Model
14.6 Advanced Models of Protection
14.7 Case Studies
14.8 Summary
14.9 Reading
15. Data Security: Cryptography
15.1 Introduction
15.2 A Model of Cryptography
15.3 Conventional Cryptography
15.4 Modern Cryptography
15.5 Private Key Cryptography: Data Encryption Standard
15.6 Public Key Cryptography
15.7 Multiple Encryption
15.8 Authentication in Distributed Systems
15.9 Case Study: The Kerberos System
15.10 Summary
15.11 Further Reading
Part - VI Multiprocessor Operating System
16.Multiprocessor System Architecture
16.1 Introduction
16.2 Motivations for Multiprocessor Systems
16.3 Basic Multiprocessor System Architectures
16.4 Interconnection Networks for Multiprocessor Systems
16.5 Caching
16.6 Hypercube Architectures
16.7 Summary
16.8 Further Reading
17. Multiprocessor Operating Systems
17.1 Introduction
17.2 Structures of Multiprocessors Operating Systems
17.3 Operating System Design Issues
17.4 Threads
17.5 Process Synchronization
17.6 Processor Scheduling
17.7 Memory Management : The Mach Operating System
17.8 Reliability/ Fault Tolerance: The Sequoia System
17.9 Summary
17.10 Further Reading
18. Database Operating Systems
18.1 Introduction
18.2 What is Different?
18.3 Requirements of a Database Operating System
18.4 Further Reading
19. Concurrency Control: Theoretical Aspects
19.1 Introduction
19.2 Database Systems
19.3 A Concurrency Control Model of Database Systems
19.4 The Problem of Concurrency Control
19.5 Serializability Theory
19.6 Distributed Data Base Systems
19.7 Summary
19.8 Further Reading
20. Concurrency Control Algorithms
20.1 Introduction
20.2 Basic Synchronization Primitives
20.3 Lock Based Algorithms
20.4 Timestamp Based Algorithms
20.5 Optimistic Algorithms
20.6 Concurrency Control Algorithms; Data Replication
20.7 Summary
Further Reading
ISBN: 0-07-047268-8
Mukhesh Singal
Niranjan G.Shivaratri
Operating Systems
MSSS
BITS Pilani
become moderator
see all followers
Attachments
see all
Advanced Operating Systems - Second Semester 2009-2010 Mid-Semester Test (EC-1 Regular)
Advanced Operating Systems -Second Semester 2009-2010 Comprehensive Examination (EC-2 Regular)
Advanced Operating Sytems - First Semester 2009-2010 Mid-Semester Test (EC-1 Regular)
Advanced Operating Systems - First Semester 2009-2010 Comprehensive Examination (EC-2 Regular)
Advanced Operating Systems - Second Semester 2008-2009 Mid-Semester Test (EC-1 Regular)
Your Ad Here
,
, 
