2013 IEEE 33rd International Conference on Distributed Computing Systems (2007)
June 25, 2007 to June 27, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2007.86
Ashish Gehani , University of Notre Dame, Notre Dame, IN
Xuwen Yu , University of Notre Dame, Notre Dame, IN
Surendar Chandra , University of Notre Dame, Notre Dame, IN
This work focuses on scenarios that require the storage of large amounts of data. Such systems require the ability to either continuously increase the storage space or reclaim space by deleting contents. Traditionally, storage systems relegated object reclamation to applications. In this work, content creators explicitly annotate the object using a temporal importance function. The storage system uses this information to evict less important objects. The challenge is to design importance functions that are simple and expressive. We describe a two step temporal importance function. We introduce the notion of storage importance density to quantify the importance levels for which the storage is full. Using extensive simulations and observations of a university wide lecture video capture and storage application, we show that our abstraction allows the users to express the amount of persistence for each individual object.
Ashish Gehani, Xuwen Yu, Surendar Chandra, "Automated Storage Reclamation Using Temporal Importance Annotations", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 12, 2007, doi:10.1109/ICDCS.2007.86