File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICPADS.1994.590347
- Scopus: eid_2-s2.0-0028755866
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Practical distributed garbage collection for networks with asynchronous clocks and message delay
Title | Practical distributed garbage collection for networks with asynchronous clocks and message delay |
---|---|
Authors | |
Keywords | Computers Computer architecture |
Issue Date | 1994 |
Publisher | IEEE. |
Citation | Proceedings Of The Internatoinal Conference On Parallel And Distributed Systems - Icpads, 1994, p. 406-411 How to Cite? |
Abstract | Distributed garbage collection over a message passage network is discussed in this paper. Traditionally, this can be done by reference counting, which is fast but cannot reclaim cyclic structures or by graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage and guaranteed to reclaim cyclic garbage. Our scheme does not rely on synchronized clocks nor zero message delay and is thus practical. |
Persistent Identifier | http://hdl.handle.net/10722/45538 |
ISSN | 2023 SCImago Journal Rankings: 0.397 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwan, Doug | en_HK |
dc.contributor.author | Chin, Francis | en_HK |
dc.date.accessioned | 2007-10-30T06:28:44Z | - |
dc.date.available | 2007-10-30T06:28:44Z | - |
dc.date.issued | 1994 | en_HK |
dc.identifier.citation | Proceedings Of The Internatoinal Conference On Parallel And Distributed Systems - Icpads, 1994, p. 406-411 | en_HK |
dc.identifier.issn | 1521-9097 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/45538 | - |
dc.description.abstract | Distributed garbage collection over a message passage network is discussed in this paper. Traditionally, this can be done by reference counting, which is fast but cannot reclaim cyclic structures or by graph traversal, e.g. mark-and-sweep or time stamping, which is capable of reclaiming cyclic structures but is slow. We propose a combined scheme which is fast in reclaiming acyclic garbage and guaranteed to reclaim cyclic garbage. Our scheme does not rely on synchronized clocks nor zero message delay and is thus practical. | en_HK |
dc.format.extent | 607281 bytes | - |
dc.format.extent | 5052 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS | en_HK |
dc.rights | ©1994 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Computers | en_HK |
dc.subject | Computer architecture | en_HK |
dc.title | Practical distributed garbage collection for networks with asynchronous clocks and message delay | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1521-9097&volume=&spage=406&epage=411&date=1994&atitle=Practical+distributed+garbage+collection+for+networks+with+asynchronous+clocks+and+message+delay | en_HK |
dc.identifier.email | Chin, Francis:chin@cs.hku.hk | en_HK |
dc.identifier.authority | Chin, Francis=rp00105 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/ICPADS.1994.590347 | en_HK |
dc.identifier.scopus | eid_2-s2.0-0028755866 | en_HK |
dc.identifier.hkuros | 1186 | - |
dc.identifier.spage | 406 | en_HK |
dc.identifier.epage | 411 | en_HK |
dc.identifier.scopusauthorid | Kwan, Doug=7003387945 | en_HK |
dc.identifier.scopusauthorid | Chin, Francis=7005101915 | en_HK |
dc.identifier.issnl | 1521-9097 | - |