Quantitative analysis of Boehm' s GC

查看全文 作　　者：GUAN Xue-tao~*, ZHANG Yuan-rui, GOU Xiao-gang, CHENG Xu (MicroProcessor R & D Center, Peking University, Beijing 100871, China, 出　　处：《Journal of Harbin Institute of Technology(New Series)》索引2003年第10卷第3期,共6页 摘　　要：The term garbage collection describes the automated process of finding previously allocated memorythatis no longer in use in order to make the memory available to satisfy subsequent allocation requests. Wehave reviewed existing papers and implementations of GC, and especially analyzed Boehm' s C codes, which isa real-time mark-sweep GC running under Linux and ANSI C standard. In this paper, we will quantitatively an-alyze the performance of different configurations of Boehm' s collector subjected to different workloads. Reportedmeasurements demonstrate that a refined garbage collector is a viable alternative to traditional explicit memorymanagement techniques, even for low-level languages. It is more a trade-off for certain system than an all-or-nothing proposition. 关 键 词：计算机 存储管理 定量分析 勃姆式无用存储单元收集