Page Replacement Algorithm Solver
Yes, this page will help you to calculate page replacement algorithm (FIFO, LRU, and OPT). I’m so glad that I found this site, even though it’s kinda late for me not searching this earlier.
Buddy System Method Interactive Visualization
What is buddy system exactly? From the name it’s sounds catchy, well indeed. This page will explain all you need to know about buddy system and it also provides you with interactive visualisations to help you understand more about it. What I love about this page is I can try and play around with the visualization right away.
High Page Faults, But Plenty of Ram
It is one of question(problem) that I’ve encountered with recently, and lucky for me there’s someone who have the same problem. That link above leads to a discussion forum, in which this particular questions has been answered, or rather explained. From now I know it is likely that certain application who caused the problem.
Why Page Faults Are Usually Handled By The OS, Not Hardware?
Another interesting question about page faults, posted in the forum. But here, I think that it has such a good explanation for this question. For short, the answer is if the hardware could handle it on its own, it wouldn’t need to fault.
Page Fault Handling In Operating System
One last article about page faults, but this article are not questions like 2 questions above. The article explains how to handle page fault in operating system. Point plus from me, to read and finish the article you don’t need to spend lots of your time on it.
Paging vs Swapping, What’s The Difference
The issue of swapping and paging is often misunderstood. Swapping and paging are two totally different things. By that, this page explains in depth the difference of the two, but especially in linux system. For me, the contain of the web itself is easy to understand.
What Are Demand-Paging And Pre-Paging?
In this blog, you can learn about the concept of Demand Paging and Pre-paging that is used in OS. Not just a glance, this blog cover almost everything about the topic from how it works, advantages, and its disadvantages.
It also comes with pictures so it help me to understand even more.
How Does FIFO Replacement Works
First-in, first-out (FIFO) is the simplest among page replacement algorithms. This tutorial page will cover FIFO thoroughly, from the general idea, page faults, pseudocode, example, advantages, and disadvantages. As like the other good tutorial, it also come up with conclusion as its closing statement.
Techniques to Handle Thrashing
This page will guide you through the techniques go handle thrasing, complete with some pictures of graph to help you understand more about it. Just for recall, thrashing is a condition when the system is spending a major portion of its time in servicing the page faults, but the actual processing done is very negligible. One thing, I was mistakenly called this method as trashing hehe.
A New Linux Memory Controller Promises to Save Lots of RAM
At first, I thought it was an article about slab allocation. But no, this is an intriguing article about a breakthrough in memory technology. Roman Gushchin, a member of Facebook’s Linux kernel engineering team, has proposed a brand new slab memory controller for the Linux kernel.