NBR
Ajay Singh, Trevor Brown, Ali José Mashtizadeh
Abstract
Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms bound unreclaimed memory at all times, but tend to be slower than other approaches. Epoch based reclamation (EBR) algorithms are faster, but do not bound memory reclamation. Other algorithms follow hybrid approaches, requiring special compiler or hardware support, changes to record layouts, and/or extensive code changes. Not all SMR algorithms can be used to reclaim memory for all data structures.
Topics & Concepts
Computer sciencePointer (user interface)Parallel computingCompilerBounding overwatchHazardAlgorithmProgramming languageComputer hardwareArtificial intelligenceChemistryOrganic chemistryDistributed systems and fault toleranceParallel Computing and Optimization TechniquesSoftware System Performance and Reliability