Deterministic Garbage Collection
Deterministic Garbage Collection is a memory management technique in real-time systems programming that belongs to the class of garbage collection methods and is distinguished by its ability to guarantee bounded and predictable timing of memory reclamation, ensuring that object deallocation occurs within known time constraints.
9
Publications
252
Citations
37
Authors
10
Institutions
Publications per year
2017–2026
1
9
Programming with non-heap memory in the real time specification for Java
Greg Bollella, Tim Canham, Vanessa Carson et al. · 2003 · 40 citations
ORDER: object centric deterministic replay for Java
Zhemin Yang, Min Yang, XU Lv-cai et al. · 2011 · 26 citations
1–5 of 9
37
1
h-index
1
h-index
1
h-index
1 publications · 17 citations
1
h-index
1
h-index
1–5 of 37
10
California Institute of Technology
Pasadena, United States
1 h-index
7 publications
280 citations
Nanjing University
Nanjing, China
1 h-index
4 publications
64 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
1 h-index
2 publications
32 citations
Embedded Systems (United States)
Middletown, United States
1 h-index
2 publications
118 citations
Fudan University
Shanghai, China
1 h-index
5 publications
130 citations
IBM (Canada)
Markham, Canada
1 h-index
2 publications
38 citations

Uppsala University
Uppsala, Sweden
1 h-index
1 publications
22 citations
Carnegie Mellon University
Pittsburgh, United States
1 h-index
2 publications
80 citations
1–8 of 10
1 publications · 22 citations
1
h-index
1–1