search
Log In
0 votes
879 views
In Dynamic Loading:- We load the particular module into the main memory when it is needed.

In Demand Paging:- We load the particular page into the main memory when it is needed.

Both don't seems to be same??
in Operating System 879 views
1
Yes they do the same thing technically speaking. They both retrieve something they need at will.

I guess the name differs where you use it :P

Dynamic loading for loading and retrieving library and packages from system level. And demand paging for loading in pages at will.
0
"loading and retrieving library and packages from system level" also retrieved in page wise manner.

2 Answers

0 votes
may be its differentiated based on taken from physical memory or virtual memory

sorry if i dont make sense
0 votes

Dynamic Loading is simply a concept in which a software is written in such a way that when it is packaged to be sent to production (for eg. in a .exe or .jar or .apk ) then any library which is required at runtime is not packaged inside.

Simplest example is in Java when you connect Java to MySQL then you write:-

Class.forName("com.mysql.jdbc.Driver");  

Here we connect to the com.mysql.jdbc.Driver Library which is required to be present in the production environment.

Refer here:- https://en.wikipedia.org/wiki/Dynamic_loading#In_Java

Demand Paging is a concept in totally totally different context. It simply means caching (bringing) the process' page kept in HDD to RAM --> ON DEMAND. -> i.e. on MMU's demand. 

Related questions

0 votes
0 answers
1
95 views
In a swapping system with variable partitions, segments have probability -s/10 distribution ( e / 10) where s is the segment size in kilobytes. Holes -h/5 have probability distribution ( e / 5) where h is the hole size in kilobytes. What is the average ... q2soln.html i'm stuck at how average segment segment size and average hole size is calculated? please comment if you have got any insight.
asked Dec 25, 2018 in Operating System aambazinga 95 views
0 votes
1 answer
2
337 views
In a demand-paged system, it takes 100 nanoseconds to access memory. The page table has 8 entries and is held in registers. It takes 10 milliseconds to service a page fault if an empty frame is available or if the victim frame is not dirty. If the ... victim frame is dirty 80% of the time, find the maximum page fault rate for which the effective memory access time remains within 200 nanoseconds
asked Dec 20, 2017 in Operating System kauray 337 views
2 votes
1 answer
3
878 views
In a demand paging memory system, page table is held in registers. The time taken to service a page fault is 8 m.sec. if an empty frame is available or if the replaced page is not modified, and it takes 20 m.secs., if the replaced page is modified. ... is modified 70% of the time ? What is the maximum acceptable page-fault rate for an effective access time of no more than 200 nanoseconds?
asked Sep 1, 2017 in Operating System set2018 878 views
1 vote
0 answers
4
343 views
Can anyone pls explain what is the concept applied here http://www.cs.jhu.edu/~yairamir/cs418/os6/sld010.htm
asked Jun 20, 2017 in Operating System Aashish S 343 views
...