Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.programming.threads > #5520
| From | Bonita Montero <Bonita.Montero@gmail.com> |
|---|---|
| Newsgroups | comp.programming.threads |
| Subject | Re: About Java and Delphi and Freepascal.. |
| Date | 2020-01-27 18:49 +0100 |
| Organization | albasani.net |
| Message-ID | <r0n7qu$q7a$1@news.albasani.net> (permalink) |
| References | <be043e85-b39a-4759-90c6-762535effc65@googlegroups.com> |
> About my LRU scalable algorithm.. Your LRU-algorithm ? Where is it ? >> Amine, a quest for you: >> Database-servers and operating-system-kernels mostly use LRU as >> the scheme to evict old buffers from their cache. One issue with >> LRU is, that an LRU-structure can't be updated by multiple threads >> simultaneously. So you have to have a global lock. >> I managed to write a LRU-caching-class that can update the links >> in the LRU-list to put the most recent fetched block to the head >> of the list without any lock in almost any acccess. Only when >> flushing an entry or inserting a new I have to lock the structure >> completely; but in contrast to cache-hits this has usually a mag- >> nitude lower frequency because of the slowness of disk-/ssd-access, >> so this doesn't relly hurt. >> The algorithm is partitiylly locked, partitially lock-free. Even >> the case when putting cache hits to the head has to be processed >> in locked mode in very rare cases. And as I said inserting and >> flushing is conventional locked access. >> So the quest is for you: Can you guess what I did? > And here is what i have just responded: > I think i am also smart, ... Then show me your LRU-code.
Back to comp.programming.threads | Previous | Next — Previous in thread | Find similar | Unroll thread
About Java and Delphi and Freepascal.. aminer68@gmail.com - 2020-01-27 09:16 -0800 Re: About Java and Delphi and Freepascal.. Bonita Montero <Bonita.Montero@gmail.com> - 2020-01-27 18:49 +0100
csiph-web