Concurrent remembered set refinement in generational garbage

被引:0
作者
Detlefs, D
Knippel, R
Clinger, WD
Jacob, M
机构
来源
USENIX ASSOCIATION PROCEEDINGS OF THE 2ND JAVA(TM) VIRTUAL MACHINE RESEARCH AND TECHNOLOGY SYMPOSIUM | 2002年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Generational garbage collection divides a heap up into two or more generations, and usually collects a youngest generation most frequently. Collection of the youngest generation requires identification of pointers into that generation from older generations; a data structure that supports such identification is called a remembered set. Various remembered set mechanisms have been proposed; these generally require mutator code to execute a write barrier when modifying pointer fields. Remembered set data structures can vary in their precision: an imprecise structure requires the garbage collector to do more work to find old-to-young pointers. Generally there is a tradeoff between remembered set precision and barrier cost: a more precise remembered set requires a more elaborate barrier. Many current systems tend to favor more efficient barriers in this tradeoff, as shown by the widespread popularity of relatively imprecise card marking techniques. This imprecision becomes increasingly costly as the ratio between old- and young-generation sizes grows. We propose a technique that maintains more precise remembered sets that scale with old-generation size, using a barrier whose cost is not significantly greater than card marking.
引用
收藏
页码:13 / 26
页数:14
相关论文
共 50 条
[41]   Age-oriented concurrent garbage collection [J].
Paz, H ;
Petrank, E ;
Blackburn, SM .
COMPILER CONSTRUCTION, PROCEEDINGS, 2005, 3443 :121-136
[42]   Yama: A scalable generational garbage collector for Java']Java in multiprocessor systems [J].
Muthukumar, RM ;
Janakiram, D .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2006, 17 (02) :148-159
[43]   GC2:: a generational conservative garbage collector for the ATERM library [J].
Moreau, PE ;
Zendra, O .
JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2004, 59 (1-2) :5-34
[44]   Refinement for Structured Concurrent Programs [J].
Kragl, Bernhard ;
Qadeer, Shaz ;
Henzinger, Thomas A. .
COMPUTER AIDED VERIFICATION (CAV 2020), PT I, 2020, 12224 :275-298
[45]   Restructuring a Concurrent Refinement Algebra [J].
Hayes, Ian J. ;
Meinicke, Larissa A. ;
Evangelou-Oost, Naso .
RELATIONAL AND ALGEBRAIC METHODS IN COMPUTER SCIENCE, RAMICS 2024, 2024, 14787 :135-155
[46]   Improved Adaptive Generational Garbage Collection Algorithm for Java']Java Card [J].
Yang Fubiao ;
Li Daiping .
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGISTICS, ENGINEERING, MANAGEMENT AND COMPUTER SCIENCE, 2014, 101 :699-702
[47]   Relational Concurrent Refinement: Automata [J].
Derrick, John ;
Boiten, Eerke .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 259 (0C) :21-34
[48]   Garbage In ≠ Garbage Out: Exploring GAN Resilience to Image Training Set Degradations [J].
Crino, Nicholas ;
Cox, Bruce A. ;
Gaw, Nathan B. .
EXPERT SYSTEMS WITH APPLICATIONS, 2024, 250
[49]   Applying an Attentional Set to Perceived and Remembered Features [J].
Astle, Duncan Edward ;
Nobre, Anna Christina ;
Scerif, Gaia .
PLOS ONE, 2009, 4 (10)
[50]   A study of concurrent real-time garbage collectors [J].
Pizlo, Filip ;
Petrank, Erez ;
Steensgaard, Bjarne .
ACM SIGPLAN NOTICES, 2008, 43 (06) :33-44