- 1、本文档共14页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Comparing reference counting and global mark-and-sweep on parallel computers
Comparing Reference Counting and Global
Mark-and-Sweep on Parallel Computers
Hirotaka Yamamoto, Kenjiro Taura, and Akinori Yonezawa
Department of Information Science, University of Tokyo,
Hongo 7-3-1, Bunkyo-ku, Tokyo, Japan
fymmt,tau,yonezawag@is.s.u-tokyo.ac.jp
Abstract. We compare two dynamic memory management schemes for
distributed-memory parallel computers, one based on reference counting
and the other based on global mark-and-sweep. We present a simple
model in which one can analyze performance of the two types of GC
schemes, and show experimental results. The two important observations
drawn from the analysis are: 1) the performance of reference counting
largely depends on shapes of data structures; specically, it is bad when
applications use deeply nested data structures such as distributed trees.
2) the cost of reference counting has a portion that is independent of the
heap size while that of global mark-and-sweep does not. We conrmed
these observations through experiments using three parallel applications.
1 Introduction
Most of the proposed algorithms and implementations of garbage collection (GC)
on distributed-memory parallel computers can be classied into two groups: Ref-
erence Counting and Global Mark-and-Sweep[13]. Reference counting has often
been considered superior to global mark-and-sweep because it does not require
any synchronization, but previous arguments are often supercial, not conrmed
by experiments, and lack a macroscopic viewpoint on the overall eciency of
these two collection schemes.
This paper reports a performance comparison of these two schemes, with
simple analyses on the overall eciency of both reference counting and global
mark-and-sweep, and experimental results. Experiments have been done on a
parallel computer in which processes communicate solely via message passing,
using three parallel applications.
Observations drawn from the analyses and experimental results include:
{ Performance of reference counting is sensit
您可能关注的文档
- characteristics of stemflow for tall stewartia growing on a hillslope.pdf
- Characteristics and sources of chromophoric dissolved organic matter in lakes of the Yungui Plateau.pdf
- Characterization of Electrochemically Grown Crystalline CuInSe2 Thin Films.pdf
- Characterization of PM2.5 in the ambientair of Shanghaicity by analyzingindividualparticles.pdf
- Characterizations of essential ideals as operator modules over C-algebras.pdf
- Characterizing packet audio streams from internet multimedia applications.pdf
- Charge amplification concepts for direction-sensitive dark matter detectors.pdf
- Charge carriers of different origin in cuprates as revealed by experiment.pdf
- Charge collective modes in an incommensurately modulated cuprate.pdf
- Charge exchange for medium energy He and Ne ions in a large-angle collision at solid surfaces.pdf
文档评论(0)