Abstract
Shared memory applications are principal to solve a big number of problems in distributed systems. From high performance applications, where the different computational units use this technique to simplify its designs (and often improve the performance) to database applications, where a replicated database can also be considered as a flavor of shared memory for the different involved nodes.
Any of these applications use replication as the basis for the implementation of shared memory, and they frequently share common characteristics in respect to access locality to particular portions of the global state. Replication is also a technique commonly used in distributed systems in order to provide fault tolerance.
Many techniques have been designed to perform the necessary consistency management for the different views on a replicated memory system. Some of these techniques try to take advantadge of the access locality, by propagating the changes performed by any node in a lazy style (i.e. as late as possible). Nevertheless, lazy update protocols have proven to have an undesirable behavior due to their high abortion rate in scenarios with high degree of access conflicts.
In this paper, we present the problem of the abortion rate in such protocols from a statistical point of view, in order to provide an expression capable to predict the probability for an object to be out of date during the execution of a transaction in a contextual environment.
It is also suggested a pseudo-optimistic technique that makes use of this expression to reduce the abortion rate caused by accesses to out of date objects.
The proposal is validated by means of an empirical study of the behavior of the expression, including measurements of a real implementation. Finally, we discuss the application of these results to improve lazy update protocols, providing a technique to determine the theoretical boundaries of the improvement.
This work has been partially supported by the EU grant IST-1999-20997 and the Spanish grant TIC2003-09420-C02-01.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rahm, E.: Empirical performance evaluation of concurrency and coherency control protocols for database sharing systems. ACM Trans. on Database Sys. 18(2), 333–377 (1993)
Gray, J., Helland, P., O’Neil, P., Shasha, D.: The dangers of replication and a solution. In: Proc. of the 1996 ACM SIGMOD International Conference on Management of Data, Montreal, Quebec, Canada, pp. 173–182 (1996)
Muñoz, F., Irún, L., Galdámez, P., Bernabéu, J., Bataller, J., Bañuls, M.C.: Globdata: A platform for supporting multiple consistency modes. In: Press, A. (ed.) Information Systems and Databases (ISDB 2002), Tokyo, pp. 244–249 (2002)
Instituto Tecnológico de Informática: GlobData Web Site (2002), Accessible in URL: http://globdata.iti.es
Rodrigues, L., Miranda, H., Almeida, R., Martins, J., Vicente, P.: The globdata fault-tolerant replicated distributed object database. In: Proceedings of the First Eurasian Conference on Advances in Information and Communication Technology, Teheran, Iran, Oct 2002, pp. 426–433 (2002)
Irún-Briz, L.: Implementable Models for Replicated and Fault-Tolerant Geographically Distributed Databases. Consistency Management for GlobData. PhD thesis, Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, Valencia, Spain (2003), Available at http://www.iti.upv.es/~lirun
Irún, L., Muñoz, F., Decker, H., Bernabéu-Aubán, J.M.: Copla: A platform for eager and lazy replication in networked databases. In: 5th Int. Conf. Enterprise Information Systems (ICEIS 2003), Angers, France, vol. 1, pp. 273–278 (2003)
Decker, H., Muñoz, F., Irún, L., Calero, A., Castro, F., Esparza, J., Bataller, J., Galdámez, P., Bernabéu, J.: Enhancing the availability of networked databases services by replication and consistency maintenance. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 531–535. Springer, Heidelberg (2003)
Irún-Briz, L., Muñoz-Escoí, F.D., Bernabéu-Aubán, J.M.: An improved optimistic and fault-tolerant replication protocol. In: Bianchi-Berthouze, N. (ed.) DNIS 2003. LNCS, vol. 2822, Springer, Heidelberg (2003)
Chandy, K.M., Misra, J.: Distributed simulation: A case study in design and verification of distributed programs. IEEE Transactions on Software Engineering SE-5(5), 440–452 (1979)
Bagrodia, R.L., Chandy, K.M., Misra, J.: A message-based approach to discrete-event simulation. IEEE Transactions on Software Engineering SE-13, 654–665 (1987)
Bagrodia, R.L.: An integrated approach to the design and performance evaluation of distributed systems. In: Proceedings of the First International Conference on Systems Integration, Morristown, NJ, USA, pp. 662–671. IEEE Computer Society Press, Los Alamitos (1990)
Liskov, B.: Practical uses of synchronized clocks in distributed systems. In: Logrippo, L. (ed.) Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC 1990), Montéal, Québec, Canada, pp. 1–10. ACM Press, New York (1991)
Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425, Cornell University, Computer Science Department (1994)
Agrawal, D., Alonso, G., El Abbadi, A., Stanoi, I.: Exploiting atomic broadcast in replicated databases. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds.) Euro-Par 1997. LNCS, vol. 1300, pp. 496–503. Springer, Heidelberg (1997)
Wiesmann, M., Schiper, A., Pedone, F., Kemme, B., Alonso, G.: Database replication techniques: A three parameter classification. In: Proc. of the 19th IEEE Symposium on Reliable Distributed Systems (SRDS 2000), Nuernberg, Germany, pp. 206–217 (2000)
Breitbart, Y., Korth, H.F.: Replication and consistency: being lazy helps sometimes. In: Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems, Tucson, Arizona, EE.UU., pp. 173–184. ACM Press, New York (1997)
Holliday, J., Agrawal, D., Abbadi, A.E.: Database replication: If you must be lazy, be consistent. In: Proceedings of 18th Symposium on Reliable Distributed Systems SRDS 1999, Lausanne, Switzerland, pp. 304–305. IEEE Computer Society Press, Los Alamitos (1999)
Chundi, P., Rosenkrantz, D.J., Ravi, S.S.: Deferred updates and data placement in distributed databases. In: Proceedings of the 12th International Conference on Data Engineering, New Orleans, Louisiana, pp. 469–476. IEEE Computer Society Press, Los Alamitos (1996)
Bernstein, P.A., Shipman, D.W., Rothnie, J.B.: Concurrency control in a system for distributed databases (SDD-1). ACM Transactions on Database Systems 5(1), 18–51 (1980)
Kung, H.T., Robinson, J.T.: On optimistic methods for concurrency control. ACM Transactions on Database Systems 6(2), 213–226 (1981)
Bernstein, P.A., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison Wesley, Reading (1987)
Keleher, P., Cox, A.L., Zwaenepoel, W.: Lazy release consistency for software distributed shared memory. In: Proc. of the 19th Annual Int’l Symp. on Computer Architecture (ISCA 1992), Queensland, Australia, pp. 13–21 (1992)
Amza, C., Cox, A.L., Dwarkadas, S., Keleher, P., Lu, H., Rajamony, R., Yu, W., Zwaenepoel, W.: Treadmarks: Shared memory computing on networks of workstations. IEEE Computer 29(2), 18–28 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Irún-Briz, L., Muñoz-Escoí, F.D., Bernabéu-Aubán, J.M. (2005). Analysis of the Abortion Rate on Lazy Replication Protocols . In: Daydé, M., Dongarra, J., Hernández, V., Palma, J.M.L.M. (eds) High Performance Computing for Computational Science - VECPAR 2004. VECPAR 2004. Lecture Notes in Computer Science, vol 3402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11403937_34
Download citation
DOI: https://doi.org/10.1007/11403937_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25424-9
Online ISBN: 978-3-540-31854-5
eBook Packages: Computer ScienceComputer Science (R0)