The University of Southampton
University of Southampton Institutional Repository

Hierarchical Distributed Reference Counting

Hierarchical Distributed Reference Counting
Hierarchical Distributed Reference Counting
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.
1-58113-114-3
57--67
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8
Moreau, Luc
033c63dd-3fe9-4040-849f-dfccbe0406f8

Moreau, Luc (1998) Hierarchical Distributed Reference Counting. Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98). 57--67 . (doi:10.1145/301589.286867).

Record type: Conference or Workshop Item (Paper)

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.

Text
ismm98 - Accepted Manuscript
Download (14MB)

More information

Published date: 1998
Additional Information: Address: Vancouver, BC, Canada
Venue - Dates: Proceedings of the First ACM SIGPLAN International Symposium on Memory Management (ISMM'98), 1998-01-01
Organisations: Web & Internet Science

Identifiers

Local EPrints ID: 252752
URI: https://eprints.soton.ac.uk/id/eprint/252752
ISBN: 1-58113-114-3
PURE UUID: d42ce1ae-9e5f-49ac-a9dc-c2b1d4cb5eb9
ORCID for Luc Moreau: ORCID iD orcid.org/0000-0002-3494-120X

Catalogue record

Date deposited: 20 Mar 2000
Last modified: 20 Jul 2019 01:17

Export record

Altmetrics

Contributors

Author: Luc Moreau ORCID iD

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×