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
Advantages and Disadvantages Dynamic Linking
Advantages of Dynamic Linking
i) If a common shared library is already present in the main memory, then it is not required to load the same shared library file several times. It saves the main memory.
ii) Modules that are not invoked during the execution of a program need not be linked to it at all.
For example, if some function like printf( ) is under a condition statement of your program, then it will load in the main memory when the condition is true and it is needed. If the condition is not true and it is not needed then it will not load in the main memory. It saves the main memory.
Example:
void main()
{
int a;
scanf(“%d” ,&a);
if( a == 24 )
{
Printf(“valid”);
}
else
a=a+1;
}
In the above code printf(“valid”) is optional to link.
iii) Dynamic linking also provides an interesting benefit when a library of common modules is updated—a program that invokes this module of the library automatically starts using the new version of this module. Dynamically linked libraries (DLLs) use some of these features to their advantage.
Disadvantage of Dynamic Linking
The main disadvantage of dynamic linking is page fault because when the shared library module is not present in the main memory, the program loads the module into memory. This page fault occurs wastage of time and run time resolves of external references slow down the execution of the program.
So, at the time of conversion of a high-level language (assembly language) to object code, the assembler assigns the relocatable address to all symbols.
Now when the linker tries to complete all the linking and external resources again the addresses have been changed to new relocatable addresses for all symbols.
