Lazy Reference Counting for Transactional Storage Systems

HAC is a novel technique for managing the direct the client cache in a distributed, persistent object storage system. In a companion paper, we showed that it outperforms other techniques across a wide range of cache sizes and workloads. This report describes HAC's solution to a specific problem...

Full description

Bibliographic Details
Main Authors: Castro, Miguel, Adya, Atul, Liskov, Barbara
Published: 2023
Online Access:https://hdl.handle.net/1721.1/149270
_version_ 1811091112812609536
author Castro, Miguel
Adya, Atul
Liskov, Barbara
author_facet Castro, Miguel
Adya, Atul
Liskov, Barbara
author_sort Castro, Miguel
collection MIT
description HAC is a novel technique for managing the direct the client cache in a distributed, persistent object storage system. In a companion paper, we showed that it outperforms other techniques across a wide range of cache sizes and workloads. This report describes HAC's solution to a specific problem: how to discard indirection table entries in an indirect pointer swizzling scheme.
first_indexed 2024-09-23T14:57:13Z
id mit-1721.1/149270
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T14:57:13Z
publishDate 2023
record_format dspace
spelling mit-1721.1/1492702023-03-30T03:20:06Z Lazy Reference Counting for Transactional Storage Systems Castro, Miguel Adya, Atul Liskov, Barbara HAC is a novel technique for managing the direct the client cache in a distributed, persistent object storage system. In a companion paper, we showed that it outperforms other techniques across a wide range of cache sizes and workloads. This report describes HAC's solution to a specific problem: how to discard indirection table entries in an indirect pointer swizzling scheme. 2023-03-29T14:40:28Z 2023-03-29T14:40:28Z 1997-10 https://hdl.handle.net/1721.1/149270 MIT-LCS-TM-567 application/pdf
spellingShingle Castro, Miguel
Adya, Atul
Liskov, Barbara
Lazy Reference Counting for Transactional Storage Systems
title Lazy Reference Counting for Transactional Storage Systems
title_full Lazy Reference Counting for Transactional Storage Systems
title_fullStr Lazy Reference Counting for Transactional Storage Systems
title_full_unstemmed Lazy Reference Counting for Transactional Storage Systems
title_short Lazy Reference Counting for Transactional Storage Systems
title_sort lazy reference counting for transactional storage systems
url https://hdl.handle.net/1721.1/149270
work_keys_str_mv AT castromiguel lazyreferencecountingfortransactionalstoragesystems
AT adyaatul lazyreferencecountingfortransactionalstoragesystems
AT liskovbarbara lazyreferencecountingfortransactionalstoragesystems