Article

Free access

HAC: hybrid adaptive caching for distributed storage systems

Authors:

Miguel Castro,

Atul Adya,

Barbara Liskov,

Andrew C. MyersAuthors Info & Claims

SOSP '97: Proceedings of the sixteenth ACM symposium on Operating systems principles

Pages 102 - 115

https://doi.org/10.1145/268998.266666

Published: 01 October 1997 Publication History

PDF eReader

References

[1]

A. Adya, R. Gruber, B. Liskov, and U. Maheshwari, Efficient optimistic concurrency control using loosely synchronized clocks. In ACM $IGMOD Int. Conf. on Management of Data, pages 23-34, San Jose, CA, May 1995.]]

Digital Library

Google Scholar

[2]

P.B. Bishop. Computer systems with a very largo address space and garbage collection. Technical Report MIT-LCS- TR-178, M1T Lab for Computer Science, May 1977,]]

Google Scholar

[3]

M. Blaze. Caching in Large-Scale Distributed File Systems, Technical Report TR-397-92, Princeton University, Jan. 1993,]]

Google Scholar

[4]

P. Butterworth, A. Otis, and L Stein. The GemStone database management system. Comm. of the ACM, 34(10):64-77, Oct, 1991.]]

Digital Library

Google Scholar

[5]

M. Carey et al. Storage management for objects in EXODUS. In W. Kim and E Lochovsky, editors, Object-Oriented Con. cepts, Databases, and Applications. Addison-Wesley, 1989,]]

Digital Library

Google Scholar

[6]

M.J. Carey et al. A Status Report on the 007 OODBMS Benchmarking Effort. In ACM Conf. on Object-Oriented Programming Systems, Languages, and Applicatlons (OOPSLA), pages 414-426, 1994.]]

Digital Library

Google Scholar

[7]

M.J. carey et al. Shoring up persistent applications. InACM $1GMOD Int. Conf. on Management of Data, pages 383-394, Minneapolis, MN, May 1994.]]

Digital Library

Google Scholar

[8]

M. Castro, A. Adya, and B. Liskov. L~y reference counting for transactional storage systems. Technical Report MIT-LCS- TM-567, MIT Lab for Computer Science, June 1997,]]

Digital Library

Google Scholar

[9]

M.J. Carey, D.J. DeWitt, and J. E Naughton. The 007 benchmark. Technical Report; Revised Version dated 7/2111994 1140, University of Wisconsin-Madison, 1994. ftp://ftp.cs.wisc.edu/OO7.]]

Google Scholar

[10]

M. Carey, M. Franklin, and M. Zaharioudakis. Free-Grained Sharing in a Page Server OODBMS. In ACM $IGMOD Int. Conf. on Management of Data, pages 359-370, may 1994.]]

Digital Library

Google Scholar

[11]

E.E. Chang and R. H. Katz. Exploiting inheritance and structure semantics for effective clustering and buffering in an object-oriented dbms. in ACM S{GMOD Int. Conf. on Management of Data, pages 348-357, Portland, OR, May 1989.]]

Digital Library

Google Scholar

[12]

J.S. Chase, H. M. Levy, M. J. Feeley, and E. D. Lazowska. Sharing and protection in a single-address-space operating system. A CM Transactions on Computer Systems, 12(1):271-307, Feb. 1995,]]

Digital Library

Google Scholar

[13]

E J, Corbato. A Paging Experiment with the Multics System, in Festschrifi: In Honor of P. M. Morse, pages 217-228. M1T Press, 1969.]]

Google Scholar

[14]

O. Deux et al. The story of 02. IEEE Trans. on Knowledge and Data Engineering, 2(1):91-108, Mar. 1990.]]

Digital Library

Google Scholar

[15]

M. Day. Client cache management in a distributed object database. Technical Report MIT/LCS/TR-652, MIT Laboratory for Computer Science, 1995.]]

Digital Library

Google Scholar

[16]

M. Day, B. Liskov, U. Maheshwari, and A. C. Myers. References to remote mobile objects in Thor. ACM Letters on Programming Languages and Systems (LOPLAS), pages 115-- 126, Mar. 1994.]]

Digital Library

Google Scholar

[17]

S, Ghemawat. The Modified Object Buffer: a Storage Manamement Technique for Object-Oriented Databases. PhD thesis, Massachusetts Institute of Technology, 1995.]]

Digital Library

Google Scholar

[18]

