Mindmap
Operating Systems

Mind map: operating systems
Inhalt der Mindmap
Operating Systems
Processes
- Process Control Block
- Stack
- Heap
- Text (code)
- Program Counter
- I/O Devices
- File Descriptors
- CPU Status/Registers
- Process State
- Created
- Ready
- Running
- Waiting
- Terminated
- System Queues
- Ready Queue
- I/O Request Queues
- Job Queue
- Types of Scheduling
- Long-Term
- From disk to RAM
- Mid-term
- RAM to disk when waiting
- Short-term
- CPU Scheduling/Dispatch
- Long-Term
- Communication
- Interprocess
- Message Passing
- Direct
- Indirect
- Shared Memory
- Message Passing
- Client-Server
- Sockets
- RPC
- RMI
- Interprocess
- Context Switch
- Parent and Child
- Mapping
- Process to CPU
- Thread to Core
- Parallelism vs Concurrency
- Unix Process Creation/Execution
- Process Control Block
Threads
- Types of Threads
- User Threads
- POSIX
- Win32
- Java
- Kernel Threads
- Linux
- Windows
- User Threads
- Singlethreaded
- Multithreaded
- Models
- Many-to-One
- One-to-One
- Many-to-Many
- Models
- Threading Issues
- Java Thread States
- New
- Runnable
- Blocked
- Dead
- Types of Threads
OS Structures
- OS Services
- Kernel
- Command Interpreters
- Virtual Machines
- I/O
- Synchronous
- Asynchronous
- Interrupts
- Hardware
- Software
- Design and Implementations
- Systems Requirements
- Upfront Design
- Modularity
- Policy Decisions
- Programming Language
- Debugging
- Device Controllers
- Direct Memory Access
- Types of Requests
- User Mode vs Kernel mode
- System Calls
- Program Control
- Status Requests
- I/O Requests
Scheduling
- Algorithrms
- First-Come First-Serve
- Shortest-Job-First
- Round Robin
- Multilevel Feedback Queue
- Priority
- Preemptive vs Non-Preemptive
- Attributes/Criteria
- CPU Utilization
- Throughput
- Waiting Time
- Response Time
- Execution Time
- Performance Techniques
- Gantt Charts
- Simulation
- Implementation
- Dispatcher
- Algorithrms
Synchronization
- Classic Problems
- Bounded Buffer
- Readers-Writers
- Dining Philosophers
- Solutions
- Hardware Level
- Test-and-Set
- Compare-and-Swap
- User Level
- Peterson's Algorithm
- Dekker's Algorithm
- OS Level
- Sempahores
- Language Level
- Monitors
- Hardware Level
- Critical Section
- Requirements
- Mutual Exclusion
- Progress
- Bounded Waiting
- Requirements
- Problems
- Deadlock
- Race Condition
- Starvation
- Locks
- Semaphores
- Monitors
- Test-and-set
- Compare-and-swap
- Mutex
- Java Synchronization
- Atomic Transactions
- Classic Problems
Deadlocks
- Conditions For Deadlock
- Mutual Exclusion
- Hold and Wait
- No Preemption
- Circular Wait
- Resource Allocation Graph
- Types of Edges
- Request
- Assignment
- Claim
- Types of Edges
- Handling Deadlocks
- Prevention
- Avoidance
- Detection and Recovery
- Banker's Algorithm
- Conditions For Deadlock
Protection
- Goals
- Protection Domain
- Static
- Dynamic
- Domain Structure
- Access Matrix
- Implementations
File System
- Interface
- File Concepts
- Access Methods
- Sequential
- Direct
- Disk
- Structure
- Partition
- Volume
- Structure
- Directory
- Single-Level
- Two-Level
- Tree-Structure
- Acyclic Graph
- File Sharing
- File Protection
- Implementation
- Allocation Methods
- Contiguous
- Linked
- Indexed
- Free-Space Management
- Bit Vector
- Linked List
- Efficiency and Performance
- Directory
- Linear List
- Hash Table
- Virtual File System
- Inode
- File
- Superblock
- Dentry
- Allocation Methods
- Interface
Main Memory
- Adressing
- Logical
- Physical
- Swapping
- Fragmentation
- External
- Internal
- Compaction
- Paging
- Methods
- Page Table
- Hardware
- Contiguous Allocation
- Adressing
Virtual Memory
- Paging
- Page Replacement
- Reference Bit
- Dirty Bit
- Algorithms
- FIFO
- OPT
- LRU
- Second Chance
- Page Faults
- Page Replacement
- Thrasing
- Causes
- Frame Allocation
- Global vs Local
- Fixed
- Priority
- Paging
Informationen
- Beschreibung
- Mindmap am Operating Systems, erstellt von David Lee am 09/11/2016.
- Erstellt von
- David Lee
- Aufrufe
- 89
- Tags
- Bewertung