Abstract
CS (Conflict Serializability) is a recently proposed relaxer correctness criterion that can increase transactional memory’s parallelism. DDA (Distributed Dependency-Aware) model is currently proposed to implement CS in distributed STM (Software Transactional Memory) for the first time. However, its transactions detect conflicts individually via detecting cycles in PG (Precedence Graph) and cause extra runtime overhead, especially at the condition that the transactions access lots of objects or the PG is large. In this paper, we propose an approach to make each cycle in PG detected by those transactions, which construct this cycle, together in parallel way, instead of detecting cycle individually. Experimental results show that the average execution time and communication cost of all transactions, including aborted ones, in our approach, can be decreased to 76% and 78% of those in DDA respectively. Its speedup is up to 2.56× against baseDSTM, employing two-phase locking.
This is a preview of subscription content, log in via an institution to check access.
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
Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: Proceeding of 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 247–258. ACM Press (2008)
Kotselidis, C., Ansari, M., Jarvis, K., Luján, M., Kirkham, C., Watson, I.: DiSTM: A software transactional memory framework for clusters. In: Proceeding of 37th International Conference on Parallel Processing, pp. 51–58. IEEE Press (2008)
Bieniusa, A., Fuhrmann, T.: Consistency in hindsight: A fully decentralized STM algorithm. In: Proceeding of 24th IEEE International Parallel and Distributed Processing Symposium, pp. 1–12. IEEE Press (2010)
Zhang, B., Ravindran, B.: Brief announcement: on enhancing concurrency in distributed transactional memory. In: Proceeding of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 73–74. ACM Press (2010)
Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: Proceeding of 21th Annual Symposium on Parallelism in Algorithms and Architectures, pp. 59–68. ACM Press (2009)
Aydonat, U., Abdelrahman, T.: Serializability of transactions in software transactional memory. In: Proceeding of 2nd ACM SIGPLAN Workshop on Transactional Computing (2008)
Ramadan, H.E., Rossbach, C.J., Witchel, E.: Dependence-aware transactional memory for increased concurrency. In: Proceeding of 41st Annual IEEE/ACM International Symposium on Microarchitecture, pp. 246–257. IEEE Computer Society (2008)
Ramadan, H.E., Roy, I., Herlihy, M., Witchel, E.: Committing conicting transactions in an STM. In: Proceeding of 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 163–172. ACM Press (2009)
Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: Proceeding of 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 16–25. ACM Press (2010)
Krivokapić, N., Kemper, A., Gudes, E.: Deadlock detection in distributed database systems: a new algorithm and a comparative performance analysis. VLDB Journal 8(2), 79–100 (1999)
Quislant, R., Gutierrez, E., Plata, O., Zapata, E.L.: Multiset signatures for transactional memory. In: Proceeding of 25th International Conference on Supercomputing, pp. 43–52. ACM Press (2011)
Minh, C.C., Chung, J.W., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: Proceeding of IEEE International Symposium on Workload Characterization, pp. 35–46. IEEE Press (2008)
Tabba, F., Hay, A.W., Goodman, J.R.: Transactional conict decoupling and value prediction. In: Proceeding of 25th International Conference on Supercomputing, pp. 33–42. ACM Press (2011)
Riegel, T., Marlier, P., Nowack, M., Felber, P., Fetzer, C.: Optimizing hybrid transactional memory: The importance of nonspeculative operations. In: Proceeding of 21th Annual Symposium on Parallelism in Algorithms and Architectures (2011)
Titos-Gil, R., Negi, A., Acacio, M.E., Garcia, J.M., Stenstrom, P.: Zebra: A data-centric, hybrid-policy hardware transactional memory design. In: Proceeding of 25th International Conference on Supercomputing (2011)
Blake, G., Dreslinski, R.G., Mudge, T.: Proactive Transaction Scheduling for Contention Management. In: Proceeding of 42nd Annual IEEE/ACM International Symposium on Microarchitecture, pp. 156–167. ACM Press (2009)
Guerraoui, R., Kapalka, M.: On the Correctness of Transactional Memory. In: Proceeding of 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 175–184. ACM Press (2008)
Herlihy, M.P., Wing, J.M.: Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12(3), 463–492 (1990)
Aydonat, U., Abdelrahman, T.S.: Hardware support for relaxed concurrency control in transactional memory. In: Proceeding of 43rd Annual IEEE/ACM International Symposium on Microarchitecture, pp. 15–26. IEEE Press (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Y., Jin, H., Liao, X. (2013). DDASTM: Ensuring Conflict Serializability Efficiently in Distributed STM. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-38027-3_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38026-6
Online ISBN: 978-3-642-38027-3
eBook Packages: Computer ScienceComputer Science (R0)