Our great sponsors
-
LruJS
Asynchronous cache that implements Least Recently Used (LRU) - Clock - Second Chance algorithm with O(1) hit O(1) miss complexity. This Async cache hides latency of cache-misses behind each other and behind cache-hits.
-
SurveyJS
Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App. With SurveyJS form UI libraries, you can build and style forms in a fully-integrated drag & drop form builder, render them in your JS app, and store form submission data in any backend, inc. PHP, ASP.NET Core, and Node.js.
If codeblock is unreadable in this post, here is Github link: https://github.com/tugrul512bit/LruJS
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a more popular project.
Related posts
- Can the cache-write-hit ratio characteristics be different than cache-read-hit ratio characteristics if it was LRU or approximation of LRU or LFU or another cache eviction policy?
- Any benchmarker here with the fastest NVME drive to help me gather some benchmarking data for this file-caching example? My system is a bit old so the hdd can create/read only 2000 files in 300 milliseconds in case of cache-misses.
- How many get/Set operations per second can your computer do on a local redis ınstance? My old computer can only do 20k per second. Any benchmarkers here With Javascript/NodeJs?
- What kind of unit test do I need for my LRU cache approximation imolementation?
- I made a clock cache (LRU approximation) that has async O(1) cache miss and O(1) cache hit.