Analytical modelling of a hierarchical buffer for a data sharing environment

In a data sharing environment, where a number of loosely coupled computing nodes share a common storage subsystem, the effectiveness of a private buffer at each node is limited due to the multi-system invalidation effect, particularly under a non-uniform data access pattern. A global shared buffer can be introduced to alleviate this problem either as a disk cache or shared memory. In this paper we developed an approximate analytic model to evaluate different shared buffer management policies (SBMPs) which differ in their choice of data granules to be put into the shared buffer. The analytic model can be used to study the trade-offs of different SBMPs and the impact of different buffer allocations between shared and private buffers. The effects of various parameters, such as, the probability of update, the number of nodes, the sizes of private and shared buffer, etc., on the performance of SBMPS are captured in the analytic model. A detailed simulation model is also developed to validate the analytic model. We show that dependency between the contents of the private and shared buffers can play an important role in determining the effectiveness of the shared buffer particularly for a small number of nodes.

[1]  R. J. Beynon,et al.  Computers , 1985, Comput. Appl. Biosci..

[2]  Nancy P. Kronenberg,et al.  VAXcluster: a closely-coupled distributed system , 1986, TOCS.

[3]  Philip S. Yu,et al.  Integrated Concurrency-Coherency Controls for Multisystem Data Sharing , 1989, IEEE Trans. Software Eng..

[4]  D. R. Cheriton,et al.  Multi-level shared caching techniques for scalability in VMP-M/C , 1989, ISCA '89.

[5]  Peter P. Uhrowczik,et al.  IMS/VS: An Evolving System , 1982, IBM Syst. J..

[6]  J. T. Robinson,et al.  On coupling multi-systems through data sharing , 1987, Proceedings of the IEEE.

[7]  Stephen S. Lavenberg,et al.  Computer Performance Modeling Handbook , 1983, Int. CMG Conference.

[8]  Asit Dan,et al.  An approximate analysis of the LRU and FIFO buffer replacement schemes , 1990, SIGMETRICS '90.

[9]  Philip S. Yu,et al.  The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment , 1990, VLDB.

[10]  Philip S. Yu,et al.  Tradeoffs Between Coupling Small and Large Processors for Transaction Processing , 1988, IEEE Trans. Computers.

[11]  Philip S. Yu,et al.  Impact of large memory on the performance of optimistic concurrency control schemes , 1990, Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications.

[12]  Asit Dan Performance analysis of data sharing environments , 1990, ACM distinguished dissertations.

[13]  J. Hennessy,et al.  Characteristics of performance-optimal multi-level cache hierarchies , 1989, ISCA '89.