top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Enhanced Second-Chance Algorithm vs simpler clock algorithm

0 votes

In Ch. 9- Vitual memory management- Topic no- (Enhanced Second-Chance Algorithm)- Last paragraph, it is written that

"The major difference between this algorithm (Enhanced Second-Chance Algorithm) and the simpler clock algorithm is that here we give preference to those pages that have been modified in order to reduce the number of I/O required."

Here simpler clock algorithm is Second-Chance Algorithm.
Does this mean that only in Enhanced Second-Chance Algorithm, while replacing a page from frame, modified (dirty) page is removed first whereas in other algorithm non-modified (non-dirty) page is removed first?

posted May 31, 2017 by anonymous

Looking for an answer?  Promote on:
Facebook Share Button Twitter Share Button LinkedIn Share Button

Similar Questions
+1 vote

I have few questions about Cache Memory

In my system "free -h" command gave me below output,

      total        used        free      shared  buff/cache   available
Mem:   7.6G        2.1G        1.5G         46M        4.0G        4.8G
Swap:  1.6G         28M        1.6G

1. Why "Cache Memory" is required inside the main memory?

As far as i know "Cache Memory" is different than the main memory(RAM), It is very costly and it is very faster, Please Correct me if i am wrong.

2. Before 1 hour this cache memory was 3 GB and then it is increased by 1 GB?

Please note that I din't start/run any new processes

3. Till what limit i can start new processes/application?

I mean as per free -h command output,

free memory = 1.5 GB, Cache memory = 4 GB and Swap memory = 1.6 GB

can i start new application up to (1.5 + 1.6) GB or (1.5 + 1.6 + 4) GB`?

4. Can i set/configure this cache memory value?

If yes, then how to?

+3 votes

also please explain Virtual Memory Can Slow Down Performance why and how?