{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:20Z","timestamp":1760202680273},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662451731"},{"type":"electronic","value":"9783662451748"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45174-8_29","type":"book-chapter","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T11:28:20Z","timestamp":1411990100000},"page":"421-438","source":"Crossref","is-referenced-by-count":9,"title":["Improving Average Performance by Relaxing Distributed Data Structures"],"prefix":"10.1007","author":[{"given":"Edward","family":"Talmage","sequence":"first","affiliation":[]},{"given":"Jennifer L.","family":"Welch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-642-17653-1_29","volume-title":"Principles of Distributed Systems","author":"Y. Afek","year":"2010","unstructured":"Afek, Y., Korland, G., Yanovsky, E.: Quasi-linearizability: Relaxed consistency for improved concurrency. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol.\u00a06490, pp. 395\u2013410. Springer, Heidelberg (2010)"},{"issue":"5","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1145\/185675.185815","volume":"41","author":"J. Aspnes","year":"1994","unstructured":"Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. ACM\u00a041(5), 1020\u20131048 (1994)","journal-title":"J. ACM"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Attiya, H., Guerraoui, R., Hendler, D., Kuznetsov, P., Michael, M.M., Vechev, M.T.: Laws of order: Expensive synchronization in concurrent algorithms cannot be eliminated. In: Ball, T., Sagiv, M. (eds.) Principles of Programming Languages (POPL), pp. 487\u2013498. ACM (2011)","DOI":"10.1145\/1925844.1926442"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1145\/176575.176576","volume":"12","author":"H. Attiya","year":"1994","unstructured":"Attiya, H., Welch, J.L.: Sequential consistency versus linearizability. ACM Transactions on Computer Systems\u00a012(2), 91\u2013122 (1994)","journal-title":"ACM Transactions on Computer Systems"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Calder, B., Wang, J., Ogus, A., et al.: Windows Azure Storage: a highly available cloud storage service with strong consistency. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles, pp. 143\u2013157 (2011)","DOI":"10.1145\/2043556.2043571"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Kirsch, C.M., Payer, H., Sezgin, A., Sokolova, A.: Quantitative relaxation of concurrent data structures. In: Giacobazzi, R., Cousot, R. (eds.) Principles of Programming Languages (POPL), pp. 317\u2013328. ACM (2013)","DOI":"10.1145\/2480359.2429109"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","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 Transactions on Programming Languages and Systems\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"9","key":"29_CR8","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Computers\u00a028(9), 690\u2013691 (1979)","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: On interprocess communication. Distributed Computing\u00a01(2), 77\u2013101 (1986)","journal-title":"Distributed Computing"},{"key":"29_CR10","unstructured":"Lipton, R.J., Sandberg, J.D.: PRAM: A scalable shared memory. Technical Report CS-TR-180-88, Princeton University, Department of Computer Science (1988)"},{"issue":"1","key":"29_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1435417.1435432","volume":"52","author":"W. Vogels","year":"2009","unstructured":"Vogels, W.: Eventually consistent. Communications of the ACM\u00a052(1), 40\u201344 (2009)","journal-title":"Communications of the ACM"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Wang, J., Talmage, E., Lee, H., Welch, J.L.: Improved time bounds for linearizable implementations of abstract data types. In: International Parallel and Distributed Processing Symposium (IPDPS), pp. 691\u2013701 (2014)","DOI":"10.1109\/IPDPS.2014.77"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45174-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T01:31:33Z","timestamp":1650245493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45174-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662451731","9783662451748"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45174-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}