Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Lazy Reference Counting for Transactional Storage Systems Miguel Castro, Atul Adya, Barbara Liskov
 

Summary: Lazy Reference Counting for Transactional Storage Systems
Miguel Castro, Atul Adya, Barbara Liskov
Laboratory for Computer Science,
Massachusetts Institute of Technology,
545 Technology Square, Cambridge, MA 02139
fcastro,adya,liskovg@lcs.mit.edu
Abstract
Hac is a novel technique for managing 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 speci c problem: how to discard indirection table
entries in an indirect pointer swizzling scheme. Hacuses
lazy reference counting to solve this problem. Instead
of eagerly updating reference counts when objects are
modi ed and eagerly freeing unreferenced entries, which
can be expensive, we perform these operations lazily in
the background while waiting for replies to fetch and
commit requests. Furthermore, we introduce a number

  

Source: Adya, Atul - Google Labs

 

Collections: Computer Technologies and Information Sciences