A lock-free, read-optimized, concurrency primitive.
concurrencymultithreadinglock-freerust
Métricas clave
Crecimiento de estrellas
Estrellas
2.3k
Forks
109
Crecimiento semanal
—
Issues
4
1k2k
feb 2017ago 2018mar 2020oct 2021may 2023dic 2024jul 2026
Artefactoscrates.iocargo add left-right
README
Left-right is a concurrency primitive for high concurrency reads over a
single-writer data structure. The primitive keeps two copies of the
backing data structure, one that is accessed by readers, and one that is
accessed by the (single) writer. This enables all reads to proceed in
parallel with minimal coordination, and shifts the coordination overhead
to the writer. In the absence of writes, reads scale linearly with the
number of cores.
