DocumentCode :
2704636
Title :
Compile-time concurrent marking write barrier removal
Author :
Nandivada, V. Krishna ; Detlefs, David
Author_Institution :
Dept. of Comput. Sci., UCLA, Los Angeles, CA, USA
fYear :
2005
fDate :
20-23 March 2005
Firstpage :
37
Lastpage :
48
Abstract :
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.
Keywords :
concurrency control; program compilers; program diagnostics; storage management; compile-time concurrent marking; garbage collectors; pause time constraints; static analysis; write barrier removal; Computer languages; Computer science; Costs; Java; Reduced instruction set computing; Sun; Time factors; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Code Generation and Optimization, 2005. CGO 2005. International Symposium on
Print_ISBN :
0-7695-2298-X
Type :
conf
DOI :
10.1109/CGO.2005.12
Filename :
1402075
Link To Document :
بازگشت