(2, Gerlhof, A. Kemper, and G. Moerkotte. On the cost of monitoring and reorganization of object bases for clustering. Sigmod Record, 25(3):22-27, September 1996.]]

Digital Library

Google Scholar

[19]

J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann, San Mateo, California, 1993.]]

Digital Library

Google Scholar

[20]

R. Gmber. Optimism vs. Locking: A Study of Concurrency Control for Client-Server Object-Oriented Databases. PhD thesis, MIT, Feb. 1997.]]

Google Scholar

[21]

T. Johnson and D. Shasha. A low overhead high performance buffer replacement algorithm. In Proceedings oflnternational Conference on Very Large Databases, pages 439--450,1994.]]

Digital Library

Google Scholar

[22]

W. Kim, J. E Garm, N. Ballou, andD. Woelk. Architecture of the ORION next-generation database system. IEEE Trans. on Knowledge and Data Engineering, 2(1):109-124, Mar. 1990.]]

Digital Library

Google Scholar

[23]

T. Kaehler and G. Krasner. LOOM--Large Object-Oriented Memory for $malltalk-80 Systems, pages 298-307. Morgan Kaufmann Publishers, inc., San Mateo, CA, 1990.]]

Digital Library

Google Scholar

[24]

A. Kemper and D. Kossmann. Dual-buffer strategies in object bases. In 20th Int. Conf. on Very Large Data Bases (VLDB), pages 427--438, Santiago, Chile, 1994.]]

Digital Library

Google Scholar

[25]

D. Kossmann. EjJ~cient Main-Memory Management of Persistent Objects. Shaker-Verlag, 52064 Aachen, Germany, 1995. Phi) thesis, RWTH Aachen.]]

Google Scholar

[26]

D. Kossmann. Private communication. June 30, 1997.]]

Google Scholar

[27]

B. Liskov, A. Adya, M. Castro, M. Day, S. Ghemawat, R. Gmber, U. Maheshwaxi, A. C. Myers, and L. Shrira. Safe and efficient sharing of persistent objects in Thor. In ACM SIGMOD Int. Conf. on Management of Data, pages 318-329, June 1996.]]

Digital Library

Google Scholar

[28]

B. Liskov, D. Curtis, M. Day, S. Ghemawhat, R. Gmber, P. Johnson, and A.C. Myers. Them reference manual. Prograrmning Methodology Group Memo 88, MIT Lab. for Computer Science, Feb. 1994. Also available at http://www, pmg. Ics.mit. edu/papers/thetareff.]]

Google Scholar

[29]

C. Lamb, G. Landis, J. Orenstein, and D. Weinreb. The ObjectStore database system. Comn~ of the ACM, 34(10):50--63, Oct. 1991.]]

Digital Library

Google Scholar

[30]

J. C. Mogul, J. E Barlett, R. N. Mayo, and A. Srivastava. Performance Implications of Multiple Pointer Sizes. In USENIX 1995 Tech. Conf. on UNIX and Advanced Computing Systems, pages 187-200, New Orleans, LA, 1995.]]

Digital Library

Google Scholar

[31]

W.J. Mclver and R. King. Self adaptive, on-line reclustering of complex object data. In A CM SlGMOD Int. Conf. on Management of Data, pages 407-418, Minneapolis, MN, May 1994.]]

Digital Library

Google Scholar

[32]

J.E.B. Moss. Design of the Mneme persistent object store. ACM Transactions on Information Systems (TOI$), 8(2):103- 139, Apr. 1990.]]

Digital Library

Google Scholar

[33]

J.E.B. Moss. Working with persistent objects: To swizzle or not to swizzle. IEEE Transactions on Software Engineering, 18(3):657--673, August 1992.]]

Digital Library

Google Scholar

[34]

M. McAuliffe and M. Solomon. A trace-based simulation of pointer swizzling techniques. In Int. Conf. on Data Engineering (ICDE), pages 52-61, Mar. 1995.]]

Digital Library

Google Scholar

[35]

Ontos, Inc., Lower, MA. Ontos Rej~rence Manual, 1992.]]

Google Scholar

[36]

E.J. O'Neil, P. E. O'Neil, and G. Weikum. The LRU-K page replacement algorithm for database disk buffering, in A CM $IGMOD Int. Conf. on Management of Data, pages 297-306, Washington, D.C., May 1993.]]

Digital Library

Google Scholar

[37]

