Heap allocation creates a software object whose lifetime need not match one lexical procedure call. Other software objects can retain references to it after the constructing call returns. Automatic storage reclamation therefore follows reachability or another memory-management discipline, rather than simply returning from that call.
Making storage available for reuse after its object is no longer accessible to any legitimate user. Concurrent readers retaining old pointers make safe memory reclamation a separate problem from atomic pointer publication.
A published reader protection record used by a protocol that validates the protected pointer and delays memory reclamation while relevant readers may access the object. Merely copying an unprotected pointer does not supply this lifetime guarantee.
A family of concurrent access techniques that publishes replacement versions and postpones memory reclamation until a suitable grace period has passed. Correct reader tracking, publication ordering and lifetime rules are essential.
An interval sufficient to establish that every reader that might retain a preexisting reference has left its protected read-side region. Completion permits the corresponding old object to undergo memory reclamation.
An access through a pointer after its storage has been released. Reusing the same memory address for a different object can make this failure silently return unrelated data instead of immediately crashing.
Articles by others on the same topic
There are currently no matching articles.