Index terms for OER course on Operating Systems
/
A
- Access rights
- Access control list (ACL) (Processes)
- Access control matrix (ACM) (Processes)
- Capability (Processes)
- Discretionary access control (DAC) (Processes)
- File ACL (Processes)
- File ACL drawing (Processes)
- Fundamentals (Processes)
- Mandatory access control (MAC) (Processes)
- Role based access control (RBAC) (Processes)
- Address translation example (Memory I)
- Atomicity
- Authentication (Security)
- Authorization (Security)
- Availability (Security)
B
C
- Caching
- Clock
- Collision resistant hash function (Security)
- Completely fair scheduler (CFS) (Scheduling)
- Concurrency (Threads)
- Confidentiality (Security)
- Context switch
- Convoy problem (MX III)
- Copy-on-write
- Critical section
- Cryptography (Security)
D
- De-Mail (Security)
- Deadlock (MX I)
- Deadlock empire (MX I)
- Deadlock
- Decay usage scheduling (Scheduling)
- Demand loading (Memory I)
- Demand paging (Memory II)
- Design principles for secure systems (Security)
- Digital signature (Security)
- Dynamic-priority scheduling (Scheduling)
E
F
G
- GNU/Linux (Motivation)
- GNU/Linux
- GnuPG (Security)
H
I
- I/O
- Asynchronous I/O (Interrupts)
- Blocking I/O (Interrupts)
- Blocking I/O (Threads)
- I/O latency (Interrupts)
- Interrupt livelock (Interrupts)
- Interrupt processing animation (Interrupts)
- NAPI (Interrupts)
- Non-blocking I/O (Interrupts)
- Non-blocking I/O (Threads)
- Polling processing animation (Interrupts)
- Synchronous I/O (Interrupts)
- Identification (Security)
- Information security (Security)
- Integrity (Security)
- Integrity of message (Security)
- Inter-process communication (Processes)
- Interleaved execution (Threads)
- Interrupt
- Basic explanation (Overview)
- Big picture (Interrupts)
- Definition (Interrupts)
- Handling (Interrupts)
- Interrupt descriptor table (IDT) (Interrupts)
- Interrupt descriptor table register (IDTR) (Interrupts)
- Interrupt handler (Interrupts)
- Interrupt latency (Interrupts)
- Interrupt processing animation (Interrupts)
- Keyboard example (Interrupts)
- Livelock (Interrupts)
- System call (Interrupts)
- Inverted page table (Memory II)
L
M
- Memory management unit (MMU) (Memory I)
- Memory mapped file (Memory I)
- Message integrity (Security)
- Monitor
- Multitasking (Introduction)
- Multitasking
- Mutex
- Mutual exclusion
O
P
- Page replacement
- Page table
- Page
- Paging (Memory I)
- Paging area (Memory I)
- Parallelism (Threads)
- Persistence (Memory I)
- Persistence (Processes)
- Polling
- Preemption (Scheduling)
- Preemption
- Prepaging (Memory II)
- Principle of locality (Memory I)
- Priority (Scheduling)
- Priority ceiling (MX III)
- Priority inheritance (MX III)
- Priority inversion
- Privilege level (Interrupts)
- Privilege level (Introduction)
- Process control block (Processes)
- Process
- Producer/consumer problems (MX I)
- Proportional-share scheduling (Scheduling)
R
S
- Safety (Security)
- Scheduling (Introduction)
- Scheduling
- Basic explanation (Overview)
- Completely fair (Scheduling)
- Decay usage (Scheduling)
- Definition (Scheduling)
- Drawing (Scheduling)
- Dynamic-priority (Scheduling)
- FIFO (Scheduling)
- Fixed-priority (Scheduling)
- Preemption (Scheduling)
- Proportional-share (Scheduling)
- Round robin (Scheduling)
- Weighted fair queuing (Scheduling)
- Weighted round robin (Scheduling)
- When to schedule (Scheduling)
- Security goals (Security)
- Semaphore
- Shared memory (Memory I)
- Spinlock
- Stack
- Starvation (Interrupts)
- Starvation (MX I)
- Starvation (Scheduling)
- Starvation
- Swap area (Memory I)
- Swapping (Memory II)
- System call
T
- Thrashing (Memory II)
- Thread control block (TCB) (Threads)
- Thread states
- Thread
- Threads
- Time slice (Scheduling)
- Time slicing
- Translation lookaside buffer (TLB) (Memory II)