chmike
Joined 19 years ago
Joined 19 years ago
Go is awesome and I hope it will continue to progress in that direction. Thank you Russ Cox
When the least recently used data does have a lower probability to be requested, than LRU will outperform random picking.
There is no silver bullet algorithm.
The problem with publishing elsewhere is that many people unable to objectively evaluate the validity of the theory juge its value by the reputation of the journal. Also the other journal will most probably have less visibility. There is thus a higher chance that the other theory will not be reported in reviews.
There are many assumptions in the above comment that I can't agree with. But my experience is with physics, not computer science.
Regarding simplicity, there is a simpler algorithm where we don't need the next and prev pointers. We simply replace the non-flagged value at the hand. This is most probably what is used in CPUs.
The client sends a request, the server returns a response that may be big that also contains a random value. The client must return this random value in a thank you message.
If the server doesn't receive the thank you message, it slows down responses to that ip address and eventually blacklist it if it's repeated.
From the client perspective, the answer is obtained in one round trip time. The price to pay on the server is the need to keep track of the expected thank you messages, and the throttled or blacklisted addresses.
Is it hard to understand that for some people it may be difficult to read ? It might be due to motivation issues, thrust issues, or concentration issues. While at the same time they may have a rich inner imagination or thinking that they would like to share.
My impression is that humanity might miss valuable insight by rejecting whatever is not "well written" whatever the reason might be.
You may feel yourself very luck if you don't have any difficulties to read and write. Avoid to judge severely people who don't share the same facilities.