Robust, distributed references and acyclic garbage collection

Shapiro, Marc; Dickman, Peter; Plainfossé, David

doi:10.1145/135419.135448

Cited by 60 publications

(35 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…during the migration process) is tracked by forwarding pointers (e.g. SSP chains [25]). Also, the routing table is periodically updated using a gossiping protocol for shortening/repairing chains or updating stale entries (e.g.…”

Section: Routingmentioning

confidence: 99%

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Bonvin

Papaioannou

Aberer

2010

Proceedings of the 1st ACM Symposium on Cloud Computing

109

View full text Add to dashboard Cite

Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while different availability levels per application or per data item may be required. In this paper, we propose a self-managed key-value store that dynamically allocates the resources of a data cloud to several applications in a costefficient and fair way. Our approach offers and dynamically maintains multiple differentiated availability guarantees to each different application despite failures. We employ a virtual economy, where each data partition (i.e. a key range in a consistent-hashing space) acts as an individual optimizer and chooses whether to migrate, replicate or remove itself based on net benefit maximization regarding the utility offered by the partition and its storage and maintenance cost. As proved by a game-theoretical model, no migrations or replications occur in the system at equilibrium, which is soon reached when the query load and the used storage are stable. Moreover, by means of extensive simulation experiments, we have proved that our approach dynamically finds the optimal resource allocation that balances the query processing overhead and satisfies the availability objectives in a cost-efficient way for different query rates and storage requirements. Finally, we have implemented a fully working prototype of our approach that clearly demonstrates its applicability in real settings.

show abstract

Section: Routingmentioning

confidence: 99%

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Bonvin

Papaioannou

Aberer

2010

Proceedings of the 1st ACM Symposium on Cloud Computing

109

View full text Add to dashboard Cite

show abstract

“…The distributed garbage collector is based on referencelisting (Shapiro et al, 1992) and is responsible for managing inter-site references, i.e., references between local pages to pages placed at other sites (both incoming and out-going). This information is stored in lists of scions and stubs organized, for efficiency reason, by referring/referred site.…”

Section: Distributed Colletormentioning

confidence: 99%

Turning the Web Into an Effective Knowledge Repository

Veiga

Ferreira

2004

Proceedings of the 4th International Workshop on Pattern Recognition in Information Systems

View full text Add to dashboard Cite

Abstract:To fulfill Vannevar Bush's Memex and Ted Nelson's Hyper-Text vision of a world-size interconnected store of knowledge, there are still quite a few rough-edges to solve. There are no large-scale mechanisms to enforce referential integrity in the WWW. The weight of dynamically generated content w.r.t. static content has progressed enormously. Preserving accessibility to this type of content raises new issues. We propose a system, comprised of a distributed web-proxy and cache architecture, to access and automatically manage web content, static and dynamically generated. It is combined with an implementation of a cyclic distributed garbage collection algorithm for wide-area memory. It correctly handles dynamic content, enforces referential integrity on the web, and is complete w.r.t minimizing storage waste.

show abstract

“…The local collection is based on tracing from a root set that includes the local persistent root objects as well as local objects that are referenced from other nodes, called the secondary roots. Different variants of distributed reference counting employ different methods and information to track the secondary roots, ranging from one-bit counts [Ali84,JJ92] to weighted reference counts [Bev87] to reference lists, in which each node tracks the identities of the nodes that refer to its objects [Bis77,SDP92,BENOW93].…”

Section: The Problem Contextmentioning

confidence: 99%

Collecting cyclic distributed garbage by controlled migration

Maheshwari¹,

Liskov²

1995

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing - PODC '95

View full text Add to dashboard Cite

Distributed reference counting provides timely and faulttolerant garbage collection in large distributed systems, but it fails to collect cyclic garbage distributed across nodes. A common proposal is to migrate all objects on a garbage cycle to a single node, where they can be collected by the local collector. However, existing schemes have practical problems due to unnecessary migration of objects. We present solutions to these problems: our scheme avoids migration of live objects, batches objects to avoid a cascade of migration messages, and short-cuts the migration path to avoid multiple migrations. We use simple estimates to detect objects that are highly likely to be cyclic garbage and to select a node to which such objects are migrated. The scheme has low overhead, and it preserves the decentralized and fault-tolerant nature of distributed reference counting and migration.

show abstract

Robust, distributed references and acyclic garbage collection

Abstract: We propose efficient,

Cited by 60 publications

References 18 publications

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

A self-organized, fault-tolerant and scalable replication scheme for cloud storage

Turning the Web Into an Effective Knowledge Repository

Collecting cyclic distributed garbage by controlled migration

Contact Info

Product

Resources

About