{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:33:08Z","timestamp":1762918388789,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_5","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"69-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fractional Bamboo Trimming and\u00a0Distributed Windows Scheduling"],"prefix":"10.1007","author":[{"given":"Arash","family":"Beikmohammadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Evans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seyed Ali","family":"Tabatabaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Adler, M., Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Paterson, M.: A proportionate fair scheduling rule with good worst-case performance. In: Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 101\u2013108 (2003)","DOI":"10.1145\/777412.777430"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Alshamrani, S.: How reduce max algorithm behaves with symptoms appearance on virtual machines in clouds. In: 2015 International Conference on Cloud Computing (ICCC), pp. 1\u20134. IEEE (2015)","DOI":"10.1109\/CLOUDCOMP.2015.7149641"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0166-5316(85)90024-0","volume":"5","author":"MH Ammar","year":"1985","unstructured":"Ammar, M.H., Wong, J.W.: The design of teletext broadcast cycles. Perform. Eval. 5(4), 235\u2013242 (1985)","journal-title":"Perform. Eval."},{"issue":"1\u20133","key":"5_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0166-218X(97)00119-4","volume":"82","author":"S Anily","year":"1998","unstructured":"Anily, S., Glass, C.A., Hassin, R.: The scheduling of maintenance service. Discrete Appl. Math. 82(1\u20133), 27\u201342 (1998)","journal-title":"Discrete Appl. Math."},{"key":"5_CR5","unstructured":"Assadi, S.: Combinatorial optimization on massive datasets: streaming, distributed, and massively parallel computation. University of Pennsylvania (2018)"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1137\/S009753970240447X","volume":"32","author":"A Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Ladner, R.E.: Windows scheduling problems for broadcast systems. SIAM J. Comput. 32(4), 1091\u20131113 (2003)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-on-demand. In: SODA, pp. 791\u201380 (2003)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Windows scheduling as a restricted version of bin packing. ACM Trans. Algorithms (TALG) 3(3), 28-es (2007)","DOI":"10.1145\/1273340.1273344"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3125644","volume":"64","author":"P Beame","year":"2017","unstructured":"Beame, P., Koutris, P., Suciu, D.: Communication steps for parallel query processing. J. ACM (JACM) 64(6), 1\u201358 (2017)","journal-title":"J. ACM (JACM)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., Kuszmaul, W.: Achieving optimal backlog in multi-processor cup games. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 1148\u20131157 (2019)","DOI":"10.1145\/3313276.3316342"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2015.08.027","volume":"605","author":"MA Bender","year":"2015","unstructured":"Bender, M.A., et al.: The minimum backlog problem. Theor. Comput. Sci. 605, 51\u201361 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Kuszmaul, W.: Randomized cup game algorithms against strong adversaries. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2059\u20132077. SIAM (2021)","DOI":"10.1137\/1.9781611976465.123"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2022.01.027","volume":"909","author":"D Bil\u00f2","year":"2022","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Leucci, S., Proietti, G., Scornavacca, G.: Cutting bamboo down to size. Theoret. Comput. Sci. 909, 54\u201367 (2022)","journal-title":"Theoret. Comput. Sci."},{"issue":"06","key":"5_CR14","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1109\/12.144627","volume":"41","author":"MY Chan","year":"1992","unstructured":"Chan, M.Y., Chin, F.Y.L.: General schedulers for the pinwheel problem based on double-integer reduction. IEEE Trans. Comput. 41(06), 755\u2013768 (1992)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR15","series-title":"International Centre for Mechanical Sciences","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-7091-2748-3_8","volume-title":"Analysis and Design of Algorithms in Combinatorial Optimization","author":"MR Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing problems: a survey. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms in Combinatorial Optimization. ICMS, vol. 266, pp. 147\u2013172. Springer, Vienna (1981). https:\/\/doi.org\/10.1007\/978-3-7091-2748-3_8"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00453-002-0938-9","volume":"34","author":"PC Fishburn","year":"2002","unstructured":"Fishburn, P.C., Lagarias, J.C.: Pinwheel scheduling: achievable densities. Algorithmica 34(1), 14\u201338 (2002)","journal-title":"Algorithmica"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"103476","DOI":"10.1016\/j.jcss.2023.103476","volume":"139","author":"L Gasieniec","year":"2024","unstructured":"Gasieniec, L., et al.: Perpetual maintenance of machines with different urgency requirements. J. Comput. Syst. Sci. 139, 103476 (2024)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-51963-0_18","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"L G\u0105sieniec","year":"2017","unstructured":"G\u0105sieniec, L., Klasing, R., Levcopoulos, C., Lingas, A., Min, J., Radzik, T.: Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors). In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 229\u2013240. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_18"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1753171.1753195","volume":"41","author":"MH Goldwasser","year":"2010","unstructured":"Goldwasser, M.H.: A survey of buffer management policies for packet switches. ACM SIGACT News 41(1), 100\u2013128 (2010)","journal-title":"ACM SIGACT News"},{"key":"5_CR21","unstructured":"H\u00f6hne, F., van Stee, R.: A 10\/7-approximation for discrete bamboo garden trimming and continuous trimming on star graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., Varvel, D.: The pinwheel: a real-time scheduling problem. In: Proceedings of the 22nd Hawaii International Conference of System Science, pp. 693\u2013702 (1989)","DOI":"10.1109\/HICSS.1989.48075"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.orl.2021.04.005","volume":"49","author":"S Im","year":"2021","unstructured":"Im, S., Moseley, B., Zhou, R.: The matroid cup game. Oper. Res. Lett. 49(3), 405\u2013411 (2021)","journal-title":"Oper. Res. Lett."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Indyk, P., Mahabadi, S., Mahdian, M., Mirrokni, V.S.: Composable core-sets for diversity and coverage maximization. In: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 100\u2013108 (2014)","DOI":"10.1145\/2594538.2594560"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948. SIAM (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Kuszmaul, J.: Bamboo trimming revisited: Simple algorithms can do well too. In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 411\u2013417 (2022)","DOI":"10.1145\/3490148.3538580"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Kuszmaul, W.: Achieving optimal backlog in the vanilla multi-processor cup game. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1558\u20131577. SIAM (2020)","DOI":"10.1137\/1.9781611975994.96"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Kuszmaul, W.: How asymmetry helps buffer management: achieving optimal tail size in cup games. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1248\u20131261 (2021)","DOI":"10.1145\/3406325.3451033"},{"key":"5_CR29","unstructured":"Kuszmaul, W., Westover, A.: The variable-processor cup game. arXiv preprint arXiv:2012.00127 (2020)"},{"issue":"1","key":"5_CR30","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"CL Liu","year":"1973","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46\u201361 (1973)","journal-title":"J. ACM (JACM)"},{"key":"5_CR31","unstructured":"Mirjalali, K., Tabatabaee, S.A., Zarrabi-Zadeh, H.: Distributed unit clustering. In: CCCG, pp. 236\u2013241 (2019)"},{"issue":"5","key":"5_CR32","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.orl.2021.07.001","volume":"49","author":"M van Ee","year":"2021","unstructured":"van Ee, M.: A 12\/7-approximation algorithm for the discrete bamboo garden trimming problem. Oper. Res. Lett. 49(5), 645\u2013649 (2021)","journal-title":"Oper. Res. Lett."},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s005300050023","volume":"4","author":"S Viswanathan","year":"1996","unstructured":"Viswanathan, S., Imielinski, T.: Metropolitan area video-on-demand service using pyramid broadcasting. Multimed. Syst. 4, 197\u2013208 (1996)","journal-title":"Multimed. Syst."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,10]],"date-time":"2024-11-10T16:17:51Z","timestamp":1731255471000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}