Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

1.1: What is an operating system?
1.2 History of Operating Systems
1.3.1: Processes
1.3.2: Files
1.3.3: System Calls
1.4.1: Monolithic approach
1.4.2: Layered Systems
1.4.3: Virtual machines
1.4.4: Client Server
2.1.3: Implementation of Processes
2.2.1: Race Conditions
2.2.2: Critical sections
2.2.3 Mutual exclusion with busy waiting
2.4: Process Scheduling
3.1.2: Multiprogramming and Memory Usage
3.1.3: Multiprogramming with fixed partitions
3.2.1: Multiprogramming with variable partitions
3.3.2: Page tables
3.3.4: Associative memory (TLBs)
3.3.5: Inverted page tables
3.4.1: The optimal page replacement algorithm (opt PRA) (aka Belady's min PRA)
3.4.2: The not recently used (NRU) PRA
3.4.3: FIFO PRA
3.4.4: Second chance PRA
3.4.5: Clock PRA
3.4.6: Least Recently Used (LRU) PRA
3.4.7: Approximating LRU in Software
3.5.1: Belady's anomaly
3.6.1 & 3.6.2: The Working Set Model and Local vs. Global Policies
3.6.3: Page size
3.6.4: Implementation Issues
3.7: Segmentation
4.1.1: File Naming
4.1.2: File structure
4.1.3: File types
4.1.4: File access
4.1.5: File attributes
4.1.6: File operations
4.1.7: Memory mapped files
4.2.1: Hierarchical directory systems
4.2.2: Path Names
4.3.1; Implementing Files
4.3.2; Implementing Directories
4.3.3: Shared files (links)
4.3.4: Disk space management
4.3.6 File System Performance
4.4.1: Security environment
4.4.2: Famous flaws
4.4.3: The internet worm
4.4.4: Generic Security attacks
4.4.5: Design principles for security
4.4.6: User authentication
4.5.1: Protection domains
4.5.2: Access Control Lists (ACLs)
4.5.3: Capabilities
4.5.4: Protection models
4.5.5: Covert channels
5.1.1: I/O Devices
5.1.2: Device Controllers
5.1.3: Direct Memory Access (DMA)
5.2.1: Goals of the I/O Software
5.2.2: Interrupt Handlers
5.2.3: Device Drivers
5.2.4: Device-Independent I/O Software
5.2.5: User-Space Software
5.3.1: Disk Hardware
5.3.2: Disk Arm Scheduling Algorithms
5.3.3: Error Handling
5.3.4: Track Caching
5.3.5: Ram Disks
5.4.1: Clock Hardware
5.4.2: Clock Software
5.5.1: Terminal Hardware
5.5.2: Memory-Mapped Terminals
5.5.3: Input Software
5.5.4: Output Software
6.1: Resources:
6.2.1: (Necessary) Conditions for Deadlock
6.2.2: Deadlock Modeling
6.3: Ignoring the problem--The Ostrich Algorithm
6.4.1: Detecting Deadlocks with single unit resources
6.4.2: Detecting Deadlocks with multiple unit resources
6.4.3: Recovery from deadlock
6.6.1: Attacking Mutual Exclusion
6.6.2: Attacking Hold and Wait
6.6.3: Attacking No Preempt
6.6.4: Attacking Circular Wait
6.7.1: Two-phase locking
6.7.2: Non-resource deadlocks
6.7.3: Starvation
0 of .
Results for:
No results containing your search query
P. 1
Class Note in O.S

Class Note in O.S

Ratings: (0)|Views: 5,371|Likes:

More info:

Published by: Bhong Macalisang Formon, Jr. on Mar 02, 2011
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as DOC, PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 4 to 85 are not shown in this preview.
You're Reading a Free Preview
Pages 90 to 104 are not shown in this preview.
You're Reading a Free Preview
Pages 108 to 128 are not shown in this preview.

Activity (28)

You've already reviewed this. Edit your review.
1 hundred reads
1 thousand reads
Sanaa Kaddoura liked this
ZVYAGEL liked this
Ruby Bhatt liked this
Sweta Gupta liked this
Tan Weer liked this
Jon Watt liked this
Patrick Omondi liked this
sanrash11 liked this

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->