This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Caching Hints in Distributed Systems
January 1987 (vol. 13 no. 1)
pp. 48-54
D.B. Terry, Computer Science Laboratory, Xerox Palo Alto Research Center
Caching reduces the average cost of retrieving data by amortizing the lookup cost over several references to the data. Problems with maintaining strong cache consistency in a distributed system can be avoided by treating cached information as hints. A new approach to managing caches of hints suggests maintaining a minimum level of cache accuracy, rather than maximizing the cache hit ratio, in order to guarantee performance improvements. The desired accuracy is based on the ratio of lookup costs to the costs of detecting and recovering from invalid cache entries. Cache entries are aged so that they get purged when their estimated accuracy falls below the desired level. The age thresholds are dictated solely by clients' accuracy requirements instead of being suggested by data storage servers or system administrators.
Index Terms:
resource location, Cache consistency, caching, computer-communication networks, data accuracy, database management, distributed data management, distributed systems, functional lifetimes, hints
Citation:
D.B. Terry, "Caching Hints in Distributed Systems," IEEE Transactions on Software Engineering, vol. 13, no. 1, pp. 48-54, Jan. 1987, doi:10.1109/TSE.1987.232834
Usage of this product signifies your acceptance of the Terms of Use.