{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:39:55Z","timestamp":1743064795891,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095806"},{"type":"electronic","value":"9783319095813"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09581-3_4","type":"book-chapter","created":{"date-parts":[[2014,8,2]],"date-time":"2014-08-02T11:20:14Z","timestamp":1406978414000},"page":"41-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint-Access Parallelism Does Not Entail Scalability"],"prefix":"10.1007","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[]},{"given":"Mihai","family":"Letia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,3]]},"reference":[{"key":"4_CR1","unstructured":"Perf @ONLINE. https:\/\/perf.wiki.kernel.org"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M., Taubenfeld, G., Touitou, D.: Disentangling multi-object operations. In: PODC (1997)","DOI":"10.1145\/259380.259431"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, J.H., Moir, M.: Universal constructions for multi-object operations. In: PODC (1995)","DOI":"10.1145\/224964.224985"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: SPAA (2009)","DOI":"10.1145\/1583991.1584015"},{"key":"4_CR5","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing: Fundamentals, Simulations and Advanced Topics","author":"H Attiya","year":"2004","unstructured":"Attiya, H., Jennifer, W.: Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edn. Wiley, New York (2004)","edition":"2"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Kapalka, M.: Stretching transactional memory. In: PLDI (2009)","DOI":"10.1145\/1542476.1542494"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ellen, F., Fatourou, P., Kosmas, E., Milani, A., Travers, C.: Universal constructions that ensure disjoint-access parallelism and wait-freedom. In: PODC (2012)","DOI":"10.1145\/2332432.2332457"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/11561927_37","volume-title":"Distributed Computing","author":"FE Fich","year":"2005","unstructured":"Fich, F.E., Luchangco, V., Moir, M., Shavit, N.N.: Obstruction-free step complexity: lock-free DCAS as an example. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 493\u2013494. Springer, Heidelberg (2005)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kapalka, M.: On obstruction-free transactions. In: SPAA (2008)","DOI":"10.1145\/1378533.1378587"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","volume-title":"Distributed Computing","author":"TL Harris","year":"2002","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 265\u2013279. Springer, Heidelberg (2002)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Hendler, D., Incze, I., Shavit, N., Tzafrir, M.: Flat combining and the synchronization-parallelism tradeoff. In: SPAA (2010)","DOI":"10.1145\/1810479.1810540"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. TOPLAS 13, 124\u2013149 (1991)","journal-title":"TOPLAS"},{"key":"4_CR13","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann, San Mateo (2008)"},{"key":"4_CR14","first-page":"1","volume":"72","author":"D Imbs","year":"2012","unstructured":"Imbs, D., Raynal, M.: Help when needed, but no more: efficient read\/write partial snapshot. JPDC 72, 1\u201312 (2012)","journal-title":"JPDC"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Israeli, A., Rappoport, L.: Disjoint-access-parallel implementations of strong shared memory primitives. In: PODC (1994)","DOI":"10.1145\/197917.198079"},{"key":"4_CR16","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":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11864219_20","volume-title":"Distributed Computing","author":"T Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 284\u2013298. Springer, Heidelberg (2006)"},{"key":"4_CR18","unstructured":"Roy, A., Hand, S., Harris, T.: Exploring the limits of disjoint access parallelism. In: HotPar (2009)"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09581-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:48:44Z","timestamp":1676886524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09581-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095806","9783319095813"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09581-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"3 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}