Observed since 20 Oct, 19:07 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
An adaptive Pipeline Cache composed of FIFO and upgraded TinyLFU with cost-awareness
A high-performance adaptive caching system implemented in C++ with Python bindings. The cache dynamically adjusts its internal structure based on workload characteristics, combining FIFO, Approximate LRU (ALRU), and Cost-Aware LFU strategies.
pip install adaptive-pipeline
Requirements:
git clone <repository-url>
cd pipeline-cache
pip install -e .
Notice that for this version, the size of the cache is hard-coded to be 1024, and it ignores the size parameter.
from adaptive_pipeline import AdaptivePipelineCache
# Create a cache with capacity of 1024 items
cache = AdaptivePipelineCache(1024)
# Store items with (latency, tokens) tuple
cache[key] = (latency, tokens)
# Check if key exists
if key in cache:
latency, tokens = cache[key]
# Get cache statistics
print(f"Current size: {cache.currsize}")
print(f"Max size: {cache.maxsize}")
The Adaptive Pipeline Cache uses a novel approach that:
The cache automatically adapts its configuration every 10,240 operations (configurable) by comparing the performance of the current configuration against alternative configurations simulated by ghost caches.
The implementation follows the interface of cacheutils for compatibility with GPT-Cache experiments.
MIT License - see LICENSE file for details
Nadav Keren (nadavker@pm.me)
Download counts and popularity will appear here as the collector receives them.
| Version | Published | Direct dependencies | Open version |
|---|---|---|---|
| 0.1.5 | 14 Nov 2025 | 1 |
This describes our collected data; it is not a security assessment.
Shared repository data · GitHub
Observed since 20 Oct, 19:07 UTC
No superseded metadata states collected. Unchanged observations do not create new revisions.
package:203edd9af3f6c96a21fef592a885914c5329ea337ab3edbb90e34cf03ba04477