J. O'Toole and L. Shrirm Opportunistic log: Efficient installation reads in a reliable object server, in Proceedings of the Symp. on Operating System Design and Implementation (OSDI), pages 39--48, Monterey, CA, 1994.]]

Digital Library

Google Scholar

[38]

3. O'Toole and L. Sh6m. Shared data management needs adaptive methods. In Proceedings of lEEE Workshop on Hot Topics in Operating Systems, Orcas Island, 1995.]]

Digital Library

Google Scholar

[39]

J. Robinson and N. Devarakonda. Data cache management using frequency-based replacement In Proceedings of ACM SlGMETRIC$ Conference on Measurement and Modeling of Computer Systems, pages 134-142, 1990.]]

Digital Library

Google Scholar

[40]

Seagate Technology, Inc. http://www, seagate.com/, 1997.]]

Google Scholar

[41]

V. Singhal, S. V. Kakkad, and P~ R. Wilson. Texas: An efficient, portable persistent store. In 5th Int. Workshop on Persistent Object Systems (PO$), pages 11-33, San Miniato, Italy, Sept. 1992.]]

Google Scholar

[42]

l'. W. Stamos. Static grouping of small objects to enhance performance.ofa paged virtual memory. ACM Trans. on Progranuning Languages and Systems (TOPLA$), 2(2):155-180, May 1984.]]

Digital Library

Google Scholar

[43]

M. Tsangaris and J. E Naughton. On the performance of object clustering techniques. In A CM 8IGMOD Int. Conf. on Management of Data, pages 144-153, San Diego, CA, June 1992.]]

Digital Library

Google Scholar

[44]

S. White and D. DeWitt. A performance study of alternative object faulting and pointer swizzling strategies. In 18th Inn Conf. on Very Large Data Bases (VLDB), pages 419--431, Vancouver, British Columbia, Aug. 1992.]]

Digital Library

Google Scholar

[45]

S.J. White and D. J. Dewitt. QuickStore: A high performance mapped object store. In ACM $IGMOD Int. Conf. on Management of Data, pages 395--406, Minneapolis, MN, May 1994.]]

Digital Library

Google Scholar

[46]

S.J. White and D. $. DeWi(t. Implementing crash recovery in QuickStore: A performance study. In ACM SIGMOD Int. Conf. on Management of Data, pages 187-198, San Jose, CA, June 1995.]]

Digital Library

Google Scholar

Cited By

View all

Gessert FWingerath WRitter NGessert FWingerath WRitter N(2024)Caching in Forschung und IndustrieSchnelles und skalierbares Cloud-Datenmanagement10.1007/978-3-031-54388-3_5(91-140)Online publication date: 3-May-2024
https://doi.org/10.1007/978-3-031-54388-3_5
Gessert FWingerath WRitter NGessert FWingerath WRitter N(2020)Caching in Research and IndustryFast and Scalable Cloud Data Management10.1007/978-3-030-43506-6_5(85-130)Online publication date: 15-May-2020
https://doi.org/10.1007/978-3-030-43506-6_5
Liao JTrahay FCai ZXiong HChen SIshikawa Y(2019)Fine Granularity and Adaptive Cache Update Mechanism for Client CachingIEEE Systems Journal10.1109/JSYST.2018.286690513:2(1587-1598)Online publication date: Jun-2019
https://doi.org/10.1109/JSYST.2018.2866905
Show More Cited By

Index Terms

HAC: hybrid adaptive caching for distributed storage systems
1. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Distributed memory

Recommendations

HAC: hybrid adaptive caching for distributed storage systems
A Novel Cluster Head Selection Method based on HAC Algorithm for Energy Efficient Wireless Sensor Network
IPAC '15: Proceedings of the International Conference on Intelligent Information Processing, Security and Advanced Communication

Improving the lifetime of wireless sensor networks (WSNs) remains an open and active research area. One of the challenging problems in this field is the partitioning of a WSN into disjoint clusters so that the network lifetime is maximized. In ...
K-means, HAC and FCM Which Clustering Approach for Arabic Text?
SITA'20: Proceedings of the 13th International Conference on Intelligent Systems: Theories and Applications

Today, we are witnessing rapid growth in Web resources that allow Internet users to express and share their ideas, opinions, and judgments on a variety of issues. Several classification approaches have been proposed to classify textual data. But all ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SOSP '97: Proceedings of the sixteenth ACM symposium on Operating systems principles

