{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T05:29:00Z","timestamp":1735968540534,"version":"3.32.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100006601","name":"Ministero degli Affari Esteri e della Cooperazione Internazionale","doi-asserted-by":"publisher","award":["PGR02086"],"id":[{"id":"10.13039\/501100006601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,11,6]]},"DOI":"10.1145\/3696355.3699705","type":"proceedings-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T11:55:46Z","timestamp":1735905346000},"page":"59-69","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["SimPFair: tight fairness at low cost"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9205-584X","authenticated-orcid":false,"given":"Enrico","family":"Bini","sequence":"first","affiliation":[{"name":"University of Turin, Torino, IT"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5561-7882","authenticated-orcid":false,"given":"Val\u00e9rie","family":"Berth\u00e9","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Paris Cit\u00e9, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Boris Adamczewski. 2003. Balances for fixed points of primitive substitutions. Theoret. Comput. Sci. 307 1 (2003) 47\u201375. 10.1016\/S0304-3975(03)00092-6Words.","DOI":"10.1016\/S0304-3975(03)00092-6"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2000.853990"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Sanjoy\u00a0K. Baruah Neil\u00a0K. Cohen Greg Plaxton and Donald\u00a0A. Varvel. 1996. Proportionate Progress: A Notion of Fairness in Resource Allocation. Algorithmica 15 6 (jun 1996) 600\u2013625. 10.1007\/BF01940883","DOI":"10.1007\/BF01940883"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1090\/crmm\/027"},{"key":"e_1_3_3_1_6_2","unstructured":"V. Berth\u00e9 O. Carton N. Chevallier W. Steienr and R. Yassawi. 2024. A dynamical view of Tijdeman\u2019s solution of the chairman assignment problem. (2024). https:\/\/arxiv.org\/abs\/2405.08532 arXiv:https:\/\/arXiv.org\/abs\/2405.08532."},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2997465.2997468"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781119440284"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Nadia Brauner and Yves Crama. 2004. The maximum deviation just-in-time scheduling problem. Discrete Appl. Math. 134 1-3 (2004) 25\u201350. 10.1016\/S0166-218X(03)00222-1","DOI":"10.1016\/S0166-218X(03)00222-1"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Nadia Brauner and Vincent Jost. 2008. Small deviations JIT sequencing and symmetric case of Fraenkel\u2019s conjecture. Discrete Math. 308 11 (2008) 2319\u20132324. 10.1016\/j.disc.2006.08.012","DOI":"10.1016\/j.disc.2006.08.012"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.2001.929861"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Alan\u00a0J. Demers Srinivasan Keshav and Scott Shenker. 1989. Analysis and simulation of a fair queueing algorithm. ACM SIGCOMM Computer Communication Review 19 4 (1989) 1\u201312. 10.1145\/75246.75248","DOI":"10.1145\/75246.75248"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Aviezri\u00a0S. Fraenkel. 1973. Complementing and exactly covering sequences. J. Combinatorial Theory Ser. A 14 1 (1973) 8\u201320. 10.1016\/0097-3165(73)90059-9","DOI":"10.1016\/0097-3165(73)90059-9"},{"key":"e_1_3_3_1_14_2","unstructured":"Philip Holman and James\u00a0H. Anderson. 2005. Adapting Pfair scheduling for symmetric multiprocessors. Journal of Embedded Computing 1 4 (2005) 543\u2013564. http:\/\/content.iospress.com\/articles\/journal-of-embedded-computing\/jec00052"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Manolis Katevenis Stefanos Sidiropoulos and Costas Courcoubetis. 1991. Weighted round-robin cell multiplexing in a general-purpose ATM switch chip. IEEE Journal on selected Areas in Communications 9 8 (1991) 1265\u20131279.","DOI":"10.1109\/49.105173"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45318-0"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2002.1006576"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Chung\u00a0Laung Liu and James\u00a0W Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM (JACM) 20 1 (1973) 46\u201361.","DOI":"10.1145\/321738.321743"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2010.22"},{"key":"e_1_3_3_1_20_2","unstructured":"Yasuhiro Monden. 1983. Toyota production system. An Integrated Apprpach to Just-In-Time (1983)."},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"Geoffrey Nelissen Hang Su Yifeng Guo Dakai Zhu Vincent N\u00e9lis and Jo\u00ebl Goossens. 2014. An optimal boundary fair scheduling. Real-Time Systems 50 4 (2014) 456\u2013508. 10.1007\/s11241-014-9201-0","DOI":"10.1007\/s11241-014-9201-0"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Abhay\u00a0K. Parekh and Robert\u00a0G. Gallager. 1993. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE\/ACM transactions on networking 1 3 (1993) 344\u2013357. 10.1109\/90.234856","DOI":"10.1109\/90.234856"},{"key":"e_1_3_3_1_23_2","volume-title":"From Christoffel words to Markoff numbers","author":"Reutenauer Christophe","year":"2019","unstructured":"Christophe Reutenauer. 2019. From Christoffel words to Markoff numbers. Oxford University Press, Oxford. xi+156 pages."},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Madhavapeddi Shreedhar and George Varghese. 1996. Efficient fair queuing using deficit round-robin. IEEE\/ACM Transactions on networking 4 3 (1996) 375\u2013385.","DOI":"10.1109\/90.502236"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"crossref","unstructured":"George Steiner and Julian\u00a0Scott Yeomans. 1996. Optimal level schedules in mixed-model multi-level JIT assembly systems with pegging. European Journal of Operational Research 95 1 (November 1996) 38\u201352.","DOI":"10.1016\/0377-2217(95)00254-5"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"crossref","unstructured":"Seyed\u00a0Mohammadhossein Tabatabaee Jean-Yves Le\u00a0Boudec and Marc Boyer. 2021. Interleaved weighted round-robin: A network calculus analysis. IEICE Transactions on Communications 104 12 (2021) 1479\u20131493.","DOI":"10.1587\/transcom.2021ITI0001"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Robert Tijdeman. 1973. On a distribution problem in finite and countable sets. J. Combinatorial Theory Ser. A 15 (1973) 129\u2013137. 10.1016\/s0097-3165(73)80002-0","DOI":"10.1016\/s0097-3165(73)80002-0"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Robert Tijdeman. 1980. The chairman assignment problem. Discrete Mathematics 32 3 (1980) 323\u2013330. 10.1016\/0012-365X(80)90269-1","DOI":"10.1016\/0012-365X(80)90269-1"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Robert Tijdeman. 2000. Fraenkel\u2019s conjecture for six sequences. Discrete Math. 222 1-3 (2000) 223\u2013234. 10.1016\/S0012-365X(99)00411-2","DOI":"10.1016\/S0012-365X(99)00411-2"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"crossref","unstructured":"L. Vuillon. 2003. Balanced words. Bull. Belg. Math. Soc. Simon Stevin 10 suppl. (2003) 787\u2013805.","DOI":"10.36045\/bbms\/1074791332"},{"key":"e_1_3_3_1_31_2","first-page":"1032","volume-title":"Proceedings of ICC\/SUPERCOMM\u201994-1994 International Conference on Communications","author":"Wang Yao-Tzung","year":"1994","unstructured":"Yao-Tzung Wang, Tzung-Pao Lin, and Kuo-Chung Gan. 1994. An improved scheduling algorithm for weighted round-robin cell multiplexing in an ATM switch. In Proceedings of ICC\/SUPERCOMM\u201994-1994 International Conference on Communications. IEEE, 1032\u20131037."},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.26"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1996.497885"},{"key":"e_1_3_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2003.1253262"}],"event":{"name":"RTNS 2024: The 32nd International Conference on Real-Time Networks and Systems","acronym":"RTNS 2024","location":"Porto Portugal"},"container-title":["Proceedings of the 32nd International Conference on Real-Time Networks and Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696355.3699705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T12:39:00Z","timestamp":1735907940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696355.3699705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,6]]},"references-count":33,"alternative-id":["10.1145\/3696355.3699705","10.1145\/3696355"],"URL":"https:\/\/doi.org\/10.1145\/3696355.3699705","relation":{},"subject":[],"published":{"date-parts":[[2024,11,6]]},"assertion":[{"value":"2025-01-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}