{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:58Z","timestamp":1779174958274,"version":"3.51.4"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,10]]},"abstract":"<jats:p>Future servers will be equipped with thousands of CPU cores and deep memory hierarchies. Traditional concurrency control (CC) schemes---both optimistic and pessimistic---slow down orders of magnitude in such environments for highly contended workloads. Optimistic CC (OCC) scales the best for workloads with few conflicts, but suffers from clobbered reads for high conflict workloads. Although pessimistic locking can protect reads, it floods cache-coherence backbones in deep memory hierarchies and can also cause numerous deadlock aborts.<\/jats:p>\n          <jats:p>\n            This paper proposes a new CC scheme,\n            <jats:italic>mostly-optimistic concurrency control<\/jats:italic>\n            (MOCC), to address these problems. MOCC achieves orders of magnitude higher performance for dynamic workloads on modern servers. The key objective of MOCC is to avoid clobbered reads for high conflict workloads, without any centralized mechanisms or heavyweight interthread communication. To satisfy such needs, we devise a native, cancellable reader-writer spinlock and a serializable protocol that can acquire, release and re-acquire locks in any order without expensive interthread communication. For low conflict workloads, MOCC maintains OCC's high performance without taking read locks.\n          <\/jats:p>\n          <jats:p>Our experiments with high conflict YCSB workloads on a 288-core server reveal that MOCC performs 8\u00d7 and 23\u00d7 faster than OCC and pessimistic locking, respectively. It achieves 17 million TPS for TPC-C and more than 110 million TPS for YCSB without conflicts, 170\u00d7 faster than pessimistic methods.<\/jats:p>","DOI":"10.14778\/3015274.3015276","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T15:29:41Z","timestamp":1485271781000},"page":"49-60","source":"Crossref","is-referenced-by-count":94,"title":["Mostly-optimistic concurrency control for highly contended dynamic workloads on a thousand cores"],"prefix":"10.14778","volume":"10","author":[{"given":"Tianzheng","family":"Wang","sequence":"first","affiliation":[{"name":"University of Toronto"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideaki","family":"Kimura","sequence":"additional","affiliation":[{"name":"Hewlett Packard Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223785"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1620585.1620587"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851143"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145848"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_2_1_9_1","unstructured":"J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. 1st edition 1992.   J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques . 1st edition 1992."},{"key":"e_1_2_1_10_1","unstructured":"Hewlett Packard Enterprise. HPE Superdome Servers. https:\/\/www.hpe.com\/us\/en\/servers\/superdome.html.  Hewlett Packard Enterprise. HPE Superdome Servers. https:\/\/www.hpe.com\/us\/en\/servers\/superdome.html."},{"key":"e_1_2_1_11_1","unstructured":"Hewlett Packard Labs. The Machine: A new kind of computer. http:\/\/labs.hpe.com\/research\/themachine\/.  Hewlett Packard Labs. The Machine: A new kind of computer. http:\/\/labs.hpe.com\/research\/themachine\/."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687682"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516365"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920928"},{"key":"e_1_2_1_15_1","first-page":"B1","article-title":"Concurrency-safe reader-writer lock with time out support","volume":"6546443","author":"Kakivaya G. K. R.","year":"1999","journal-title":"United States Patent US"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746480"},{"key":"e_1_2_1_18_1","volume-title":"ADMS'12","author":"Kimura H."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378585"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/319566.319567"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584020"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544834"},{"key":"e_1_2_1_24_1","volume-title":"CIDR","author":"Levandoski J.","year":"2015"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.10"},{"key":"e_1_2_1_26_1","first-page":"655","volume-title":"PVLDB","author":"Lomet D. B.","year":"1993"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809990"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168836.2168855"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/109625.109637"},{"key":"e_1_2_1_32_1","first-page":"392","volume-title":"PVLDB","author":"Mohan C.","year":"1990"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359627"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882958"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448947"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732955"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/379539.379566"},{"key":"e_1_2_1_38_1","unstructured":"SGI. UV3000. https:\/\/www.sgi.com\/products\/servers\/uv\/uv_3000_30.html.  SGI. UV3000. https:\/\/www.sgi.com\/products\/servers\/uv\/uv_3000_30.html."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.667102"},{"key":"e_1_2_1_40_1","unstructured":"TPC. TPC benchmark E standard specification.  TPC. TPC benchmark E standard specification."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851160"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771937.2771949"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.121754"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688510"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2737924.2737970"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3015274.3015276","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:26:21Z","timestamp":1672223181000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3015274.3015276"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["10.14778\/3015274.3015276"],"URL":"https:\/\/doi.org\/10.14778\/3015274.3015276","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}