OPT Replacement Policy

Question

5.00/5 (1 vote)

See more: (untagged)

To sum it up, I'm stuck trying to figure out how to implement a sample OPT cache replacement policy algorithm.

Its based on look ahead, I just can't figure out how to implement it in code.

I'm supposed to remove the item that will be called the farthest away from the currently called item.

Ideas?

TIA

[edit]
This had been previously posted in the C++ forum and then this morning I realized it was in the wrong place. My apologies. I have removed the original posting so as not to double post.

Posted 4-Jan-09 22:46pm

Mustafa Ismail Mustafa

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

Pete O'Hanlon · Answer 1 · 2009-01-05T05:01:00

Solution 1

Something in this[^] list might help. One thought would be to implement a BST as a base for this.

Posted 5-Jan-09 5:01am

Pete O'Hanlon