{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:34:35Z","timestamp":1725831275362},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662486528"},{"type":"electronic","value":"9783662486535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48653-5_16","type":"book-chapter","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T18:46:01Z","timestamp":1443811561000},"page":"232-247","source":"Crossref","is-referenced-by-count":0,"title":["Grasping the Gap Between Blocking and Non-Blocking Transactional Memories"],"prefix":"10.1007","author":[{"given":"Petr","family":"Kuznetsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srivatsan","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P.: The complexity of obstruction-free implementations. J. ACM 56(4) (2009)","DOI":"10.1145\/1538902.1538908"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M., Vechev, M.: Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated. In: POPL, pp. 487\u2013498 (2011)","DOI":"10.1145\/1925844.1926442"},{"issue":"12","key":"16_CR3","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1109\/TC.2012.159","volume":"62","author":"H Attiya","year":"2013","unstructured":"Attiya, H., Hillel, E.: The cost of privatization in software transactional memory. IEEE Trans. Computers 62(12), 2531\u20132543 (2013)","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/s00224-010-9304-5","volume":"49","author":"H Attiya","year":"2011","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. Theory of Computing Systems 49(4), 698\u2013719 (2011)","journal-title":"Theory of Computing Systems"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Dalessandro, L., Spear, M.F., Scott, M.L.: NOrec: streamlining STM by abolishing ownership records. In: PPOPP, pp. 67\u201378 (2010)","DOI":"10.1145\/1837853.1693464"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11864219_14","volume-title":"Distributed Computing","author":"D Dice","year":"2006","unstructured":"Dice, D., Shalev, O., Shavit, N.N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"16_CR7","unstructured":"Dice, D., Shavit, N.: What really makes transactions fast? In: Transact (2006)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: TLRW: return of the read-write lock. In: SPAA, pp. 284\u2013293 (2010)","DOI":"10.1145\/1810479.1810531"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/08072646X","volume":"41","author":"F Ellen","year":"2012","unstructured":"Ellen, F., Hendler, D., Shavit, N.: On the inherent sequentiality of concurrent objects. SIAM J. Comput. 41(3), 519\u2013536 (2012)","journal-title":"SIAM J. Comput."},{"key":"16_CR10","unstructured":"Ennals, R.: The lightweight transaction library. \n                    http:\/\/sourceforge.net\/projects\/libltx\/files\/"},{"key":"16_CR11","unstructured":"Ennals, R.: Software transactional memory should not be obstruction-free (2005)"},{"key":"16_CR12","unstructured":"Fraser, K.: Practical lock-freedom. Technical report, Cambridge University Computer Laborotory (2003)"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On obstruction-free transactions. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 304\u2013313. ACM, New York (2008)","DOI":"10.1145\/1378533.1378587"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: POPL, pp. 404\u2013415 (2009)","DOI":"10.1145\/1594834.1480931"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: Principles of transactional memory. In: Synthesis Lectures on Distributed Computing Theory. Morgan and Claypool (2010)","DOI":"10.2200\/S00253ED1V01Y201009DCT004"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Prog. Lang. Syst. 13(1), 123\u2013149 (1991)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"16_CR17","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: double-ended queues as an example. In: ICDCS, pp. 522\u2013529 (2003)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: PODC, pp. 92\u2013101 (2003)","DOI":"10.1145\/872035.872048"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-25873-2_22","volume-title":"Principles of Distributed Systems","author":"M Herlihy","year":"2011","unstructured":"Herlihy, M., Shavit, N.: On the nature of progress. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 313\u2013328. Springer, Heidelberg (2011)"},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-25873-2_9","volume-title":"Principles of Distributed Systems","author":"P Kuznetsov","year":"2011","unstructured":"Kuznetsov, P., Ravi, S.: On the cost of concurrency in transactional memory. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 112\u2013127. Springer, Heidelberg (2011)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-21909-7_40","volume-title":"Parallel Computing Technologies","author":"P Kuznetsov","year":"2015","unstructured":"Kuznetsov, P., Ravi, S.: Progressive transactional memory in time and space. In: Malyshkin, V. (ed.) PaCT 2015. LNCS, vol. 9251, pp. 410\u2013425. Springer, Heidelberg (2015)"},{"key":"16_CR22","unstructured":"Kuznetsov, P., Ravi, S.: Why transactional memory should not be obstruction-free (2015). \n                    http:\/\/arxiv.org\/abs\/1502.02725"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/11561927_26","volume-title":"Distributed Computing","author":"VJ Marathe","year":"2005","unstructured":"Marathe, V.J., Scherer III, W.N., Scott, M.L.: Adaptive software transactional memory. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 354\u2013368. Springer, Heidelberg (2005)"},{"key":"16_CR24","unstructured":"McKenney, P.E.: Memory barriers: a hardware view for software hackers. Linux Technology Center, IBM Beaverton, June 2010"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in STM. In: PODC, pp. 16\u201325 (2010)","DOI":"10.1145\/1835698.1835704"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Tabba, F., Moir, M., Goodman, J.R., Hay, A.W., Wang, C.: Nztm: Nonblocking zero-indirection transactional memory. In: SPAA 2009, pp. 204\u2013213. ACM, New York (2009)","DOI":"10.1145\/1583991.1584048"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48653-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:40:40Z","timestamp":1559259640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48653-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486528","9783662486535"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48653-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}