{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:07Z","timestamp":1759638187338,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T00:00:00Z","timestamp":1603411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1320835"],"award-info":[{"award-number":["1320835"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1420673"],"award-info":[{"award-number":["1420673"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00224-020-10008-7","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T07:02:47Z","timestamp":1603436567000},"page":"296-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fast Scheduling in Distributed Transactional Memory"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4381-4333","authenticated-orcid":false,"given":"Costas","family":"Busch","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]},{"given":"Miroslav","family":"Popovic","sequence":"additional","affiliation":[]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,23]]},"reference":[{"issue":"1","key":"10008_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s00453-008-9195-x","volume":"57","author":"H Attiya","year":"2010","unstructured":"Attiya, H., Epstein, L., Shachnai, H., Tamir, T.: Transactional contention management as a non-clairvoyant scheduling problem. Algorithmica 57 (1), 44\u201361 (2010)","journal-title":"Algorithmica"},{"key":"10008_CR2","doi-asserted-by":"crossref","unstructured":"Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: In: PPoPP, pp. 247\u2013258, (2008)","DOI":"10.1145\/1345206.1345242"},{"key":"10008_CR3","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Impossibility results for distributed transactional memory. In: PODC, pp. 207\u2013215 (2015)","DOI":"10.1145\/2767386.2767433"},{"key":"10008_CR4","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Fast scheduling in distributed transactional memory. In: SPAA, pp. 173\u2013182 (2017)","DOI":"10.1145\/3087556.3087565"},{"key":"10008_CR5","doi-asserted-by":"crossref","unstructured":"Cain, H.W., Michael, M.M., Frey, B., May, C., Williams, D., Le, H.Q.: Robust architectural support for transactional memory in the power architecture. In: ISCA, pp. 225\u2013236 (2013)","DOI":"10.1145\/2508148.2485942"},{"key":"10008_CR6","doi-asserted-by":"crossref","unstructured":"Casanova, H., Legrand, A., Robert, Y.: Parallel Algorithms. Chapman & Hall\/CRC, 1st edn (2008)","DOI":"10.1201\/9781584889465"},{"key":"10008_CR7","doi-asserted-by":"crossref","unstructured":"Chan, M.Y.: Embedding of D-Dimensional grids into optimal hypercubes. In: SPAA, pp. 52\u201357 (1989)","DOI":"10.1145\/72935.72941"},{"key":"10008_CR8","doi-asserted-by":"crossref","unstructured":"Costa, P., Ballani, H., Razavi, K., Kash, I.: R2c2: A network stack for rack-scale computers. In: SIGCOMM, pp. 551\u2013564 (2015)","DOI":"10.1145\/2829988.2787492"},{"key":"10008_CR9","doi-asserted-by":"crossref","unstructured":"Couceiro, M., Romano, P., Carvalho, N., Rodrigues, L.: D2stm: Dependable distributed software transactional memory. In: PRDC, pp. 307\u2013313 (2009)","DOI":"10.1109\/PRDC.2009.55"},{"key":"10008_CR10","doi-asserted-by":"crossref","unstructured":"Dragojevi\u0107, A., Guerraoui, R., Singh, A.V., Singh, V.: Preventing versus curing: Avoiding conflicts in transactional memories. In: PODC, pp. 7\u201316 (2009)","DOI":"10.1145\/1582716.1582725"},{"key":"10008_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139051224","volume-title":"Parallel Computer Organization and Design","author":"M Dubois","year":"2012","unstructured":"Dubois, M., Annavaram, M., Stenstrm, P.: Parallel Computer Organization and Design. Cambridge University Press, New York (2012)"},{"key":"10008_CR12","doi-asserted-by":"crossref","unstructured":"Fung, W.W.L., Singh, I., Brownsword, A., Aamodt, T.M.: Hardware transactional memory for Gpu architectures. In: MICRO, pp. 296\u2013307 (2011)","DOI":"10.1145\/2155620.2155655"},{"key":"10008_CR13","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: PODC, pp. 258\u2013264 (2005)","DOI":"10.1145\/1073814.1073863"},{"key":"10008_CR14","doi-asserted-by":"crossref","unstructured":"Haring, R., Ohmacht, M., Fox, T., Gschwind, M., Satterfield, D., Sugavanam, K., Coteus, P., Heidelberger, P., Blumrich, M., Wisniewski, R., Gara, A., Chiu, G., Boyle, P., Chist, N., Kim, C.: The ibm blue gene\/q compute chip, vol. 32 (2012)","DOI":"10.1109\/MM.2011.108"},{"key":"10008_CR15","doi-asserted-by":"crossref","unstructured":"Hendler, D., Naiman, A., Peluso, S., Quaglia, F., Romano, P., Suissa, A.: Exploiting locality in lease-based replicated transactional memory via task migration. In: DISC, pp. 121\u2013133 (2013)","DOI":"10.1007\/978-3-642-41527-2_9"},{"key":"10008_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Eliot, J, Moss, B: Transactional memory: Architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300 (1993)","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"10008_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","volume":"20","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Ye, S.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195\u2013208 (2007)","journal-title":"Distrib. Comput."},{"key":"10008_CR18","doi-asserted-by":"crossref","unstructured":"Scherer, W.N. III, Scott, ML: Advanced contention management for dynamic software transactional memory. In: PODC, pp. 240\u2013248 (2005)","DOI":"10.1145\/1073814.1073861"},{"key":"10008_CR19","unstructured":"Intel. http:\/\/software.intel.com\/en-us\/blogs\/2012\/02\/07\/transactional-synchronization-in-haswell, 2012"},{"key":"10008_CR20","unstructured":"Kim, J., Ravindran, B.: Scheduling transactions in replicated distributed software transactional memory. In: CCGrid, pp. 227\u2013234 (2013)"},{"key":"10008_CR21","doi-asserted-by":"crossref","unstructured":"Kim, J., Ravindran, B.: On transactional scheduling in distributed transactional memory systems. In: SSS, pp. 347\u2013361 (2010)","DOI":"10.1007\/978-3-642-16023-3_29"},{"key":"10008_CR22","volume-title":"Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes","author":"F Thomson Leighton","year":"1992","unstructured":"Thomson Leighton, F.: Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes. Morgan Kaufmann Publishers Inc., San Francisco (1992)"},{"issue":"1","key":"10008_CR23","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TPDS.2016.2610970","volume":"28","author":"D Li","year":"2017","unstructured":"Li, D., Wu, J., Liu, Z., Zhang, F.: Towards the tradeoffs in designing data center network architectures. IEEE Trans. Parallel Distrib. Syst. 28(1), 260\u2013273 (2017)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10008_CR24","doi-asserted-by":"crossref","unstructured":"Manassiev, K., Mihailescu, M., Amza, C.: Exploiting distributed version concurrency in a transactional memory cluster. In: PPoPP, pp. 198\u2013208 (2006)","DOI":"10.1145\/1122971.1123002"},{"issue":"4","key":"10008_CR25","first-page":"16","volume":"2","author":"M Michalewicz","year":"2015","unstructured":"Michalewicz, M., Orlowski, L., Deng, Y.: Creating interconnect topologies by algorithmic edge removal: Mod and smod graphs. Supercomput. Front. Innov.: Int. J. 2(4), 16\u201347 (2015)","journal-title":"Supercomput. Front. Innov.: Int. J."},{"key":"10008_CR26","doi-asserted-by":"crossref","unstructured":"Nakaike, T., Odaira, R., Gaudet, M., Michael, M.M., Tomari, H.: Quantitative comparison of hardware transactional memory for blue Gene\/Q, Zenterprise Ec12, Intel Core, and POWER8. In: ISCA, pp. 144\u2013157 (2015)","DOI":"10.1145\/2872887.2750403"},{"key":"10008_CR27","doi-asserted-by":"crossref","unstructured":"Palmieri, R., Peluso, S., Ravindran, B.: Transaction execution models in partially replicated transactional memory: The case for data-flow and control-flow. In: Transactional Memory, pp. 341\u2013366. Springer (2015)","DOI":"10.1007\/978-3-319-14720-8_16"},{"key":"10008_CR28","volume-title":"On-Chip Communication Architectures: System on Chip Interconnect","author":"S Pasricha","year":"2008","unstructured":"Pasricha, S., Dutt, N.: On-Chip Communication Architectures: System on Chip Interconnect. Morgan Kaufmann Publishers Inc., San Francisco (2008)"},{"key":"10008_CR29","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, pp. 455\u2013465 (2012)","DOI":"10.1109\/ICDCS.2012.55"},{"issue":"1","key":"10008_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.jcss.2013.07.006","volume":"80","author":"P Romano","year":"2014","unstructured":"Romano, P., Palmieri, R., Quaglia, F., Carvalho, N., Rodrigues, L.: On speculative replication of transactional systems. J. Comput. Syst Sci. 80(1), 257\u2013276 (2014)","journal-title":"J. Comput. Syst Sci."},{"key":"10008_CR31","doi-asserted-by":"crossref","unstructured":"Saad, M.M., Ravindran, B.: Snake: Control flow distributed software transactional memory. In: SSS, pp. 238\u2013252 (2011)","DOI":"10.1007\/978-3-642-24550-3_19"},{"issue":"1\u20132","key":"10008_CR32","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s00453-011-9532-3","volume":"63","author":"G Sharma","year":"2012","unstructured":"Sharma, G., Busch, C.: A competitive analysis for balanced transactional memory workloads. Algorithmica 63(1\u20132), 296\u2013322 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"10008_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00446-012-0159-7","volume":"25","author":"G Sharma","year":"2012","unstructured":"Sharma, G., Busch, C.: Window-based greedy contention management for transactional memory: Theory and practice. Distrib. Comput. 25(3), 225\u2013248 (2012)","journal-title":"Distrib. Comput."},{"issue":"5","key":"10008_CR34","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s00446-014-0214-7","volume":"27","author":"G Sharma","year":"2014","unstructured":"Sharma, G., Busch, C.: Distributed transactional memory for general networks. Distrib. Comput. 27(5), 329\u2013362 (2014)","journal-title":"Distrib. Comput."},{"issue":"2","key":"10008_CR35","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"N Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distrib. Comput."},{"key":"10008_CR36","doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Lee, H.S.: Adaptive transaction scheduling for transactional memory systems. In: SPAA, pp. 169\u2013178 (2008)","DOI":"10.1145\/1378533.1378564"},{"key":"10008_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B., Palmieri, R.: Distributed transactional contention management as the traveling salesman problem. In: SIROCCO, pp. 54\u201367 (2014)","DOI":"10.1007\/978-3-319-09620-9_6"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10008-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-10008-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10008-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T12:07:30Z","timestamp":1696939650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-10008-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,23]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["10008"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-10008-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2020,10,23]]},"assertion":[{"value":"12 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}