{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:40:44Z","timestamp":1763415644077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"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-30448-4_13","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"172-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Stable Scheduling in\u00a0Transactional Memory"],"prefix":"10.1007","author":[{"given":"Costas","family":"Busch","sequence":"first","affiliation":[]},{"given":"Bogdan S.","family":"Chlebus","sequence":"additional","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]},{"given":"Pavan","family":"Poudel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jcss.2018.07.001","volume":"99","author":"L Anantharamu","year":"2019","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Packet latency of deterministic broadcasting in adversarial multiple access channels. J. Comput. Syst. Sci. 99, 27\u201352 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1), 39\u201369 (2001)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR3","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":"13_CR4","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"},{"issue":"10","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jpdc.2012.05.012","volume":"72","author":"H Attiya","year":"2012","unstructured":"Attiya, H., Milani, A.: Transactional scheduling for read-dominated workloads. J. Parallel Distrib. Comput. 72(10), 1386\u20131396 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 325\u2013332 (2005)","DOI":"10.1145\/1073970.1074023"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13\u201338 (2001)","journal-title":"J. ACM"},{"issue":"6","key":"13_CR8","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s00446-017-0318-y","volume":"31","author":"C Busch","year":"2018","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Time-communication impossibility results for distributed transactional memory. Distrib. Comput. 31(6), 471\u2013487 (2018)","journal-title":"Distrib. Comput."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s00224-020-10008-7","volume":"65","author":"C Busch","year":"2021","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Fast scheduling in distributed transactional memory. Theory Comput. Syst. 65(2), 296\u2013322 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00446-021-00410-w","volume":"35","author":"C Busch","year":"2022","unstructured":"Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Dynamic scheduling in distributed transactional memory. Distrib. Comput. 35(1), 19\u201336 (2022)","journal-title":"Distrib. Comput."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Hradovich, E., Jurdzi\u0144ski, T., Klonowski, M., Kowalski, D.R.: Energy efficient adversarial routing in shared channels. In: Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 191\u2013200. ACM (2019)","DOI":"10.1145\/3323165.3323190"},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00446-009-0086-4","volume":"22","author":"BS Chlebus","year":"2009","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Maximum throughput of multiple access channels in adversarial environments. Distrib. Comput. 22(2), 93\u2013116 (2009)","journal-title":"Distrib. Comput."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple access channel. ACM Trans. Algorithms 8(1), 5:1\u20135:31 (2012)","DOI":"10.1145\/2071379.2071384"},{"key":"13_CR14","unstructured":"Garncarek, P., Jurdzinski, T., Kowalski, D.R.: Stable memoryless queuing under contention. In: Proceedings of the $$33$$rd International Symposium on Distributed Computing (DISC). LIPIcs, vol. 146, pp. 17:1\u201317:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Garncarek, P., Jurdzinski, T., Kowalski, D.R.: Efficient local medium access. In: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 247\u2013257. ACM (2020)","DOI":"10.1145\/3350755.3400292"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-14720-8_10","volume-title":"Transactional Memory. Foundations, Algorithms, Tools, and Applications","author":"D Hendler","year":"2015","unstructured":"Hendler, D., Suissa-Peleg, A.: Scheduling-based contention management techniques for transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Foundations, Algorithms, Tools, and Applications. LNCS, vol. 8913, pp. 213\u2013227. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14720-8_10"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: Proceedings of the 20th Annual International Symposium on Computer Architecture, pp. 289\u2013300. ACM (1993)","DOI":"10.1145\/173682.165164"},{"issue":"3","key":"13_CR18","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)","journal-title":"Distrib. Comput."},{"issue":"5","key":"13_CR19","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":"13_CR20","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":"13_CR21","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":"13_CR22","doi-asserted-by":"crossref","unstructured":"Spear, M.F., Dalessandro, L., Marathe, V.J., Scott, M.L.: A comprehensive strategy for contention management in software transactional memory. In: Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP), pp. 141\u2013150. ACM (2009)","DOI":"10.1145\/1504176.1504199"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Brief announcement: On enhancing concurrency in distributed transactional memory. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 73\u201374. ACM (2010)","DOI":"10.1145\/1835698.1835715"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Brief announcement: queuing or priority queuing? On the design of cache-coherence protocols for distributed transactional memory. In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 75\u201376. ACM (2010)","DOI":"10.1145\/1835698.1835716"},{"key":"13_CR25","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","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:04:01Z","timestamp":1684191841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_13","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":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","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":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"49","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":"25","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":"0","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":"51% - 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","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":"6","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)"}},{"value":"3 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}