{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:27Z","timestamp":1750307067811,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,21]],"date-time":"2012-10-21T00:00:00Z","timestamp":1350777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,10,21]]},"DOI":"10.1145\/2414729.2414736","type":"proceedings-article","created":{"date-parts":[[2012,12,19]],"date-time":"2012-12-19T14:12:22Z","timestamp":1355926342000},"page":"39-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Does better throughput require worse latency?"],"prefix":"10.1145","author":[{"given":"David","family":"Ungar","sequence":"first","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}]},{"given":"Doug","family":"Kimelman","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}]},{"given":"Sam","family":"Adams","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}]},{"given":"Mark","family":"Wegman","sequence":"additional","affiliation":[{"name":"IBM Research, Yorktown Heights, NY, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1897852.1897873"},{"key":"e_1_3_2_1_2_1","volume-title":"What Can You Do About It?,\" 2012","author":"McKenney P.E.","year":"2012","unstructured":"P.E. McKenney , \" Is Parallel Programming Hard , And, If So , What Can You Do About It?,\" 2012 ; http:\/\/kernel.org\/pub\/linux\/kernel\/people\/paulmck\/perfbook\/perfbook. 2012 .08.08a.pdf. P.E. McKenney, \"Is Parallel Programming Hard, And, If So, What Can You Do About It?,\" 2012; http:\/\/kernel.org\/pub\/linux\/kernel\/people\/paulmck\/perfbook\/perfbook.2012.08.08a.pdf."},{"key":"e_1_3_2_1_3_1","volume-title":"Inconsistency Robustness for Scalability in Interactive Concurrent-Update In-Memory MOLAP Cubes,\" Inconsistency Robustness","author":"Ungar D.","year":"2011","unstructured":"D. Ungar , , \" Inconsistency Robustness for Scalability in Interactive Concurrent-Update In-Memory MOLAP Cubes,\" Inconsistency Robustness 2011 , 201. D. Ungar, et al., \"Inconsistency Robustness for Scalability in Interactive Concurrent-Update In-Memory MOLAP Cubes,\" Inconsistency Robustness 2011, 201."},{"key":"e_1_3_2_1_4_1","volume-title":"The 38th International Conference on Very Large Data Bases","author":"Bailis P.","year":"2012","unstructured":"P. Bailis , Probabilistically Bounded Staleness for Practical Partial Quorums ,\" The 38th International Conference on Very Large Data Bases , 2012 . P. Bailis, et al., \"Probabilistically Bounded Staleness for Practical Partial Quorums,\" The 38th International Conference on Very Large Data Bases, 2012."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1435417.1435432"}],"event":{"name":"SPLASH '12: Conference on Systems, Programming, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Tucson Arizona USA","acronym":"SPLASH '12"},"container-title":["Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2414729.2414736","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2414729.2414736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:23Z","timestamp":1750238483000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2414729.2414736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,21]]},"references-count":5,"alternative-id":["10.1145\/2414729.2414736","10.1145\/2414729"],"URL":"https:\/\/doi.org\/10.1145\/2414729.2414736","relation":{},"subject":[],"published":{"date-parts":[[2012,10,21]]},"assertion":[{"value":"2012-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}