CREATE OWN LIBRARY
- 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
Linker
Linker definition and passes:
Now after store all resolved and unresolved symbols at the symbol table next linker is enabled to start linking all externals links and solve unresolved symbols by link undefined symbols by system libraries.
.png)
Linker has been complete there work in two phases:
Pass 1: Initially linker differentiates the symbols like which are define symbols (present in this code) and what are undefined symbols or external references (shared library code) which are not present in this code and coming from external sources.
So, it figures out defined segments and undefined segments in the symbol table. Here in 1st pass linker use two tables:
(i) Segment table: Here store the entire segments which will be loaded from external sources and loaded in the main object code after linking.
(ii) Symbol table: Here find out the unresolved symbol which is going to be resolved.
Pass 2: In this pass, the linker tries to solve all unresolved symbol and assign it to a specific address. But these allocated addresses are relocatable addresses.
Main object code after 2 passes of a linker.
.png)
Previously before linking, C and M was an unresolved symbol but now they get relocatable addresses 10 and 60 after linking was done.
Functionalities of Linker
(i) Relocation: Relocation of relocatable address to new relocatable address.
(ii) Symbol Resolution: Try to resolve all unresolved symbols which present at the symbol table.
