Abstract
This chapter presents a performance analysis of the three families of cache consistency maintenance algorithms described in Chapter 4, namely, Server-based Two-Phase Locking (S2PL), Optimistic Two-Phase Locking (O2PL), and Callback Locking (CB). Seven algorithms are studied under a range of workloads and system configurations. In addition to measuring the performance of these specific algorithms, the experiments presented here also provide insight into many of the tradeoffs involved in cache maintenance, including: optimism vs. pessimism, detection vs. avoidance, and invalidation vs. propagation. The analysis is performed using the simulation model described in Chapter 3. The parameter settings and workloads that are used in the study are described in the following section. The results are then presented in the two subsequent sections. Performance results for the server-based 2PL and optimistic 2PL algorithms are presented first. The performance of the callback locking algorithms is then studied and compared to the better of the S2PL and O2PL algorithms.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Franklin, M.J. (1996). Performance of Cache Consistency Algorithms. In: Client Data Caching. The Kluwer International Series in Engineering and Computer Science, vol 354. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1363-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1363-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8588-5
Online ISBN: 978-1-4613-1363-2
eBook Packages: Springer Book Archive