Compile-time concurrent marking write barrier removal

被引:3
|
作者
Nandivada, VK [1 ]
Detlefs, D [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
关键词
D O I
10.1109/CGO.2005.12
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Garbage collectors incorporating concurrent marking to cope with large live data sets and stringent pause time constraints have become common in recent years. The snapshot-at-the-beginning style of concurrent marking has several advantages over the incremental update alternative, but one main disadvantage: it requires the mutator to execute a significantly more expensive write barrier This paper demonstrates that a large fraction of these write barriers are unnecessary, and may be eliminated by static analysis.
引用
收藏
页码:37 / 48
页数:12
相关论文
共 50 条
  • [31] LaminarIR: Compile-Time Queues for Structured Streams
    Ko, Yousun
    Burgstaller, Bernd
    Scholz, Bernhard
    [J]. ACM SIGPLAN NOTICES, 2015, 50 (06) : 121 - 130
  • [32] Reflekt: a Library for Compile-Time Reflection in Kotlin
    Birillo, Anastasiia
    Lyulina, Elena
    Malysheva, Maria
    Tankov, Vladislav
    Bryksin, Timofey
    [J]. 2022 ACM/IEEE 44TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING: SOFTWARE ENGINEERING IN PRACTICE (ICSE-SEIP 2022), 2022, : 231 - 240
  • [33] COMPILE-TIME ESTIMATION OF COMMUNICATION COSTS OF PROGRAMS
    GUPTA, M
    BANERJEE, P
    [J]. JOURNAL OF PROGRAMMING LANGUAGES, 1994, 2 (03): : 191 - 225
  • [34] A Position Paper on Compile-time Program Analysis
    [J]. SIGPLAN Not, 1 (110-114):
  • [35] COMPILE-TIME PARTITIONING AND SCHEDULING OF PARALLEL PROGRAMS
    SARKAR, V
    HENNESSY, J
    [J]. SIGPLAN NOTICES, 1986, 21 (07): : 17 - 26
  • [36] Compile-time inter-query dependence analysis
    Parthasarathy, S
    Li, W
    Cierniak, M
    Zaki, MJ
    [J]. EIGHTH IEEE SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1996, : 522 - 529
  • [37] PROVING SAFETY OF SPECULATIVE LOAD INSTRUCTIONS AT COMPILE-TIME
    BERNSTEIN, D
    RODEH, M
    SAGIV, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 582 : 56 - 72
  • [38] COMPILE-TIME TECHNIQUES FOR EFFICIENT UTILIZATION OF PARALLEL MEMORIES
    GUPTA, R
    SOFFA, ML
    [J]. SIGPLAN NOTICES, 1988, 23 (09): : 235 - 246
  • [39] Compile-Time Analysis of Compiler Frameworks for Query Compilation
    Engelke, Alexis
    Schwarz, Tobias
    [J]. 2024 IEEE/ACM INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, CGO, 2024, : 233 - 244
  • [40] Automatic Security Bug Classification: A Compile-time Approach
    Du, Tie
    Zheng, Long
    Chen, Shaopeng
    Jin, Hai
    [J]. 2016 IEEE 22ND INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2016, : 398 - 405