https://github.com/rehanvdm/lru-cache-fallback-strategy
A Least Recently Used(LRU) cache stores items in-memory and evicts the oldest(less used) ones as soon as the allocated memory (or item count) has been reached. Storing data in-memory before reaching for an external cache increases speed and decrease the dependency on the external cache. It is also possible to fallback to in-memory caches like an LRU cache in periods that your external cache goes down without seeing a significant impact on performance.
https://github.com/rehanvdm/lru-cache-fallback-strategy
architecture cache lambda lru redis
Last synced: 7 months ago
JSON representation
A Least Recently Used(LRU) cache stores items in-memory and evicts the oldest(less used) ones as soon as the allocated memory (or item count) has been reached. Storing data in-memory before reaching for an external cache increases speed and decrease the dependency on the external cache. It is also possible to fallback to in-memory caches like an LRU cache in periods that your external cache goes down without seeing a significant impact on performance.
- Host: GitHub
- URL: https://github.com/rehanvdm/lru-cache-fallback-strategy
- Owner: rehanvdm
- Created: 2022-01-09T17:25:23.000Z (about 4 years ago)
- Default Branch: master
- Last Pushed: 2022-01-14T05:57:01.000Z (about 4 years ago)
- Last Synced: 2025-05-27T10:01:20.455Z (8 months ago)
- Topics: architecture, cache, lambda, lru, redis
- Language: JavaScript
- Homepage: https://www.rehanvdm.com/blog/lru-cache-fallback-strategy
- Size: 32.2 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0