{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086635,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031248474"},{"type":"electronic","value":"9783031248481"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-24848-1_5","type":"book-chapter","created":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T15:08:33Z","timestamp":1673190513000},"page":"67-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Ordered Scheduling in Control-Flow Distributed Transactional Memory"],"prefix":"10.1007","author":[{"given":"Pavan","family":"Poudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shishir","family":"Rai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Swapnil","family":"Guragain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4930-4609","authenticated-orcid":false,"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,8]]},"reference":[{"issue":"1","key":"5_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":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-14720-8_17","volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"H Attiya","year":"2015","unstructured":"Attiya, H., Gramoli, V., Milani, A.: Directory protocols for distributed transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Foundations, Algorithms, Tools, and Applications. LNCS, vol. 8913, pp. 367\u2013391. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14720-8_17"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: PPoPP, pp. 247\u2013258 (2008)","DOI":"10.1145\/1345206.1345242"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Fast scheduling in distributed transactional memory. In: SPAA, pp. 173\u2013182. ACM (2017)","DOI":"10.1145\/3087556.3087565"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00446-017-0318-y","volume":"31","author":"C Busch","year":"2017","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Time-communication impossibility results for distributed transactional memory. Distrib. Comput. 31(6), 471\u2013487 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0318-y","journal-title":"Distrib. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Dynamic scheduling in distributed transactional memory. In: IPDPS, pp. 874\u2013883 (2020)","DOI":"10.1109\/IPDPS47924.2020.00094"},{"key":"5_CR8","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BFb0056478","volume-title":"Distributed Computing","author":"MJ Demmer","year":"1998","unstructured":"Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119\u2013133. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056478"},{"key":"5_CR10","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"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633048","volume":"11","author":"MA Gonzalez-Mesa","year":"2014","unstructured":"Gonzalez-Mesa, M.A., Guti\u00e9rrez, E., Zapata, E.L., Plata, O.G.: Effective transactional memory execution management for improved concurrency. ACM Trans. Archit. Code Optim. 11(3), 1\u201327 (2014)","journal-title":"ACM Trans. Archit. Code Optim."},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"LEN Gouveia","year":"2003","unstructured":"Gouveia, L.E.N., Magnanti, T.L.: Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3), 159\u2013173 (2003)","journal-title":"Networks"},{"issue":"5","key":"5_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00446-017-0310-6","volume":"31","author":"V Gramoli","year":"2018","unstructured":"Gramoli, V., Guerraoui, R., Trigonakis, V.: Tm$${}^{\\text{2 }}$$c: a software transactional memory for many-cores. Distrib. Comput. 31(5), 367\u2013388 (2018). https:\/\/doi.org\/10.1007\/s00446-017-0310-6","journal-title":"Distrib. Comput."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/MM.2011.108","volume":"32","author":"R Haring","year":"2012","unstructured":"Haring, R., et al.: The IBM Blue Gene\/Q compute chip. IEEE Micro 32(2), 48\u201360 (2012)","journal-title":"IEEE Micro"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-41527-2_9","volume-title":"Distributed Computing","author":"D Hendler","year":"2013","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: Afek, Y. (ed.) DISC 2013. LNCS, vol. 8205, pp. 121\u2013133. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41527-2_9"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: ISCA, pp. 289\u2013300 (1993)","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"5_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., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195\u2013208 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0037-x","journal-title":"Distrib. Comput."},{"key":"5_CR18","unstructured":"Hiromitsu, T., Akira, M.: An approximate solution for the Steiner problem in graphs. Math. Jap. Jpn. DA 24(6), 573\u2013577 (1980). BIBL. 9 REF. (1980)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Hirve, S., Palmieri, R., Ravindran, B.: Archie: a speculative replicated transactional system. In: Middleware, pp. 265\u2013276 (2014)","DOI":"10.1145\/2663165.2666090"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1137\/0130013","volume":"30","author":"FK Hwang","year":"1976","unstructured":"Hwang, F.K.: On Steiner minimal trees with rectilinear distance. SIAM J. Appl. Math. 30(1), 104\u2013114 (1976). https:\/\/www.jstor.org\/stable\/2100587","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Hwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. Elsevier Science (1992)","DOI":"10.1002\/net.3230220105"},{"key":"5_CR22","unstructured":"Intel (2012). https:\/\/www.software.intel.com\/en-us\/blogs\/2012\/02\/07\/transactional-synchronization-in-haswell"},{"issue":"2","key":"5_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"5_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"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Minh, C.C., Chung, J., Kozyrakis, C., Olukotun, K.: STAMP: Stanford transactional applications for multi-processing. In: IISWC, pp. 35\u201346 (2008)","DOI":"10.1109\/IISWC.2008.4636089"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Mohamedin, M., Peluso, S., Kishi, M.J., Hassan, A., Palmieri, R.: Nemo: NUMA-aware concurrency control for scalable transactional memory. In: ICPP, pp. 38:1\u201338:10 (2018)","DOI":"10.1145\/3225058.3225123"},{"key":"5_CR27","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":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-14720-8_16","volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"R Palmieri","year":"2015","unstructured":"Palmieri, R., Peluso, S., Ravindran, B.: Transaction execution models in partially replicated transactional memory: the case for data-flow and control-flow. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Foundations, Algorithms, Tools, and Applications. LNCS, vol. 8913, pp. 341\u2013366. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14720-8_16"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Poudel, P., Rai, S., Sharma, G.: Processing distributed transactions in a predefined order. In: ICDCN, pp. 215\u2013224. ACM (2021)","DOI":"10.1145\/3427796.3427819"},{"key":"5_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104700","volume":"285","author":"S Rai","year":"2021","unstructured":"Rai, S., Sharma, G., Busch, C., Herlihy, M.: Load balanced distributed directories. Inf. Comput. 285, 104700 (2021)","journal-title":"Inf. Comput."},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Saad, M.M., Kishi, M.J., Jing, S., Hans, S., Palmieri, R.: Processing transactions in a predefined order. In: PPOPP, pp. 120\u2013132 (2019)","DOI":"10.1145\/3293883.3295730"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Saad, M.M., Palmieri, R., Ravindran, B.: Lerna: parallelizing dependent loops using speculation. In: SYSTOR, pp. 37\u201348 (2018)","DOI":"10.1145\/3211890.3211897"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-24550-3_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"MM Saad","year":"2011","unstructured":"Saad, M.M., Ravindran, B.: Snake: control flow distributed software transactional memory. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 238\u2013252. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_19"},{"issue":"1\u20132","key":"5_CR34","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). https:\/\/doi.org\/10.1007\/s00453-011-9532-3","journal-title":"Algorithmica"},{"issue":"5","key":"5_CR35","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). https:\/\/doi.org\/10.1007\/s00446-014-0214-7","journal-title":"Distrib. Comput."},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.jpdc.2015.02.002","volume":"78","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C.: A load balanced directory for distributed shared memory objects. J. Parallel Distrib. Comput. 78, 6\u201324 (2015)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"5_CR37","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":"5_CR38","doi-asserted-by":"crossref","unstructured":"Turcu, A., Ravindran, B., Palmieri, R.: Hyflow2: a high performance distributed transactional memory framework in Scala. In: PPPJ, pp. 79\u201388 (2013)","DOI":"10.1145\/2500828.2500836"},{"key":"5_CR39","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":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-09620-9_6","volume-title":"Structural Information and Communication Complexity","author":"B Zhang","year":"2014","unstructured":"Zhang, B., Ravindran, B., Palmieri, R.: Distributed transactional contention management as the traveling salesman problem. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 54\u201367. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09620-9_6"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24848-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T20:34:04Z","timestamp":1728678844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24848-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031248474","9783031248481"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24848-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}