Loading…
PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION
We present a new approach to parallel copying garbage collection on symmetric multiprocessor (SMP) machines appropriate for Java and other object-oriented languages. Parallel, in this setting, means that the collector runs in several parallel threads. Our collector is based on a new idea called dela...
Saved in:
| Published in: | Parallel processing letters 2004-06, Vol.14 (2), p.271-286 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | cdi_FETCH-LOGICAL-c1818-81660c0b921748a5e554d8492e69db8f6a14adcfebf60dbd922f3ad711924e263 |
| container_end_page | 286 |
| container_issue | 2 |
| container_start_page | 271 |
| container_title | Parallel processing letters |
| container_volume | 14 |
| creator | PETRANK, EREZ KOLODNER, ELLIOT K. |
| description | We present a new approach to parallel copying garbage collection
on symmetric multiprocessor (SMP) machines appropriate for Java and
other object-oriented languages. Parallel, in this setting, means that
the collector runs in several parallel threads.
Our collector is based on a new idea called delayed allocation,
which completely eliminates the fragmentation problem of previous parallel
copying collectors while still keeping low synchronization, high efficiency,
and simplicity of collection. In addition to this main idea, we
also discuss several other ideas such as termination detection, balancing
the distribution of work, and dealing with contention during work
distribution. |
| doi_str_mv | 10.1142/S0129626404001878 |
| format | article |
| fullrecord | <record><control><sourceid>pascalfrancis_cross</sourceid><recordid>TN_cdi_pascalfrancis_primary_16059591</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16059591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1818-81660c0b921748a5e554d8492e69db8f6a14adcfebf60dbd922f3ad711924e263</originalsourceid><addsrcrecordid>eNplj01Lw0AQhhdRMFZ_gLdcPEZ3NpvNLnhZ0xgLoSn9AHsKm_2ASG1LVpD-exMieuhpmHmed-BF6B7wIwAlTysMRDDCKKYYA0_5BQogFXHEKHm_RMGAo4FfoxvvP3qHphQH6Hkhl7Is8zLMqsV2Ni_CQi5fZJH3e3_O1rNqHm5WA5jmpdzm07DXq0wO4BZdObXz9u53TtDmNV9nb1FZFbNMlpEGDjziwBjWuBEEUspVYpOEGk4FsUyYhjumgCqjnW0cw6YxghAXK5MCCEItYfEEwfhXdwfvO-vqY9d-qu5UA66H-vVZ_T7zMGaOymu1c53a69b_BxlORCKg9_DofR-6nfG6tfuv1rX6zzx__QOiaGLe</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION</title><source>World Scientific Journals</source><creator>PETRANK, EREZ ; KOLODNER, ELLIOT K.</creator><creatorcontrib>PETRANK, EREZ ; KOLODNER, ELLIOT K.</creatorcontrib><description>We present a new approach to parallel copying garbage collection
on symmetric multiprocessor (SMP) machines appropriate for Java and
other object-oriented languages. Parallel, in this setting, means that
the collector runs in several parallel threads.
Our collector is based on a new idea called delayed allocation,
which completely eliminates the fragmentation problem of previous parallel
copying collectors while still keeping low synchronization, high efficiency,
and simplicity of collection. In addition to this main idea, we
also discuss several other ideas such as termination detection, balancing
the distribution of work, and dealing with contention during work
distribution.</description><identifier>ISSN: 0129-6264</identifier><identifier>EISSN: 1793-642X</identifier><identifier>DOI: 10.1142/S0129626404001878</identifier><language>eng</language><publisher>Singapore: World Scientific Publishing Company</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Software</subject><ispartof>Parallel processing letters, 2004-06, Vol.14 (2), p.271-286</ispartof><rights>2004, World Scientific Publishing Company</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c1818-81660c0b921748a5e554d8492e69db8f6a14adcfebf60dbd922f3ad711924e263</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.worldscientific.com/doi/reader/10.1142/S0129626404001878$$EPDF$$P50$$Gworldscientific$$H</linktopdf><link.rule.ids>314,780,784,3213,4872,27924,27925,55587</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16059591$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>PETRANK, EREZ</creatorcontrib><creatorcontrib>KOLODNER, ELLIOT K.</creatorcontrib><title>PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION</title><title>Parallel processing letters</title><description>We present a new approach to parallel copying garbage collection
on symmetric multiprocessor (SMP) machines appropriate for Java and
other object-oriented languages. Parallel, in this setting, means that
the collector runs in several parallel threads.
Our collector is based on a new idea called delayed allocation,
which completely eliminates the fragmentation problem of previous parallel
copying collectors while still keeping low synchronization, high efficiency,
and simplicity of collection. In addition to this main idea, we
also discuss several other ideas such as termination detection, balancing
the distribution of work, and dealing with contention during work
distribution.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0129-6264</issn><issn>1793-642X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNplj01Lw0AQhhdRMFZ_gLdcPEZ3NpvNLnhZ0xgLoSn9AHsKm_2ASG1LVpD-exMieuhpmHmed-BF6B7wIwAlTysMRDDCKKYYA0_5BQogFXHEKHm_RMGAo4FfoxvvP3qHphQH6Hkhl7Is8zLMqsV2Ni_CQi5fZJH3e3_O1rNqHm5WA5jmpdzm07DXq0wO4BZdObXz9u53TtDmNV9nb1FZFbNMlpEGDjziwBjWuBEEUspVYpOEGk4FsUyYhjumgCqjnW0cw6YxghAXK5MCCEItYfEEwfhXdwfvO-vqY9d-qu5UA66H-vVZ_T7zMGaOymu1c53a69b_BxlORCKg9_DofR-6nfG6tfuv1rX6zzx__QOiaGLe</recordid><startdate>200406</startdate><enddate>200406</enddate><creator>PETRANK, EREZ</creator><creator>KOLODNER, ELLIOT K.</creator><general>World Scientific Publishing Company</general><general>World Scientific Publishing</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>200406</creationdate><title>PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION</title><author>PETRANK, EREZ ; KOLODNER, ELLIOT K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1818-81660c0b921748a5e554d8492e69db8f6a14adcfebf60dbd922f3ad711924e263</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>PETRANK, EREZ</creatorcontrib><creatorcontrib>KOLODNER, ELLIOT K.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Parallel processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>PETRANK, EREZ</au><au>KOLODNER, ELLIOT K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION</atitle><jtitle>Parallel processing letters</jtitle><date>2004-06</date><risdate>2004</risdate><volume>14</volume><issue>2</issue><spage>271</spage><epage>286</epage><pages>271-286</pages><issn>0129-6264</issn><eissn>1793-642X</eissn><abstract>We present a new approach to parallel copying garbage collection
on symmetric multiprocessor (SMP) machines appropriate for Java and
other object-oriented languages. Parallel, in this setting, means that
the collector runs in several parallel threads.
Our collector is based on a new idea called delayed allocation,
which completely eliminates the fragmentation problem of previous parallel
copying collectors while still keeping low synchronization, high efficiency,
and simplicity of collection. In addition to this main idea, we
also discuss several other ideas such as termination detection, balancing
the distribution of work, and dealing with contention during work
distribution.</abstract><cop>Singapore</cop><pub>World Scientific Publishing Company</pub><doi>10.1142/S0129626404001878</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0129-6264 |
| ispartof | Parallel processing letters, 2004-06, Vol.14 (2), p.271-286 |
| issn | 0129-6264 1793-642X |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16059591 |
| source | World Scientific Journals |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Software |
| title | PARALLEL COPYING GARBAGE COLLECTION USING DELAYED ALLOCATION |
| url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T23%3A13%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=PARALLEL%20COPYING%20GARBAGE%20COLLECTION%20USING%20DELAYED%20ALLOCATION&rft.jtitle=Parallel%20processing%20letters&rft.au=PETRANK,%20EREZ&rft.date=2004-06&rft.volume=14&rft.issue=2&rft.spage=271&rft.epage=286&rft.pages=271-286&rft.issn=0129-6264&rft.eissn=1793-642X&rft_id=info:doi/10.1142/S0129626404001878&rft_dat=%3Cpascalfrancis_cross%3E16059591%3C/pascalfrancis_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1818-81660c0b921748a5e554d8492e69db8f6a14adcfebf60dbd922f3ad711924e263%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |