{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:46:48Z","timestamp":1743083208042,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642259586"},{"type":"electronic","value":"9783642259593"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-25959-3_5","type":"book-chapter","created":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T19:50:29Z","timestamp":1325447429000},"page":"61-75","source":"Crossref","is-referenced-by-count":7,"title":["Towards a Universal Construction for Transaction-Based Multiprocess Programs"],"prefix":"10.1007","author":[{"given":"Tyler","family":"Crain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Imbs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Raynal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ansar, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, Y.: Steal-on-abort: Dynamic Transaction Reordering to Reduce Conflicts in Transactional Memory. In: 4th Int\u2019l ACM Sigplan Conference on High Performance Embedded Architectures and Compilers, HiPEAC 2009, pp. 4\u201318. ACM Press (2009)","key":"5_CR1","DOI":"10.1007\/978-3-540-92990-1_3"},{"key":"5_CR2","series-title":"LNCS","first-page":"3","volume-title":"OPODIS 2009","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Milani, A.: Transactional Scheduling for Read-Dominated Workloads. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 3\u201317. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91\u2013100. ACM Press (1993)","key":"5_CR3","DOI":"10.1145\/167088.167119"},{"doi-asserted-by":"crossref","unstructured":"Chuong, P., Ellen, F., Ramachandran, V.: A Universal Construction for Wait-free Transaction Friendly Data Structures. In: Proc. 22th Int\u2019l ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010), pp. 335\u2013344. ACM Press (2010)","key":"5_CR4","DOI":"10.1145\/1810479.1810538"},{"doi-asserted-by":"crossref","unstructured":"Crain, T., Imbs, D., Raynal, M.: Towards a universal construction for transaction-based multiprocess programs. Tech Report 1971, IRISA, Universit\u00e9 de Rennes (F), 16 pages (2011)","key":"5_CR5","DOI":"10.1007\/978-3-642-25959-3_5"},{"doi-asserted-by":"crossref","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic Performance Tuning of Word-Based Software Transactional Memory. In: Proc. 13th Int\u2019l ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2008), pp. 237\u2013246. ACM Press (2008)","key":"5_CR6","DOI":"10.1145\/1345206.1345241"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s004460100065","volume":"14","author":"S. Fr\u00f8lund","year":"2001","unstructured":"Fr\u00f8lund, S., Guerraoui, R.: X-Ability: a Theory of Replication. Distributed Computing\u00a014(4), 231\u2013249 (2001)","journal-title":"Distributed Computing"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87779-0_21","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in Transactional Memories. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 305\u2013319. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Towards a Theory of Transactional Contention Managers. In: Proc. 24th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 258\u2013264. ACM Press (2005)","key":"5_CR9","DOI":"10.1145\/1073814.1073863"},{"doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142lka, M.: Principles of Transactional Memory. In: Synthesis Lectures on Distributed Computing Theory, 180 pages. Morgan & Claypool Publishers (2010)","key":"5_CR10","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M.P. Herlihy","year":"1991","unstructured":"Herlihy, M.P.: Wait-Free Synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.M.: Software Transactional Memory for Dynamic-Sized Data Structures. In: Proc. 22nd Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 92\u2013101. ACM Press (2003)","key":"5_CR12","DOI":"10.1145\/872035.872048"},{"doi-asserted-by":"crossref","unstructured":"Herlihy, M.P., Moss, J.E.B.: Transactional Memory: Architectural Support for Lock-free Data Structures. In: Proc. 20th ACM Int\u2019l Symposium on Computer Architecture (ISCA 1993), pp. 289\u2013300. ACM Press (1993)","key":"5_CR13","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"7","key":"5_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/1364782.1364800","volume":"51","author":"J. Larus","year":"2008","unstructured":"Larus, J., Kozyrakis, C.: Transactional Memory: Is TM the Answer for Improving Parallel Programming? Communications of the ACM\u00a051(7), 80\u201389 (2008)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Maldonado, W., Marlier, P., Felber, P., Lawall, J., Muller, G., Revi\u00e8re, E.: Deadline-Aware Scheduling for Software Transactional Memory. In: 41th IEEE\/IFIP Int\u2019l Conference on Dependable Systems and Networks \u2019DSN 2011. IEEE CPS Press (June 2011)","key":"5_CR16","DOI":"10.1109\/DSN.2011.5958224"},{"doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, Fast and Practical Blocking and Non-Blocking Concurrent Queue Algorithms. In: Proc. 15th Int\u2019l ACM Symposium on Principles of Distributed Computing (PODC 1996), pp. 267\u2013275. ACM Press (1996)","key":"5_CR17","DOI":"10.1145\/248052.248106"},{"doi-asserted-by":"crossref","unstructured":"Spear, M.F., Silverman, M., Dalessandro, L., Michael, M.M., Scott, M.L.: Implementing and Exploiting Inevitability in Software Transactional Memory. In: Proc. 37th Int\u2019l Conference on Parallel Processing (ICPP 2008). IEEE Press (2008)","key":"5_CR18","DOI":"10.1109\/ICPP.2008.55"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software Transactional Memory. Distributed Computing\u00a010(2), 99\u2013116 (1997)","journal-title":"Distributed Computing"},{"unstructured":"Wamhoff, J.-T., Fetzer, C.: The Universal Transactional Memory Construction. Tech Report, 12 pages, University of Dresden, Germany (2010)","key":"5_CR20"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-16023-3_32","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J.-T. Wamhoff","year":"2010","unstructured":"Wamhoff, J.-T., Riegel, T., Fetzer, C., Felber, P.: RobuSTM: A Robust Software Transactional Memory. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 388\u2013404. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25959-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,24]],"date-time":"2021-12-24T01:48:56Z","timestamp":1640310536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25959-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642259586","9783642259593"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25959-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}