{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:36:52Z","timestamp":1763415412103,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1320835, 1420673"],"award-info":[{"award-number":["1320835, 1420673"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087565","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"173-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Fast Scheduling in Distributed Transactional Memory"],"prefix":"10.1145","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[{"name":"Louisiana State University, Baton Rouge, LA, USA"}]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Miroslav","family":"Popovic","sequence":"additional","affiliation":[{"name":"University of Novi Sad, Novi Sad, Serbia"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[{"name":"Kent State University, Kent, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9195-x"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345242"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767433"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485922.2485942"},{"key":"e_1_3_2_1_5_1","volume-title":"Parallel Algorithms","author":"Casanova Henri","unstructured":"Henri Casanova , Arnaud Legrand , and Yves Robert . 2008. Parallel Algorithms ( 1 st ed.). Chapman & Hall\/CRC. x9781584889458 Henri Casanova, Arnaud Legrand, and Yves Robert. 2008. Parallel Algorithms (1st ed.). Chapman & Hall\/CRC. x9781584889458","edition":"1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/72935.72941"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787492"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Maria Couceiro Paolo Romano Nuno Carvalho and Lu\u0131s Rodrigues. 2009. D2STM: Dependable Distributed Software Transactional Memory. In PRDC. 307--313. x978-0--7695--3849--5 Maria Couceiro Paolo Romano Nuno Carvalho and Lu\u0131s Rodrigues. 2009. D2STM: Dependable Distributed Software Transactional Memory. In PRDC. 307--313. x978-0--7695--3849--5","DOI":"10.1109\/PRDC.2009.55"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1582716.1582725"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139051224"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2155620.2155655"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073863"},{"key":"e_1_3_2_1_13_1","volume-title":"The IBM Blue Gene\/Q Compute Chip","author":"Haring Ruud","year":"2012","unstructured":"Ruud Haring , Martin Ohmacht , Thomas Fox , Michael Gschwind , David Satterfield , Krishnan Sugavanam , Paul Coteus , Philip Heidelberger , Matthias Blumrich , Robert Wisniewski , Alan Gara , George Chiu , Peter Boyle , Norman Chist , and Changhoan Kim . 2012. The IBM Blue Gene\/Q Compute Chip . IEEE Micro 32, 2 ( 2012 ), 48--60.0272--1732 Ruud Haring, Martin Ohmacht, Thomas Fox, Michael Gschwind, David Satterfield, Krishnan Sugavanam, Paul Coteus, Philip Heidelberger, Matthias Blumrich, Robert Wisniewski, Alan Gara, George Chiu, Peter Boyle, Norman Chist, and Changhoan Kim. 2012. The IBM Blue Gene\/Q Compute Chip.IEEE Micro32, 2 (2012), 48--60.0272--1732"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_9"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/165123.165164"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0037-x"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073861"},{"key":"e_1_3_2_1_18_1","unstructured":"Intel. 2012. http:\/\/software.intel.com\/en-us\/blogs\/2012\/02\/07\/transactional-synchronization-in-haswell. (2012). Intel. 2012. http:\/\/software.intel.com\/en-us\/blogs\/2012\/02\/07\/transactional-synchronization-in-haswell. (2012)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16023-3_29"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Junwhan Kim and B. Ravindran. 2013. Scheduling Transactions in Replicated Distributed Software Transactional Memory. In CCGrid. 227--234. Junwhan Kim and B. Ravindran. 2013. Scheduling Transactions in Replicated Distributed Software Transactional Memory. In CCGrid. 227--234.","DOI":"10.1109\/CCGrid.2013.88"},{"volume-title":"Trees, Hypercubes","author":"Leighton F. Thomson","key":"e_1_3_2_1_21_1","unstructured":"F. Thomson Leighton . 1992. Introduction to Parallel Algorithms and Architectures: Array , Trees, Hypercubes . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. x1--55860--117--1 F. Thomson Leighton. 1992. Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. x1--55860--117--1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2610970"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1122971.1123002"},{"key":"e_1_3_2_1_24_1","first-page":"4","article-title":"Creating Interconnect Topologies by Algorithmic Edge Removal","volume":"2","author":"Michalewicz Marek","year":"2015","unstructured":"Marek Michalewicz , Lukasz Orlowski , and Yuefan Deng . 2015 . Creating Interconnect Topologies by Algorithmic Edge Removal : MOD and SMOD Graphs.Supercomput. Front. Innov.: Int. J. 2 , 4 (March 2015), 16--47.2409--6008 Marek Michalewicz, Lukasz Orlowski, and Yuefan Deng. 2015. Creating Interconnect Topologies by Algorithmic Edge Removal: MOD and SMOD Graphs.Supercomput. Front. Innov.: Int. J.2, 4 (March 2015), 16--47.2409--6008","journal-title":"MOD and SMOD Graphs.Supercomput. Front. Innov.: Int. J."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2749469.2750403"},{"key":"#cr-split#-e_1_3_2_1_26_1.1","unstructured":"Roberto Palmieri Sebastiano Peluso and Binoy Ravindran. 2015. Transaction Execution Models in Partially Replicated Transactional Memory: The Case for Data-Flow and Control-Flow. In Transactional Memory. 341--366. x978--3--319--14719--2 http:\/\/dx.doi.org\/10.1007\/978--3--319--14720--8_16 10.1007\/978--3--319--14720--8_16"},{"key":"#cr-split#-e_1_3_2_1_26_1.2","doi-asserted-by":"crossref","unstructured":"Roberto Palmieri Sebastiano Peluso and Binoy Ravindran. 2015. Transaction Execution Models in Partially Replicated Transactional Memory: The Case for Data-Flow and Control-Flow. In Transactional Memory. 341--366. x978--3--319--14719--2 http:\/\/dx.doi.org\/10.1007\/978--3--319--14720--8_16","DOI":"10.1007\/978-3-319-14720-8_16"},{"volume-title":"On-Chip Communication Architectures: System on Chip Interconnect","author":"Pasricha Sudeep","key":"e_1_3_2_1_27_1","unstructured":"Sudeep Pasricha and Nikil Dutt . 2008. On-Chip Communication Architectures: System on Chip Interconnect . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. x0123705215, 9780080558288 Sudeep Pasricha and Nikil Dutt. 2008. On-Chip Communication Architectures: System on Chip Interconnect. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. x0123705215, 9780080558288"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2012.55"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.006"},{"key":"e_1_3_2_1_30_1","volume-title":"Saad and Binoy Ravindran","author":"Mohamed","year":"2011","unstructured":"Mohamed M. Saad and Binoy Ravindran . 2011 . Snake : Control Flow Distributed Software Transactional Memory. In SSS. 238--252. http:\/\/dx.doi.org\/10.1007\/978--3--642--24550--3_19 10.1007\/978--3--642--24550--3_19 Mohamed M. Saad and Binoy Ravindran. 2011. Snake: Control Flow Distributed Software Transactional Memory. In SSS. 238--252. http:\/\/dx.doi.org\/10.1007\/978--3--642--24550--3_19"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9532-3"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-012-0159-7"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0214-7"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050028"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Richard M. Yoo and Hsien-Hsin S. Lee. 2008. Adaptive transaction scheduling for transactional memory systems. In SPAA. 169--178. Richard M. Yoo and Hsien-Hsin S. Lee. 2008. Adaptive transaction scheduling for transactional memory systems. In SPAA. 169--178.","DOI":"10.1145\/1378533.1378564"},{"key":"#cr-split#-e_1_3_2_1_36_1.1","doi-asserted-by":"crossref","unstructured":"Bo Zhang Binoy Ravindran and Roberto Palmieri. 2014. Distributed Transactional Contention Management as the Traveling Salesman Problem. In SIROCCO. 54--67. http:\/\/dx.doi.org\/10.1007\/978--3--319-09620--9_6 10.1007\/978--3--319-09620--9_6","DOI":"10.1007\/978-3-319-09620-9_6"},{"key":"#cr-split#-e_1_3_2_1_36_1.2","doi-asserted-by":"crossref","unstructured":"Bo Zhang Binoy Ravindran and Roberto Palmieri. 2014. Distributed Transactional Contention Management as the Traveling Salesman Problem. In SIROCCO. 54--67. http:\/\/dx.doi.org\/10.1007\/978--3--319-09620--9_6","DOI":"10.1007\/978-3-319-09620-9_6"}],"event":{"name":"SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087565","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087565","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T16:53:35Z","timestamp":1750784015000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087565"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":38,"alternative-id":["10.1145\/3087556.3087565","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087565","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}