FOR FREE CONTENT
- Introduction: OS
- Booting Process
- Command Interpreter
- Dual mode of operation
- System Calls
- Difference between system call and library call
- Interrupt and Trap
- Introduction
- Scheduling Criteria, Terms and Concepts
- Different Type Scheduling Algorithms
- Longest Job First
- Longest Remaining Time First
- Highest Response Ratio Next (HRRN)
- Priority Scheduling
- Least Completed Next (LCN) Scheduling
- Multi-Level Queue Scheduling
- Multilevel Feedback Queue Scheduling
- Guaranteed Scheduling
- Fair Share Scheduling
- Lottery Scheduling
- Multi-Processor Scheduling
- Deadline Scheduling
- Rate-Monotonic Scheduling
- POSIX Real-Time Scheduling
- Priority Inversion
- Proportional Share Scheduling
- Comparison table of Scheduling Algorithm
- Algorithm Evaluation for Scheduling
- Important concept of MM
- Memory Representation as Address
- Memory layout for a Process
- Logical and Physical Address Space
- Necessity of Memory Management
- Introduction
- Concept of Non-contiguous memory allocation
- Basic concept of Paging
- Address Translation
- Process of Paging Method
- Calculation of Offset for paging
- Calculation of Logical Address Bit and number of Pages
- Calculation of Physical Address Bit and number of Frames
- Calculation of Page Table Size
- Organization of MMU
- Why Page size power of 2
- Paging Address Calculation: example1
- Paging Numeric Problem: Example2
- Paging Address Calculation: Example3
- Paging Address Calculation: Question1
- Some Important Question 2
- Paging Address Translation: Question3
- UGC NET Paging Question
- GATE Paging Question
- Number of information at Page Entry
- Exams Question on Page Entry Information
- Exam Question: Page Entry Information
- Calculates Page Table Entry Size
- Calculates Page Size
- Calculation of Optimal Page Size
- Question on Optimal Page Size
- Hashed Page Table with Example
- Inverted Page Table with Gate Question
- Question on Inverted Page Table
- Multi-Level Paging
- Multi-level paging: Example1
- Multi-level paging: Example2
- Allocation of Frames
- Subject Mock
CPU Scheduling (Short term scheduling)
Introduction:
Process Operations:
- i) Essential resources are required for stopping the execution of the process, and then some resource utilities are used.
- ii) When a program is loaded in main memory, resources are allocated and the CPU, schedule all the processes.
- iii) Create process (resource allocation)
- iv) Process scheduling (CPU)
- v) Execution (CPU)
- vi) Blocked (I/O)
- vii) Resume
- viii) Suspended
CPU Scheduling
CPU scheduling is performed by the short time scheduler and at the period of ready to running state.
When a process moves from
i) Run - Termination
Run - Wait
Run - Ready
ii) New - Ready i.e. when a process is created
iii) Wait - Ready
Goal of CPU scheduling (Short Term Scheduling)
(i) Maximize the CPU utilization and throughput.
(ii) Minimized the waiting time, turnaround time, and response time of a process.
(iii) Maximize the CPU and I/O utilization.
