awesome-repositories.com
Blog
MCP
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektMCP-ServerÜber unsRanking-MethodikPresse
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

2 Repos

Awesome GitHub RepositoriesEpoch-Based Reclamation

Memory management that tracks access windows to safely reclaim memory after all readers have finished.

Distinct from Zero-Copy Memory Mappings: Focuses on the temporal reclamation of memory for zero-copy reads, rather than the mapping of files to memory.

Explore 2 awesome GitHub repositories matching data & databases · Epoch-Based Reclamation. Refine with filters or upvote what's useful.

Awesome Epoch-Based Reclamation GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • spacejam/sledAvatar von spacejam

    spacejam/sled

    8,928Auf GitHub ansehen↗

    Sled is an embedded key-value store and ACID-compliant database designed for high-performance data persistence. It functions as a log-structured storage engine that organizes data using B+ trees to support efficient range queries and prefix scans. The engine implements a zero-copy data store model, utilizing epoch-based reclamation to provide direct references to cached values without memory allocations. It distinguishes itself through a combination of write-ahead logging, page cache optimizations to reduce write amplification on flash storage, and serializable transactions for atomic multi-k

    Uses epoch-based reclamation to provide zero-copy reads without immediate memory allocations.

    Rustb-plus-treeb-treeconcurrent
    Auf GitHub ansehen↗8,928
  • crossbeam-rs/crossbeamAvatar von crossbeam-rs

    crossbeam-rs/crossbeam

    8,492Auf GitHub ansehen↗

    Crossbeam is a concurrency toolkit for Rust providing low-level primitives for writing multi-threaded programs. It focuses on lock-free data structures and memory management primitives designed for shared-memory concurrent environments. The project includes a work-stealing scheduler that uses double-ended queues to balance workloads across multiple processor cores. This system enables the implementation of work-stealing deques to distribute tasks and prevent bottlenecks. The toolkit covers broader capabilities for parallel algorithm development, multi-threaded task scheduling, and general co

    Implements epoch-based reclamation to safely defer memory deletion in concurrent environments.

    Rustconcurrencydata-structureslock-free
    Auf GitHub ansehen↗8,492
  1. Home
  2. Data & Databases
  3. Data Engineering and Infrastructure
  4. Data Persistence and Storage
  5. Data Storage Architectures
  6. Zero-Copy Memory Mappings
  7. Epoch-Based Reclamation