We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

Lazy Reference Counting for Transactional Storage Systems

Thumbnail Image
Download
Name

MIT-LCS-TM-567.pdf

Size

795.66 KB

Format

Adobe PDF

Checksum (MD5)

6c1b676d2acecbb153986ee39334e975

Author(s)
Castro, Miguel
•
Adya, Atul
•
Liskov, Barbara
Date Issued
October 1997
Series/Report no.
MIT-LCS-TM-567
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.