Moreau, L. (1998) Hierarchical Distributed Reference Counting. In: Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98). 57--67. Full text not available from this repository.
Abstract
Massively distributed computing is a challenging problem for
garbage collection algorithm designers as it raises the issue of scalability. The high number of hosts involved in a computation can require large tables for reference listing, whereas the lack of information sharing between hosts in a same locality can entail redundant GC traffic. In this paper, we argue that a conceptual hierarchical organisation of massive distributed computations can solve this problem. By conceptual hierarchical organisation, we mean that processors are still able to communicate in a peer to peer manner using their usual communication mechanism, but GC messages will be routed as if processors were organised in hierarchy. We present an extension of a distributed reference counting algorithm that uses such a hierarchical organisation. It allows us to bound table sizes by the number of hosts in a domain, and it allows us to share GC information between hosts in a same locality in order to reduce cross-network GC traffic.
| Item Type: | Conference or Workshop Item | ||
|---|---|---|---|
| Creator/Authors: |
| ||
| Research Group: | Current ECS Groups > Web and Internet Science Old ECS Groups > Intelligence, Agents, Multimedia | ||
| ISBN: | 1-58113-114-3 | ||
| Date: | 1998 | ||
| Information about this record: | |||
| Performance Indicator: | EZ~01~01~04 | ||
| Citations: | ISI: 1, Google Scholar: 7 | ||
| ID Code: | 2752 | ||
| Last Modified: | 23 Sep 2011 10:25 | ||
| Deposited On: | 20 Mar 2000 by Moreau, Luc | ||
Tools & Metadata
Corrections
ECS staff and postgraduates may modify this record
