Live briefing
Everything about Reference counting
Software resource tracking technique
In computer science, reference counting is a programming technique of storing the number of references, pointers, or handles to a resource, such as an object, a block of memory, disk space, and others. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Reference countingA 5-minute orientation
- Skim a recent paper: Myocardial Characterization with Extracellular Volume Mapping with a First-Generation Photon-counting Detector CT with MRI ReferenceInfluential work since 2022
- Pick up a classic book: Hematological and Iron Related AnalytesThe most-reprinted book on the subject
- Read the landmark paper: An Interlaboratory Study of a Candidate Reference Method for Platelet CountingCited 101 times
- Go sideways: Garbage collection (computer science)A closely related topic
- Go sideways: Tracing garbage collectionA closely related topic
đź“– Definitions
Noun The technique of storing the number of handles, pointers, or references to a resource such as a block of memory, disk space, or an object, so that the system can determine when the resource is no longer in use.
🏆 Landmark papers (most cited)
An Interlaboratory Study of a Candidate Reference Method for Platelet Counting
Immunoplatelet counting: a proposed new reference procedure
An on-the-fly reference-counting garbage collector for java
Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting
Cyclic reference counting with lazy mark-scan
Cyclic reference counting with local mark-scan
Lock-free reference counting
Reference counting can manage the circular invironments of mutual recursion
🆕 Influential since 2022
Myocardial Characterization with Extracellular Volume Mapping with a First-Generation Photon-counting Detector CT with MRI Reference
Development of gene-in-plasmid DNA reference materials certified by single-molecule counting
A Low-Cost FPGA-Based Coarse-Fine Counting Time-to-Digital Converter With External High-Precision Reference Clock
Stress myocardial perfusion imaging with photon-counting CT: Initial validation against reference modalities
Ultra-high resolution photon-counting detector coronary CT minimizes overestimation bias compared to invasive reference
đź“š Books worth reading
- 📕Hematological and Iron Related AnalytesNational Health and Nutrition Examinatio · 2005
A History of Online Information Services, 1962–1976Charles P. Bourne, Trudi Bellardo Hahn · 2003
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Garbage collection (computer science) In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector attempts to reclaim memory that was allocated…
- Tracing garbage collection In computer programming, tracing garbage collection is a form of automatic memory management that consists of determining which objects should be deallocated…
- Weak reference In computer programming, a weak reference is a reference that does not protect the referenced object from collection by a garbage collector, unlike a strong…
- Mark–compact algorithm In computer science, a mark–compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark–compact algorithms can…
- Smart pointer In computer science, a smart pointer is an abstract data type that simulates a pointer while providing added features, such as automatic memory management…
- Cheney's algorithm Cheney's algorithm, first described in a 1970 ACM paper by C.J. Cheney, is a stop and copy method of tracing garbage collection in computer software systems…
- Region-based memory management In computer science, region-based memory management is a type of memory management in which each allocated object is assigned to a region. A region, also…
- Manual memory management In computer science, manual memory management refers to the usage of manual instructions by the programmer to identify and deallocate unused objects, or…