{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:51:24Z","timestamp":1725742284011},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400469"},{"type":"electronic","value":"9783642400476"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_17","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T12:18:02Z","timestamp":1374322682000},"page":"150-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Enhancing Concurrency in Distributed Transactional Memory through Commutativity"],"prefix":"10.1007","author":[{"given":"Junwhan","family":"Kim","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Palmieri","sequence":"additional","affiliation":[]},{"given":"Binoy","family":"Ravindran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-92990-1_3","volume-title":"High Performance Embedded Architectures and Compilers","author":"M. Ansari","year":"2009","unstructured":"Ansari, M., Luj\u00e1n, M., Kotselidis, C., Jarvis, K., Kirkham, C., Watson, I.: Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O\u2019Boyle, M., Martonosi, M., Ungerer, T. (eds.) HiPEAC 2009. LNCS, vol.\u00a05409, pp. 4\u201318. Springer, Heidelberg (2009)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bieniusa, A., Fuhrmann, T.: Consistency in hindsight: A fully decentralized STM algorithm. In: 2010 IEEE IPDPS, pp. 1\u201312 (April 2010)","DOI":"10.1109\/IPDPS.2010.5470446"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Blake, G., Dreslinski, R.G., Mudge, T.: Proactive transaction scheduling for contention management. In: Microarchitecture, pp. 156\u2013167 (December 2009)","DOI":"10.1145\/1669112.1669133"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C.L.A.: Indexing time vs. query time: trade-offs in dynamic information retrieval systems. In: CIKM 2005, pp. 317\u2013318. ACM (2005)","DOI":"10.1145\/1099554.1099645"},{"key":"17_CR5","unstructured":"TPC Council, tpc-c benchmark, revision 5.11 (February 2010)"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056478","volume-title":"Distributed Computing","author":"M.J. Demmer","year":"1998","unstructured":"Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 119\u2013133. Springer, Heidelberg (1998)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, S., Hendler, D., Suissa, A.: CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. In: PODC (2008)","DOI":"10.1145\/1400751.1400769"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., et al.: Preventing versus curing: avoiding conflicts in transactional memories. In: PODC 2009, pp. 7\u201316 (2009)","DOI":"10.1145\/1582716.1582725"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Fernandes, S.M., Cachopo, J.: Lock-free and scalable multi-version software transactional memory. In: PPoPP 2011, pp. 179\u2013188. ACM (2011)","DOI":"10.1145\/2038037.1941579"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Koskinen, E.: Transactional boosting: a methodology for highly-concurrent transactional objects. In: PPoPP 2008, pp. 207\u2013216. ACM (2008)","DOI":"10.1145\/1345206.1345237"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","volume":"20","author":"M. Herlihy","year":"2007","unstructured":"Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distributed Computing\u00a020(3), 195\u2013208 (2007)","journal-title":"Distributed Computing"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., Chew, L.P.: Optimistic parallelism requires abstractions. In: PLDI (2007)","DOI":"10.1145\/1250734.1250759"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"James, R.: Larus and Ravi Rajwar. Transactional Memory. M. and Claypool (2006)","DOI":"10.2200\/S00070ED1V01Y200611CAC002"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Peluso, S., Ruivo, P., Romano, P., Quaglia, F., Rodrigues, L.: When scalability meets consistency: Genuine multiversion update-serializable partial data replication. In: ICDCS 2012 (2012)","DOI":"10.1109\/ICDCS.2012.55"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-35170-9_23","volume-title":"Middleware 2012","author":"S. Peluso","year":"2012","unstructured":"Peluso, S., Romano, P., Quaglia, F.: SCORe: A scalable one-copy serializable partial replication protocol. In: Narasimhan, P., Triantafillou, P. (eds.) Middleware 2012. LNCS, vol.\u00a07662, pp. 456\u2013475. Springer, Heidelberg (2012)"},{"key":"17_CR16","unstructured":"Perelman, K.: On avoiding spare aborts in transactional memory. In: SPAA 2009 (2009)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Perelman, K., Fan.: On maintaining multiple versions in STM. In: PODC 2010 (2010)","DOI":"10.1145\/1835698.1835704"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Pugh, W.: Skip lists: a probabilistic alternative to balanced trees. Commun. (1990)","DOI":"10.1145\/78973.78977"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Ramadan, H.E., et al.: Dependence-aware transactional memory for increased concurrency. In: MICRO, pp. 246\u2013257 (2008)","DOI":"10.1109\/MICRO.2008.4771795"},{"key":"17_CR20","unstructured":"Riegel, T., Fetzer, C., Felber, P.: Snapshot isolation for software transactional memory. In: ACM SIGPLAN TRANSACT 2006 (2006)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Riegel, T., Fetzer, C., Felber, P.: Time-based transactional memory with scalable time bases. In: SPAA (2007)","DOI":"10.1145\/1248377.1248415"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Riegel, T., Fetzer, C., Sturzrehm, H., Felber, P.: From causal to z-linearizable transactional memory. In: PODC (2007)","DOI":"10.1145\/1281100.1281162"},{"key":"17_CR23","unstructured":"Saad, M., Binoy Supporting, R.: STM in distributed systems: Mechanisms and a Java framework. In: ACM SIGPLAN Workshop on Transactional Computing (2011)"},{"key":"17_CR24","unstructured":"Turcu, A., Ravindran, B.: Hyflow2: A high performance distributed transactional memory framework in scala, \n                    \n                      http:\/\/hyflow.org"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Lee, H.-H.S.: Adaptive transaction scheduling for transactional memory systems. In: SPAA, pp. 169\u2013178 (2008)","DOI":"10.1145\/1378533.1378564"},{"key":"17_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Brief announcement: on enhancing concurrency in distributed transactional memory. In: PODC (2010)","DOI":"10.1145\/1835698.1835715"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T01:08:28Z","timestamp":1587344908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}