{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:13Z","timestamp":1750309453313,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"German Research Foundation (DFG)","award":["JA 612\/25-1"],"award-info":[{"award-number":["JA 612\/25-1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,11,6]]},"DOI":"10.1145\/3696355.3696358","type":"proceedings-article","created":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T11:55:46Z","timestamp":1735905346000},"page":"37-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Power of Duality: Response Time Analysis meets Integer Programming"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3083-7998","authenticated-orcid":false,"given":"Max A.","family":"Deppert","sequence":"first","affiliation":[{"name":"Kiel University, Kiel, DE"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8358-6796","authenticated-orcid":false,"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[{"name":"Kiel University, Kiel, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"N.C. Audsley A. Burns M.F. Richardson and A.J. Wellings. 1991. Hard Real-Time Scheduling: The Deadline-Monotonic Approach. IFAC Proceedings Volumes 24 2 (1991) 127\u2013132. 10.1016\/S1474-6670(17)51283-5IFAC\/IFIP Workshop on Real Time Programming Atlanta GA USA 15-17 May 1991.","DOI":"10.1016\/S1474-6670(17)51283-5"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"Neil\u00a0C. Audsley Alan Burns Mike\u00a0M. Richardson Ken Tindell and Andy\u00a0J. Wellings. 1993. Applying new scheduling theory to static priority pre-emptive scheduling. Softw. Eng. J. 8 5 (1993) 284\u2013292. 10.1049\/sej.1993.0034","DOI":"10.1049\/sej.1993.0034"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","unstructured":"Sanjoy\u00a0K. Baruah. 2011. Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling. Real Time Syst. 47 6 (2011) 517\u2013533. 10.1007\/s11241-011-9137-6 https:\/\/dl.acm.org\/doi\/10.1007\/s11241-011-9137-6","DOI":"10.1007\/s11241-011-9137-6"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS49844.2020.00046"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1997.641270"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1201\/9780203489802.ch28"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Enrico Bini Thi Huyen\u00a0Chau Nguyen Pascal Richard and Sanjoy\u00a0K. Baruah. 2009. A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines. IEEE Trans. Computers 58 2 (2009) 279\u2013286. 10.1109\/TC.2008.167 https:\/\/dl.acm.org\/doi\/10.1109\/TC.2008.167","DOI":"10.1109\/TC.2008.167"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2015.9"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2013.31"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ECRTS.2021.14"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2016.041"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2020.33"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68891-4_30"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Michele Conforti and Giacomo Zambelli. 2009. The mixing set with divisible capacities: A simple approach. Oper. Res. Lett. 37 6 (2009) 379\u2013383. 10.1016\/j.orl.2009.07.001 https:\/\/dl.acm.org\/doi\/10.1016\/j.orl.2009.07.001","DOI":"10.1016\/j.orl.2009.07.001"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2021.33"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.18"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.49"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2008.25"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_8"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS49844.2020.00036"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","unstructured":"Werner Grass and Thi Huyen\u00a0Chau Nguyen. 2018. Improved response-time bounds in fixed priority scheduling with arbitrary deadlines. Real Time Syst. 54 1 (2018) 1\u201330. 10.1007\/s11241-017-9282-7 https:\/\/dl.acm.org\/doi\/10.1007\/s11241-017-9282-7","DOI":"10.1007\/s11241-017-9282-7"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Oktay G\u00fcnl\u00fck and Yves Pochet. 2001. Mixing mixed-integer inequalities. Math. Program. 90 3 (2001) 429\u2013457. 10.1007\/PL00011430","DOI":"10.1007\/PL00011430"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13036-6_17"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"Mathai Joseph and Paritosh\u00a0K. Pandya. 1986. Finding Response Times in a Real-Time System. Comput. J. 29 5 (1986) 390\u2013395. 10.1093\/comjnl\/29.5.390","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"e_1_3_3_1_27_2","doi-asserted-by":"publisher","unstructured":"Joanna J\u00f3zefowska Lukasz J\u00f3zefowski and Wieslaw Kubiak. 2009. Apportionment methods and the Liu-Layland problem. Eur. J. Oper. Res. 193 3 (2009) 857\u2013864. 10.1016\/j.ejor.2007.11.007","DOI":"10.1016\/j.ejor.2007.11.007"},{"key":"e_1_3_3_1_28_2","doi-asserted-by":"publisher","unstructured":"Wieslaw Kubiak. 2005. Solution of The Liu-Layland Problem Via Bottleneck Just-In-Time Sequencing. J. Sched. 8 4 (2005) 295\u2013302. 10.1007\/s10951-005-1638-5 https:\/\/dl.acm.org\/doi\/10.1007\/s10951-005-1638-5","DOI":"10.1007\/s10951-005-1638-5"},{"key":"e_1_3_3_1_29_2","doi-asserted-by":"publisher","unstructured":"Tei-Wei Kuo and Aloysius\u00a0K. Mok. 1997. Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems. IEEE Trans. Computers 46 12 (1997) 1313\u20131324. 10.1109\/12.641932 https:\/\/dl.acm.org\/doi\/10.1109\/12.641932","DOI":"10.1109\/12.641932"},{"key":"e_1_3_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1990.128748"},{"key":"e_1_3_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"e_1_3_3_1_32_2","doi-asserted-by":"publisher","unstructured":"C.\u00a0L. Liu and James\u00a0W. Layland. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM 20 1 (1973) 46\u201361. 10.1145\/321738.321743https:\/\/dl.acm.org\/doi\/10.1145\/321738.321743","DOI":"10.1145\/321738.321743"},{"key":"e_1_3_3_1_33_2","doi-asserted-by":"publisher","unstructured":"Andrew\u00a0J. Miller and Laurence\u00a0A. Wolsey. 2003. Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98 1-3 (2003) 73\u201388. 10.1007\/s10107-003-0397-3 https:\/\/dl.acm.org\/doi\/10.1007\/s10107-003-0397-3","DOI":"10.1007\/s10107-003-0397-3"},{"key":"e_1_3_3_1_34_2","unstructured":"Aloysius\u00a0Ka-Lau Mok. 1983. Fundamental design problems of distributed systems for the hard-real-time environment. Ph.\u00a0D. Dissertation. Massachusetts Institute of Technology Cambridge MA USA. https:\/\/hdl.handle.net\/1721.1\/15670"},{"key":"e_1_3_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06678-8_33"},{"key":"e_1_3_3_1_36_2","doi-asserted-by":"publisher","unstructured":"Timm Oertel Joseph Paat and Robert Weismantel. 2022. A Colorful Steinitz Lemma with Applications to Block Integer Programs. 10.48550\/ARXIV.2201.05874","DOI":"10.48550\/ARXIV.2201.05874"},{"key":"e_1_3_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.5555\/31027"},{"key":"e_1_3_3_1_38_2","volume-title":"Production Planning by Mixed Integer Programming","author":"Pochet Yves","year":"2006","unstructured":"Yves Pochet and Laurence\u00a0A. Wolsey. 2006. Production Planning by Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering, Berlin, Heidelberg."},{"key":"e_1_3_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/1478873.1478995"},{"key":"e_1_3_3_1_40_2","doi-asserted-by":"publisher","unstructured":"Abhishek Singh. 2024. Cutting-plane algorithms for preemptive uniprocessor scheduling problems. Real Time Syst. 60 1 (2024) 24\u201373. 10.1007\/S11241-023-09408-Y","DOI":"10.1007\/S11241-023-09408-Y"},{"key":"e_1_3_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1998.739773"},{"key":"e_1_3_3_1_42_2","doi-asserted-by":"publisher","unstructured":"Ken Tindell Alan Burns and Andy\u00a0J. Wellings. 1994. An Extendible Approach for Analyzing Fixed Priority Hard Real-Time Tasks. Real Time Syst. 6 2 (1994) 133\u2013151. 10.1007\/BF01088593 https:\/\/dl.acm.org\/doi\/10.1007\/BF01088593","DOI":"10.1007\/BF01088593"},{"key":"e_1_3_3_1_43_2","volume-title":"LQG-Based Scheduling and Control Co-Design Using Harmonic Task Periods","author":"Xu Yang","year":"2016","unstructured":"Yang Xu, Anton Cervin, and Karl-Erik \u00c5rz\u00e9n. 2016. LQG-Based Scheduling and Control Co-Design Using Harmonic Task Periods. Technical Report. Department of Automatic Control, Lund Institute of Technology, Lund University. https:\/\/lup.lub.lu.se\/search\/ws\/files\/10751577\/bare_conf.pdf"},{"key":"e_1_3_3_1_44_2","doi-asserted-by":"publisher","unstructured":"Ming Zhao and Ismael\u00a0R. de Farias\u00a0Jr.2008. The mixing-MIR set with divisible capacities. Math. Program. 115 1 (2008) 73\u2013103. 10.1007\/s10107-007-0140-6 https:\/\/dl.acm.org\/doi\/10.1007\/s10107-007-0140-6","DOI":"10.1007\/s10107-007-0140-6"}],"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\/10.1145\/3696355.3696358","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696355.3696358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:11Z","timestamp":1750295411000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696355.3696358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,6]]},"references-count":43,"alternative-id":["10.1145\/3696355.3696358","10.1145\/3696355"],"URL":"https:\/\/doi.org\/10.1145\/3696355.3696358","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"}}]}}