Lazy Reference Counting for Transactional Storage Systems
| dc.contributor.author | Castro, Miguel | en_US |
| dc.contributor.author | Adya, Atul | en_US |
| dc.contributor.author | Liskov, Barbara | en_US |
| dc.date.accessioned | 2023-03-29T14:40:28Z | |
| dc.date.available | 2023-03-29T14:40:28Z | |
| dc.date.issued | 1997-10 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149270 | |
| dc.description.abstract | 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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-567 | |
| dc.title | Lazy Reference Counting for Transactional Storage Systems | en_US |
