John Heidemann / Papers / Performance of Cache Coherence in Stackable Filing

Performance of Cache Coherence in Stackable Filing
John Heidemann and Gerald Popek
University of California, Los Angeles, Computer Science Department

Citation

John Heidemann and Gerald Popek. Performance of Cache Coherence in Stackable Filing. Proceedings of the 15th Symposium on Operating Systems Principles. ACM. 110–127. [PDF] [alt PDF]

Abstract

Stackable design of filing systems constructs sophisticated services from multiple, independently developed layers. This approach has been advocated to address development problems from code re-use, to extensibility, to version management. Individual layers of such a system often need to cache data to improve performance or provide desired functionality. When access to different layers is allowed, cache incoherencies can occur. Without a cache coherence solution, layer designers must either restrict layer access and flexibility or compromise the layered structure to avoid potential data corruption. The value of modular designs such as stacking can be questioned without a suitable solution to this problem. This paper presents a general cache coherence architecture for stackable filing, including a standard approach to data identification as a key component to layered coherence protocols. We also present a detailed performance analysis of one implementation of stack cache-coherence, which suggests that very low overheads can be achieved in practice.

Bibtex Citation

@incollection{Heidemann95c,
  author = {Heidemann, John and Popek, Gerald},
  title = {Performance of Cache Coherence in Stackable Filing},
  booktitle = {Proceedings of the 15th Symposium on Operating Systems Principles},
  publisher = {ACM},
  year = {1995},
  sortdate = {1995-12-01},
  project = {ficus},
  jsubject = {stacking},
  month = dec,
  pages = {110--127},
  jlocation = {geoff: home library},
  keywords = {stacking, i405, cache coherence},
  url = {https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann95c.html},
  psurl = {https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann95c.ps.gz},
  pdfurl = {https://ant.isi.edu/%7ejohnh/PAPERS/Heidemann95c.pdf},
  myorganization = {University of California, Los Angeles, Computer Science Department},
  copyrightholder = {ACM},
  copyrightterms = {
  	Permission to make digital or
  	hard copies of part or all 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 new 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, to republish, to post on servers or to
  	redistribute to lists, requires prior specific permission
  	and/or a fee. Request Permissions from
  	Publications Dept, ACM Inc.,
  	Fax +1 (212) 869--0481, or
  	permissions@acm.org.
  }
}

Copyright

Permission to make digital or hard copies of part or all 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 new 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, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request Permissions from Publications Dept, ACM Inc., Fax +1 (212) 869–0481, or permissions@acm.org.
Copyright © by John Heidemann