Please enable JavaScript.
Coggle requires JavaScript to display documents.
os chapter 2 - Coggle Diagram
os chapter 2
Scheduling Algorithm
FIFO
First process run first
SJF
Shortest burst time first
Round Robbin
Depends on Quantum
Priority
Shortest Priority first but in gantt chart,write it burst time
Process Scheduling Algorithm
AWT
Starting time-Arrival time
ATAT
Finished time- Arrival time
ART
First response- Arrival time
Memory Hierarchy
L3 cache
Memory
Disk
Separates computer storage into a hierarchy based on response time Small size=more expensive
Strategies
Replacement
Placement
First fit
Best fit
Worst fit
Fetch
Deadlock
Methods for Handling Deadlock
Prevention/Avoidance
Detection/Correction
Ignorance
Condition
Mutual Exclusion
Hold and Wait
Circular wait
No preemption
Swapping Technique
Swap-in
Main memory to secondary memory
Swap-out
Secondary memory to main memory
Threads
Characteristics of process
Need space in main memory where it resides during execution
Passes through various states (such as running, waiting, ready)from early arrival to complete in computer.
Partition
Divides the available space into partitions
Paging
Same with segmentation but a program is broken into fixed-length pages.
Segmentation
Memory is divided into the variable size parts.