This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Buffer Analysis for a Data Sharing Environment with Skewed Data Access
April 1994 (vol. 6 no. 2)
pp. 331-337

Examines the effect of skewed database access on the transaction response time in a multisystem data sharing environment, where each computing node has access to shared data on disks, and has a local buffer of recently accessed granules. Skewness in data access can increase data contention since most accesses go to few data items. For the same reason, it can also increase the buffer hit probability. We quantify the resultant effect on the transaction response time, which depends not only on the various system parameters but also on the concurrency control (CC) protocol. Furthermore, the CC protocol can give rise to rerun transactions that have different buffer hit probabilities. In a multisystem environment, when a data block gets updated by a system, any copies of that block in other systems' local buffers are invalidated. Combining these effects, we find that higher skew does not necessarily lead to worse performance, and that with skewed access, optimistic CC is more robust than pessimistic CC. Examining the buffer hit probability as a function of the buffer size, we find that the effectiveness of additional buffer allocation can be broken down into multiple regions that depend on the access frequency distribution.

[1] A. Dan, "Performance analysis of data sharing environments," inACM Distinguished Dissertation Series. Cambridge, MA: MIT Press, 1992.
[2] A. Danet al., "The effect of skewed data access on buffer hits and data contention in a data sharing environment," inProc. 16th Int. Conf. Very Large Data Bases, pp. 419-431, Aug. 1990.
[3] A. Dan and P. S. Yu, "Performance analysis of coherency control policies through lock retention," inProc. ACM SIGMOD, San Diego, June 1992, pp. 114-123.
[4] A. Dan and P. S. Yu, "Performance analysis of buffer coherency policies in a multisystern data sharing environment,"IEEE Trans. Parallel Distributed Syst., vol. 4, no. 3, pp. 289-305, Mar. 1993.
[5] A. Dan, P. S. Yu, and J.-Y. Chung, "Database access characterization for buffer hit prediction," inProc. 9th Int. Conf. Data Eng., Vienna, Austria, Apr., 1993, pp. 134-143.
[6] D. M. Dias, B. R. Iyer, J. T. Robinson, and P. S. Yu, "Integrated concurrency-coherency controls for multisystem data sharing,"IEEE Trans. Software Eng., vol. 15, no. 4, pp. 437-448, Apr. 1989.
[7] N. P. Kronenberg, H. M. Levy, and W. D. Strecker, "VAXcluster: A closely-coupled distributed system,"ACM Trans. Comput. Syst., vol. 4., no. 2, pp. 130-146, May 1986.
[8] C. Mohan and I. Narang, "Efficient locking and caching of data in the multi-system shared disks transaction environment,"Proc. Int. Conf. Extending Database Technol., Vienna, Mar. 1992.
[9] R. Rahm, "Primary copy synchronization for dB-sharing,"Inform. Syst., vol. 11, no. 4, pp. 275-286, 1986.
[10] P. S. Yu, D. M. Dias, J. T. Robinson, B. R. Iyer, and D. W. Cornell, "On coupling multi-systems through data sharing,"Proc. IEEE, vol. 75, no. 5, pp. 573-587, May 1987.
[11] P. S. Yu and D. M. Dias, "Analysis of hybrid concurrency control schemes for a high data contention environment,"IEEE Trans: Software Eng., vol. 18, no. 2, pp. 118-129, Feb. 1992.
[12] K. Barker and M.T. Ozzu, "Reliable Transaction Execution in Multidatabase Systems,"Proc. First Int'l Workshop Interoperability Multidatabase Systems, IEEE CS Press, Los Alamitos, Calif., Order No. 2205, 1991, pp. 344-347.
[13] P. S. Yu and A. Dan, "Effect of system dynamics on coupling architectures for transaction processing," inProc. Int. Conf. Data Eng., Tempe, AZ, Feb. 1992, pp. 458-469.

Index Terms:
transaction processing; buffer storage; concurrency control; distributed databases; protocols; buffer analysis; disk storage; skewed data access; skewed database access; transaction response time; multisystem data sharing environment; local buffer; recently accessed granules; data contention; buffer hit probability; concurrency control protocol; rerun transactions; data block updating; performance; optimistic concurrency control; pessimistic concurrency control; buffer size; robustness; additional buffer allocation; access frequency distribution; transaction processing; analytic model
Citation:
A. Dan, D.M. Dias, P.S. Yu, "Buffer Analysis for a Data Sharing Environment with Skewed Data Access," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 2, pp. 331-337, April 1994, doi:10.1109/69.277776
Usage of this product signifies your acceptance of the Terms of Use.