{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T21:51:07Z","timestamp":1672609867976},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T00:00:00Z","timestamp":1453334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00446-015-0261-8","type":"journal-article","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T19:15:03Z","timestamp":1453403703000},"page":"251-277","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Universal constructions that ensure disjoint-access parallelism and wait-freedom"],"prefix":"10.1007","volume":"29","author":[{"given":"Faith","family":"Ellen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panagiota","family":"Fatourou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleftherios","family":"Kosmas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,21]]},"reference":[{"key":"261_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Dauber, D., Touitou, D.: Wait-free made fast. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp. 538\u2013547. ACM (1995)","DOI":"10.1145\/225058.225271"},{"key":"261_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations (extended abstract). In: Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 111\u2013120. ACM (1997)","DOI":"10.1145\/259380.259431"},{"key":"261_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Moir, M.: Universal constructions for multi-object operations. In: Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 184\u2013193. ACM (1995)","DOI":"10.1145\/224964.224985"},{"issue":"12","key":"261_CR4","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1109\/71.819952","volume":"10","author":"JH Anderson","year":"1999","unstructured":"Anderson, J.H., Moir, M.: Universal constructions for large objects. IEEE Trans. Parallel Distrib. Syst. 10(12), 1317\u20131332 (1999)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"5","key":"261_CR5","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1145\/502102.502105","volume":"48","author":"H Attiya","year":"2001","unstructured":"Attiya, H., Dagan, E.: Improved implementations of binary universal operations. J. ACM 48(5), 1013\u20131037 (2001)","journal-title":"J. ACM"},{"key":"261_CR6","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fatourou, P.: Disjoint access parallelism in software transactional memory. Transactional Memory: Foundations. Algorithms, Tools and Applications, vol. 8913, pp. 72\u201397. Springer, Lecture Notes in Computing Sciences (2015)","DOI":"10.1007\/978-3-319-14720-8_4"},{"issue":"12\u201314","key":"261_CR7","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1016\/j.tcs.2010.12.049","volume":"412","author":"H Attiya","year":"2011","unstructured":"Attiya, H., Hillel, E.: Highly concurrent multi-word synchronization. Theor. Comput. Sci. 412(12\u201314), 1243\u20131262 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"261_CR8","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s00224-012-9420-5","volume":"52","author":"H Attiya","year":"2013","unstructured":"Attiya, H., Hillel, E.: Built-in coloring for highly-concurrent doubly-linked lists. Theory Comput. Syst. 52(4), 729\u2013762 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"261_CR9","doi-asserted-by":"crossref","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 Comput. Syst. 49(4), 698\u2013719 (2011)","journal-title":"Theory Comput. Syst."},{"key":"261_CR10","doi-asserted-by":"crossref","unstructured":"Barnes, G.: A method for implementing lock-free shared-data structures. In: Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 261\u2013270. ACM (1993)","DOI":"10.1145\/165231.165265"},{"key":"261_CR11","doi-asserted-by":"crossref","unstructured":"Berenson, H., Bernstein, P.A., Gray, J., Melton, J., O\u2019Neil, E.J., O\u2019Neil, P.E.: A critique of ANSI SQL isolation levels. In: Proceedings of the 16th ACM International Conference on Management of Data (SIGMOD), pp. 1\u201310. ACM Press (1995)","DOI":"10.1145\/568271.223785"},{"key":"261_CR12","doi-asserted-by":"crossref","unstructured":"Bushkov, V., Dziuma, D., Fatourou, P., Guerraoui, R.: The PCL theorem\u2013transactions cannot be parallel, consistent and live. In: Proceedings of the 26th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, July 2014","DOI":"10.1145\/2612669.2612690"},{"key":"261_CR13","doi-asserted-by":"crossref","unstructured":"Bushkov, V., Guerraoui, R., Kapa\u0142ka, M.: On the liveness of transactional memory. In: Proceedings of the 31st ACM Symposium on Principles of Distributed Computing (PODC), pp. 9\u201318. ACM (2012)","DOI":"10.1145\/2332432.2332435"},{"key":"261_CR14","doi-asserted-by":"crossref","unstructured":"Chuong, P., Ellen, F., Ramachandran, V.: A universal construction for wait-free transaction friendly data structures. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 335\u2013344. ACM (2010)","DOI":"10.1145\/1810479.1810538"},{"key":"261_CR15","doi-asserted-by":"crossref","unstructured":"Dice, D., Shavit, N.: What really makes transactions faster? In: 1st Workshop on Transactional Computing (2006)","DOI":"10.1007\/11864219_14"},{"key":"261_CR16","doi-asserted-by":"crossref","unstructured":"Fatourou, P., Kallimanis, N.D.: The redblue adaptive universal constructions. In: Proceedings of the 23rd International Symposium Distributed Computing (DISC), vol. 5805 of Lecture Notes in Computer Science, pp. 127\u2013141. Springer (2009)","DOI":"10.1007\/978-3-642-04355-0_15"},{"issue":"3","key":"261_CR17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s00224-013-9491-y","volume":"55","author":"P Fatourou","year":"2014","unstructured":"Fatourou, P., Kallimanis, N.D.: Highly-efficient wait-free synchronization. Theory Comput. Syst. 55(3), 475\u2013520 (2014)","journal-title":"Theory Comput. Syst."},{"key":"261_CR18","doi-asserted-by":"crossref","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 237\u2013246. ACM (2008)","DOI":"10.1145\/1345206.1345241"},{"issue":"5","key":"261_CR19","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1145\/290179.290183","volume":"45","author":"F Fich","year":"1998","unstructured":"Fich, F., Herlihy, M., Shavit, N.: On the space complexity of randomized synchronization. J. ACM 45(5), 843\u2013862 (1998)","journal-title":"J. ACM"},{"key":"261_CR20","unstructured":"Fraser, K.: Practical lock freedom. Technical report, Computer Laboratory, University of Cambridge (2003). http:\/\/www.cl.cam.ac.uk\/techreports\/UCAM-CL-TR-579.pdf"},{"key":"261_CR21","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On obstruction-free transactions. In: Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 304\u2013313. ACM (2008)","DOI":"10.1145\/1378533.1378587"},{"key":"261_CR22","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapa\u0142ka, M.: On the correctness of transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 175\u2013184. ACM (2008)","DOI":"10.1145\/1345206.1345233"},{"key":"261_CR23","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. In: Proceedings of the 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pp. 404\u2013415. ACM (2009)","DOI":"10.1145\/1594834.1480931"},{"key":"261_CR24","doi-asserted-by":"crossref","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data structures. In: Proceedings of the 2nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP), pp. 197\u2013206. ACM (1990)","DOI":"10.1145\/99164.99185"},{"key":"261_CR25","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"261_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/1062247.1062249","volume":"23","author":"M Herlihy","year":"2005","unstructured":"Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst. 23, 146\u2013196 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"key":"261_CR27","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: Proceedings of the 20th Annual International Symposium on Computer Architecture (ISCA), pp. 289\u2013300. ACM (1993)","DOI":"10.1145\/165123.165164"},{"issue":"3","key":"261_CR28","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"261_CR29","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 151\u2013160. ACM (1994)","DOI":"10.1145\/197917.198079"},{"key":"261_CR30","doi-asserted-by":"crossref","unstructured":"Jayanti, P., Petrovic, S.: Efficiently implementing a large number of LL\/SC objects. In: Proceedings of the 9th International Conference on Principles of Distributed Computing (OPODIS), vol. 3974 of Lecture Notes in Computer Science, pp. 45\u201356. Springer (2005)","DOI":"10.1007\/11603771_5"},{"key":"261_CR31","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Ravi, S.: On partial wait-freedom in transactional memory. In: Proceedings of the 2015 International Conference on Distributed Computing and Networking, (ICDCN), pp. 10:1\u201310:9. ACM (2015)","DOI":"10.1145\/2684464.2684473"},{"issue":"9","key":"261_CR32","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1109\/TKDE.2004.34","volume":"16","author":"S Lu","year":"2004","unstructured":"Lu, S., Bernstein, A., Lewis, P.: Correct execution of transactions at different isolation levels. IEEE Trans. Knowl. Data Eng. 16(9), 1070\u20131081 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"261_CR33","doi-asserted-by":"crossref","unstructured":"Marathe, V.J., III, W.N.S., Scott, M.L.: Adaptive software transactional memory. In: Proceedings of the 19th International Conference on Distributed Computing (DISC), vol. 3724 of Lecture Notes in Computer Science, pp. 354\u2013368. Springer (2005)","DOI":"10.1007\/11561927_26"},{"issue":"4","key":"261_CR34","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979)","journal-title":"J. ACM"},{"key":"261_CR35","doi-asserted-by":"crossref","unstructured":"Peluso, S., Palmieri, R., Romano, P., Ravindran, B., Quaglia, F.: Disjoint-access parallelism: impossibility, possibility, and cost of transactional memory implementations. In: Proceedings of the 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 217\u2013226. ACM (2015)","DOI":"10.1145\/2767386.2767438"},{"key":"261_CR36","unstructured":"Riegel, T., Fetzer, C., Felber, P.: Snapshot isolation for software transactional memory. In: First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT) (2006)"},{"key":"261_CR37","doi-asserted-by":"crossref","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the 14th Annual ACM symposium on Principles of Distributed Computing (PODC), pp. 204\u2013213. ACM (1995)","DOI":"10.1145\/224964.224987"},{"key":"261_CR38","doi-asserted-by":"crossref","unstructured":"Tabba, F., Moir, M., Goodman, J.R., Hay, A.W., Wang, C.: Nztm: nonblocking zero-indirection transactional memory. In: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 204\u2013213. ACM (2009)","DOI":"10.1145\/1583991.1584048"},{"key":"261_CR39","doi-asserted-by":"crossref","unstructured":"Turek, J., Shasha, D., Prakash, S.: Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In: Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 212\u2013222. ACM (1992)","DOI":"10.1145\/137097.137873"},{"key":"261_CR40","volume-title":"Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery","author":"G Weikum","year":"2001","unstructured":"Weikum, G., Vossen, G.: Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery. Morgan Kaufmann, Los Altos (2001)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0261-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-015-0261-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0261-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T22:14:47Z","timestamp":1567548887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-015-0261-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,21]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["261"],"URL":"https:\/\/doi.org\/10.1007\/s00446-015-0261-8","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,21]]}}}