Assume we have 3 frames for a process with values (1,7,0). Now assume that the remaining references in the string reference for that process are : 4,6,7. For the reference 4 , a page fault will occur and only 7 is present in the future , so which frame should be replaced here , 1 or 0 ? Do I apply FIFO to break this tie or I can select any of them to replace ?
What breaks a tie in Optimal Page Replacement?
531 Views Asked by John adams At
1
There are 1 best solutions below
Related Questions in MEMORY-MANAGEMENT
- Calling Dealloc method in sprite kit
- Allocating memory for pointers inside structures in functions
- Beginner iOS memory management
- Deleting a dynamically allocated 2D array
- DataTable does not release memory
- how to resize image properly without memory warning
- Application Verifier limits Heap Allocations by default?
- C++ assign const reference to instance variable (memory issues?)
- What memory issues may arise from a single page JavaScript/AJAX application when kept open over a period of months?
- How to increase PHP memory_limit in Debian Jessie?
- Is this correct point to free char*
- Using parse.com and having allocation memory issue
- Qt object ownership when using lambda as slot
- Any ideas why one object is not deallocated in objective-c ARC
- How do I set a buffer in a possibly recursive procedure?
Related Questions in PAGING
- Paging data tables in jQuery
- datastax 4.7 The 'start' parameter is not allowed in c# driver with autopaging off
- URL not working ASP MVC in SMS function
- Horizontal Swipe in an activity
- Paging in .NET Web API
- How to hide DIV in paging
- On heap/stack and OS page swapping
- No result when Pagination with Servlet and JSP
- jqgrid paging on server side
- How can I do paging and sorting using spring data with Couchbase
- Using Paging Query Attribute in .NET Web API
- On x86, does enabling paging cause an "unconditional jump" (since EIP is now a virtual address)?
- Locally paging on Extjs 5 store of type ajax
- KendoUI Scheduler Page Events by Time
- Is there any way to add pagination to a table, which fetches data from database?
Related Questions in PAGE-REPLACEMENT
- Clock paging replacement algorithm
- FIFO Page Replacement Algorithm - Counting Page Faults
- When will the LRU algorithm be miss 100%?
- LRU page replacement vs FIFO page replacement
- What breaks a tie in Optimal Page Replacement?
- Segmentation fault while comparing elements in a dynamically allocated array
- Could someone help me to figure an example of MRU and CLOCK?
- Why use the Accessed-Bit for the Least-Recently-Used algorithm?
- Page faults in LRU algorithm
- Proof for optimal page replacement (OPT)
- Remove and Insert into a LinkedHashMap using iterator?
- The mystery number '63' in the context of demand paging
- Adaptive replacement cache algorithm
- LIST_HEAD(clean_pages) is not working in Linux Kernel
- How to code the optimal page replacement algorithm?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Optimal means you have all future information, so if two pages were truly never to be used again you could pick either and be fine. However if you wanted to do an LRU or FIFO to break the tie, it would be fine (i.e. wouldn't matter).
What would be interesting is thinking about optimal applied globally and not just to a single process. If we assume other processes might touch 1 or 0 later, that could be part of the future information used to make the optimal choice. Optimal decision-making would also become more complicated if multiple cpus are touching memory concurrently as well.