FOR FREE YEAR SOLVED
- 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
Process Context
The process context consists of the following:
1. Address space of the process: The code, data, and stack components of the process (See Fig: 8)
2. Memory allocation information: Information concerning memory areas allocated to a process. This information is used by the memory management unit (MMU) during the operation of the process.
3. Status of file processing activities: Information about files being used, such as current positions in the files.
4. Process interaction information: Information necessary to control the interaction of the process with other processes, e.g., ids of parent and child processes, and inter-process messages sent to it that have not yet been delivered to it.
5. Resource information: Information concerning resources allocated to the process.
6. Miscellaneous information: Miscellaneous information needed for the operation of a process.
Difference Between Process Context and Process Control Block:
The kernel allocates resources to a process and schedules it for use of the CPU. Accordingly, the kernel’s view of a process consists of two parts:
a) Code, data, and a stack of the process, and information concerning memory and other resources, such as files, allocated to it.
b) Information concerning the execution of a program, such as the process state, the CPU state including the stack pointer, and some other items of information described later in this section.
These two parts of the kernel’s view are contained in the process context and the process control block (PCB), respectively.
.png)
