FOR FREE MATERIALS
- 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
Execution of Program and Object Code
Before we know how processes are managed in the main memory by memory management, here we first discuss how processes are compiling, linking, loading, and finally ready binary code for execution.
A program written in any language has to be transformed before it can be executed. Several step transformations perform memory binding—each one binds the instructions and data of the program to a new set of addresses.
.png)
Here object code is binary code but it is not executable code i.e not ready for execution.
As if we know that compiler gives us ready executable binary code after compiling the source code but
The compiler software is actually combined inside the assembler along with the loader and linker as a whole.
But in practical compiler only gives assembly code and then the assembler produces object code from the output of the compiler.
Important note: Assembler is hardware depended so, object code will be created as per hardware.
Object Code:
Object code resides at secondary memory (hard disk) and it has several areas where it stores different information. The general structure of object code as below:
.png)
1. Header:
The header section works as an index of the object file where it can get all the details about what information store in which section.
2. Text Segment: It contains the set of all instructions of the program.
3. Data Segment: It contains all the data which we used in the program like any constant variable.
4. Relocation Information:
The concept of relocation is coming from assigning an address to each instruction of the program.
The process of assigning addresses to various instructions of the program at the time of loading and as per address make an adjustment the instruction in the program to reflect the assigned address is called relocation.
Note: Please continue Relocation Information elaborately in the next topic: Address Relocation