October 1997

303 pages

ISBN:0897919165

DOI:10.1145/268998

Chairmen:
Michel Banâtre
IRISA/INRIA
,
Henry Levy
Univ. of Washington, Seattle
,
Editor:
William M. Waite
Univ. of Colorado, Boulder

ACM SIGOPS Operating Systems Review Volume 31, Issue 5
Dec. 1997
301 pages
ISSN:0163-5980
DOI:10.1145/269005
Chairmen:
Michel Banâtre
IRISA/INRIA
,
Henry Levy
Univ. of Washington, Seattle
,
Editor:
William M. Waite
Univ. of Colorado, Boulder
Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SOSP97

Sponsor:

SIGOPS
INRIA

SOSP97: Sixteenth ACM Symposium on Operating Systems Principles

October 5 - 8, 1997

Saint Malo, France

Acceptance Rates

Overall Acceptance Rate 174 of 961 submissions, 18%

Upcoming Conference

SOSP '25

Sponsor:
sigops

ACM SIGOPS 31st Symposium on Operating Systems Principles

October 13 - 16, 2025

Seoul , Republic of Korea

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

29
Total Citations
View Citations
788
Total Downloads

Downloads (Last 12 months)96
Downloads (Last 6 weeks)20

Reflects downloads up to 16 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gessert FWingerath WRitter NGessert FWingerath WRitter N(2024)Caching in Forschung und IndustrieSchnelles und skalierbares Cloud-Datenmanagement10.1007/978-3-031-54388-3_5(91-140)Online publication date: 3-May-2024
https://doi.org/10.1007/978-3-031-54388-3_5
Gessert FWingerath WRitter NGessert FWingerath WRitter N(2020)Caching in Research and IndustryFast and Scalable Cloud Data Management10.1007/978-3-030-43506-6_5(85-130)Online publication date: 15-May-2020
https://doi.org/10.1007/978-3-030-43506-6_5
Liao JTrahay FCai ZXiong HChen SIshikawa Y(2019)Fine Granularity and Adaptive Cache Update Mechanism for Client CachingIEEE Systems Journal10.1109/JSYST.2018.286690513:2(1587-1598)Online publication date: Jun-2019
https://doi.org/10.1109/JSYST.2018.2866905
Liu JArden OGeorge MMyers AMurray TSabelfeld ABauer L(2017)FabricJournal of Computer Security10.3233/JCS-1580525:4-5(367-426)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.3233/JCS-15805
Badam APai VAndersen DRatnasamy S(2011)SSDAllocProceedings of the 8th USENIX conference on Networked systems design and implementation10.5555/1972457.1972479(211-224)Online publication date: 30-Mar-2011
https://dl.acm.org/doi/10.5555/1972457.1972479
Liu JGeorge MVikram KQi XWaye LMyers AMatthews JAnderson T(2009)FabricProceedings of the ACM SIGOPS 22nd symposium on Operating systems principles10.1145/1629575.1629606(321-334)Online publication date: 11-Oct-2009
https://dl.acm.org/doi/10.1145/1629575.1629606
Anandharaj GAnitha R(2009)A Distributed Cache Management Architecture for Mobile Computing Environments2009 IEEE International Advance Computing Conference10.1109/IADCC.2009.4809087(642-648)Online publication date: Mar-2009
https://doi.org/10.1109/IADCC.2009.4809087
Cheung BWang C(2006)A segment-based DSM supporting large shared object spaceProceedings of the 20th international conference on Parallel and distributed processing10.5555/1898953.1898972(37-37)Online publication date: 25-Apr-2006
https://dl.acm.org/doi/10.5555/1898953.1898972
Teller PSeelam S(2006)Insights into providing dynamic adaptation of operating system policiesACM SIGOPS Operating Systems Review10.1145/1131322.113133940:2(83-89)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.1145/1131322.1131339
Cheung BCho-Li Wang (2006)A segment-based DSM supporting large shared object spaceProceedings 20th IEEE International Parallel & Distributed Processing Symposium10.1109/IPDPS.2006.1639277(10 pp.)Online publication date: 2006
https://doi.org/10.1109/IPDPS.2006.1639277
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

HAC: hybrid adaptive caching for distributed storage systems

A Novel Cluster Head Selection Method based on HAC Algorithm for Energy Efficient Wireless Sensor Network

K-means, HAC and FCM Which Clustering Approach for Arabic Text?