https://github.com/abhigyan126/sieve
A C implementation of the SIEVE cache eviction algorithm, based on the research paper (https://junchengyang.com/publication/nsdi24-SIEVE.pdf)
https://github.com/abhigyan126/sieve
c c-library sieve-cache
Last synced: about 1 month ago
JSON representation
A C implementation of the SIEVE cache eviction algorithm, based on the research paper (https://junchengyang.com/publication/nsdi24-SIEVE.pdf)
- Host: GitHub
- URL: https://github.com/abhigyan126/sieve
- Owner: Abhigyan126
- Created: 2025-01-21T15:25:26.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2025-01-22T17:25:45.000Z (9 months ago)
- Last Synced: 2025-06-22T23:08:07.632Z (4 months ago)
- Topics: c, c-library, sieve-cache
- Language: Makefile
- Homepage:
- Size: 38.1 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# SIEVE Cache Implementation
A C implementation of the SIEVE cache eviction algorithm, based on the research paper (https://junchengyang.com/publication/nsdi24-SIEVE.pdf)
## Overview
This project implements the SIEVE cache eviction algorithm, which offers:
- Simpler implementation than LRU
- Better efficiency than many state-of-the-art algorithms
- Superior scalability with no locking required for cache hits
- Potential to be used as a cache primitive like FIFO and LRU
## Implementation
The cache is implemented with these key components:
- Fixed-size array of cache entries
- Each entry contains:
- Key (string)
- Value (integer)
- Visited flag
- hand pointer for eviction
- No complex data structures required
Flowchart
```mermaid
%%{init: {'theme': 'black', 'themeVariables': { 'fontSize': '16px'}, "securityLevel": "loose"}}%%
graph TD
A[Cache Operation] --> B{Operation Type}
B -->|Insert| C{Key Exists?}
C -->|Yes| D[Update Value]
C -->|No| E{Cache Full?}
E -->|Yes| F[Eviction Process]
E -->|No| G[Insert New Entry]
F --> H{Check Current Hand}
H -->|Visited=True| I[Set Visited=False]
I --> J[Move Hand]
J --> H
H -->|Visited=False| K[Evict Entry]
K --> G
B -->|Get| L{Find Key}
L -->|Found| M[Mark Visited & Return]
L -->|Not Found| N[Return NULL]
subgraph Cache Structure
O[Node Array] --> P[Key]
O --> Q[Value]
O --> R[Visited Flag]
end
```
### Building the Project
```bash
mkdir build
cd build
cmake ..
make
```
### Usage
```c
// Create a cache
Cache *cache = create_cache(size);
// Insert a key-value pair
insert(cache, "key", value);
// Retrieve a value
int *value = get(cache, "key");
// Free the cache
free_cache(cache);
```
## Directory Structure
```
sieve/
├── CMakeLists.txt
├── include/
│ └── sieve.h
├── src/
│ └── sieve.c
└── tests/
└── test.c
```
## Algorithm Details
The implementation follows the SIEVE algorithm's clock-based approach:
1. The hand moves through the cache
2. If it finds an unvisited entry, that entry is evicted
3. If an entry is visited, its visited flag is cleared and the hand moves on
4. If all entries are visited, the hand will eventually return to evict the first entry it finds