Please enable JavaScript.
Coggle requires JavaScript to display documents.
Operativsystemer 2 (Multicore and multi-processors (Scheduling (Load…
Operativsystemer 2
Multicore and multi-processors
UMA (uniform memory process)
NUMA (non-uniform memory access)
Multi CPU OS implementations
Synchronization
Scheduling
Load sharing
Gang scheduling
Dedicated processor assignment
Dynamic scheduling
Intercommunication
Message passing
Process distribution
Processes
Process Control
CPU modes of execution
User mode
Privileged kernel mode
Process Interruption
Interrupt
Trap
Supervisor call
Process Switching
Clock interrupt
Memory fault
I/O interrupt
Scheduling
Scheduling algorithms in batch systems
First-come first-served
Shortest job first
Shortest remaining time next
Scheduling algorithms in interactive systems
Round-robin scheduling
Priority scheduling
Shortest process next
Guaranteed scheduling
Lottery scheduling
Scheduling algorithms in real time systems
Rate monotonic scheduling (RMS)
Threads
Relationship between threads and processes
Types of threads
User-level threads (ULT)
Kernel-level thread
Combined ULT-KLT
Multicore and multithreading
Concurrency
Key terms in concurrency
Atomic operation
Critical section
Mutual exclusion
Livelock
Race condition
Starvation
Deadlock
Deadlocks
Mutual exclusion
Hold and wait
No preemption
Circular wait
Methods for handling deadlocks
Deadlock prevention
Deadlock avoidance
Bankier
Deadlock detection
Starvation
Mutual exclusion
Interrupt disabling
Special machine instruction
Process synchronization
Sephamores
Monitors
Message passing
Memory management
Memory partitioning
Fragmentation
Internal fragmentation
External fragmentation
Addressing
Memory management
Techniques
Virtual memory
Page replacement algorithms
Nor recently used (NRU)
First-in, first-out (FIFO)
Last recently used (LRU)
WS-Clock
UM-Clock