Larchant: persistence by reachability in distributed shared memory through garbage collection

Proceedings of 16th International Conference on Distributed Computing Systems Pub Date : 1996-05-27 DOI:10.1109/ICDCS.1996.507987

P. Ferreira, M. Shapiro

引用次数: 35

Abstract

We consider a shared store based on distributed shared memory (DSM) supporting persistence by reachability (PBR) a very simple data sharing model for a distributed system. This DSM+PBR model is based on distributed garbage collection (GC). Within a general model for DSM+PBR, we specify a distributed GC algorithm that is efficient and scalable. Its main features are: (i) independent collection of memory subsets (even when replicated), (ii) orthogonal from coherence, (iii) asynchrony, and (iv) a simple heuristic to collect cycles avoiding extra I/O costs. We briefly describe our implementation and show some performance results.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

大容量:通过垃圾收集在分布式共享内存中的可达性实现持久性

我们认为基于分布式共享内存(DSM)的共享存储支持可达性持久性(PBR)，这是一种非常简单的分布式系统数据共享模型。该DSM+PBR模型基于分布式垃圾收集(GC)。在DSM+PBR的通用模型中，我们指定了一种高效且可扩展的分布式GC算法。它的主要特点是:(i)独立收集内存子集(即使在复制时)，(ii)与一致性正交，(iii)异步，以及(iv)简单的启发式收集周期，避免额外的i /O成本。我们简要地描述了我们的实现，并展示了一些性能结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Proceedings of 16th International Conference on Distributed Computing Systems

自引率

0.00%

发文量

期刊最新文献

An extended network scheduling model Distributed priority queues on hypercube architectures An embeddable and extendable language for large-scale programming on the Internet Conservative garbage collection on distributed shared memory systems Optimal deadlock detection in distributed systems based on locally constructed wait-for graphs