A Compile-Time Memory-Reuse Scheme for Concurrent Logic Programs
Abstract elided by the publisher.
Related papers
- Compile-time memory reuse in logic programming languages through update in place TOPLAS 1999
- Efficiently reclaiming memory in concurrent search data structures while bounding wasted memory PPoPP 2021
- RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures PLDI 2025
- Compiler-Directed Variable Latency Aware SPM Management to CopeWith Timing Problems CGO 2007
- A Compiler Scheme for Reusing Intermediate Computation Results CGO 2004
- Compiler aided selective lock assignment for improving the performance of software transactional memory PPoPP 2010
- POSTER: Reuse, don't Recycle: Transforming Algorithms that Throw Away Descriptors PPoPP 2017
- Stamp-it, amortized constant-time memory reclamation in comparison to five other schemes PPoPP 2018