A parallel asynchronous garbage collection algorithm for distributed systems
The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on knowledge and data engineering 1991-03, Vol.3 (1), p.100-107 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 107 |
|---|---|
| container_issue | 1 |
| container_start_page | 100 |
| container_title | IEEE transactions on knowledge and data engineering |
| container_volume | 3 |
| creator | Bagherzadeh, N. Heng, S. Wu, C. |
| description | The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.< > |
| doi_str_mv | 10.1109/69.75893 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_29521527</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>75893</ieee_id><sourcerecordid>28538071</sourcerecordid><originalsourceid>FETCH-LOGICAL-c280t-185d235506203fcf11c0095f4ca86f2dbeb7f1a079ceda128b909355be6d885c3</originalsourceid><addsrcrecordid>eNqF0c9LwzAUB_AgCs4pePWWg4iXzvfSpkmOQ_wFAy96LmmabJGumUl32H9vZ8euO70H78OXB19CbhFmiKCeSjUTXKr8jEyQc5kxVHg-7FBgVuSFuCRXKf0AgBQSJ2Qxpxsdddvaluq068wqhi5sE13qWOulpSYMN9P70FHdLkP0_WpNXYi08amPvt72tqFpl3q7Ttfkwuk22ZvDnJLv15ev5_ds8fn28TxfZIZJ6DOUvGE551AyyJ1xiAZAcVcYLUvHmtrWwqEGoYxtNDJZK1CDr23ZSMlNPiUPY-4mht-tTX219snYttWdHX6vmOIMOROnoeS5BIGn4d4hywf4OEITQ0rRumoT_VrHXYVQ7QuoSlX9FzDQ-0OmTka3LurO-HT0hRIMynJgdyPz1trjdYz4A1D2jOk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>25380123</pqid></control><display><type>article</type><title>A parallel asynchronous garbage collection algorithm for distributed systems</title><source>IEEE Electronic Library (IEL)</source><creator>Bagherzadeh, N. ; Heng, S. ; Wu, C.</creator><creatorcontrib>Bagherzadeh, N. ; Heng, S. ; Wu, C.</creatorcontrib><description>The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.< ></description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/69.75893</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Clocks ; Computational modeling ; Computer science; control theory; systems ; Computer simulation ; Concurrent computing ; Distributed computing ; Exact sciences and technology ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Parallel algorithms ; Performance evaluation ; Safety ; Sequential analysis ; Software ; Synchronization</subject><ispartof>IEEE transactions on knowledge and data engineering, 1991-03, Vol.3 (1), p.100-107</ispartof><rights>1992 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c280t-185d235506203fcf11c0095f4ca86f2dbeb7f1a079ceda128b909355be6d885c3</citedby><cites>FETCH-LOGICAL-c280t-185d235506203fcf11c0095f4ca86f2dbeb7f1a079ceda128b909355be6d885c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/75893$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/75893$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4972066$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bagherzadeh, N.</creatorcontrib><creatorcontrib>Heng, S.</creatorcontrib><creatorcontrib>Wu, C.</creatorcontrib><title>A parallel asynchronous garbage collection algorithm for distributed systems</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><description>The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.< ></description><subject>Applied sciences</subject><subject>Clocks</subject><subject>Computational modeling</subject><subject>Computer science; control theory; systems</subject><subject>Computer simulation</subject><subject>Concurrent computing</subject><subject>Distributed computing</subject><subject>Exact sciences and technology</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Parallel algorithms</subject><subject>Performance evaluation</subject><subject>Safety</subject><subject>Sequential analysis</subject><subject>Software</subject><subject>Synchronization</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1991</creationdate><recordtype>article</recordtype><recordid>eNqF0c9LwzAUB_AgCs4pePWWg4iXzvfSpkmOQ_wFAy96LmmabJGumUl32H9vZ8euO70H78OXB19CbhFmiKCeSjUTXKr8jEyQc5kxVHg-7FBgVuSFuCRXKf0AgBQSJ2Qxpxsdddvaluq068wqhi5sE13qWOulpSYMN9P70FHdLkP0_WpNXYi08amPvt72tqFpl3q7Ttfkwuk22ZvDnJLv15ev5_ds8fn28TxfZIZJ6DOUvGE551AyyJ1xiAZAcVcYLUvHmtrWwqEGoYxtNDJZK1CDr23ZSMlNPiUPY-4mht-tTX219snYttWdHX6vmOIMOROnoeS5BIGn4d4hywf4OEITQ0rRumoT_VrHXYVQ7QuoSlX9FzDQ-0OmTka3LurO-HT0hRIMynJgdyPz1trjdYz4A1D2jOk</recordid><startdate>19910301</startdate><enddate>19910301</enddate><creator>Bagherzadeh, N.</creator><creator>Heng, S.</creator><creator>Wu, C.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>19910301</creationdate><title>A parallel asynchronous garbage collection algorithm for distributed systems</title><author>Bagherzadeh, N. ; Heng, S. ; Wu, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c280t-185d235506203fcf11c0095f4ca86f2dbeb7f1a079ceda128b909355be6d885c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1991</creationdate><topic>Applied sciences</topic><topic>Clocks</topic><topic>Computational modeling</topic><topic>Computer science; control theory; systems</topic><topic>Computer simulation</topic><topic>Concurrent computing</topic><topic>Distributed computing</topic><topic>Exact sciences and technology</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Parallel algorithms</topic><topic>Performance evaluation</topic><topic>Safety</topic><topic>Sequential analysis</topic><topic>Software</topic><topic>Synchronization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bagherzadeh, N.</creatorcontrib><creatorcontrib>Heng, S.</creatorcontrib><creatorcontrib>Wu, C.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bagherzadeh, N.</au><au>Heng, S.</au><au>Wu, C.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A parallel asynchronous garbage collection algorithm for distributed systems</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><date>1991-03-01</date><risdate>1991</risdate><volume>3</volume><issue>1</issue><spage>100</spage><epage>107</epage><pages>100-107</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>The problem of distributed garbage collection is discussed. An algorithm for parallel distributed asynchronous garbage collection is presented. The liveness and safety properties of this method are demonstrated. The algorithm does not require a global clock, complex termination detection methods, or distributed synchronization techniques. A new color code is introduced to distinguish between local cells (black) and those that are exclusively accessible from the remote pointers (gray). The mutator operation is revised to handle a multiple mutator scheme on a given local memory. Simulation results show that the developed distributed and parallel algorithm performs much better than the sequential method as tested on a Balance 8000 computer.< ></abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/69.75893</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1041-4347 |
| ispartof | IEEE transactions on knowledge and data engineering, 1991-03, Vol.3 (1), p.100-107 |
| issn | 1041-4347 1558-2191 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29521527 |
| source | IEEE Electronic Library (IEL) |
| subjects | Applied sciences Clocks Computational modeling Computer science control theory systems Computer simulation Concurrent computing Distributed computing Exact sciences and technology Memory and file management (including protection and security) Memory organisation. Data processing Parallel algorithms Performance evaluation Safety Sequential analysis Software Synchronization |
| title | A parallel asynchronous garbage collection algorithm for distributed systems |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T01%3A07%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20parallel%20asynchronous%20garbage%20collection%20algorithm%20for%20distributed%20systems&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Bagherzadeh,%20N.&rft.date=1991-03-01&rft.volume=3&rft.issue=1&rft.spage=100&rft.epage=107&rft.pages=100-107&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/69.75893&rft_dat=%3Cproquest_RIE%3E28538071%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=25380123&rft_id=info:pmid/&rft_ieee_id=75893&rfr_iscdi=true |