{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:24Z","timestamp":1750220364002,"version":"3.41.0"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T00:00:00Z","timestamp":1631491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"State Key Program of National Natural Science of China","award":["61332001"],"award-info":[{"award-number":["61332001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61802137"],"award-info":[{"award-number":["61802137"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Hubei Province, China","award":["2018CFB204"],"award-info":[{"award-number":["2018CFB204"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2022,1,31]]},"abstract":"<jats:p>\n            <jats:bold>Response Time Analysis<\/jats:bold>\n            (\n            <jats:bold>RTA<\/jats:bold>\n            ) is an important and promising technique for analyzing the schedulability of real-time tasks under both\n            <jats:bold>Global Fixed-Priority<\/jats:bold>\n            (\n            <jats:bold>G-FP<\/jats:bold>\n            ) scheduling and\n            <jats:bold>Global Earliest Deadline First<\/jats:bold>\n            (\n            <jats:bold>G-EDF<\/jats:bold>\n            ) scheduling. Most existing RTA methods for tasks under global scheduling are dominated by partitioned scheduling, due to the pessimism of the\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            -based interference calculation where\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            is the number of processors. Two-part execution scenario is an effective technique that addresses this pessimism at the cost of efficiency. The major idea of two-part execution scenario is to calculate a more accurate upper bound of the interference by dividing the execution of the target job into two parts and calculating the interference on the target job in each part. This article proposes a novel RTA execution framework that improves two-part execution scenario by reducing some unnecessary calculation, without sacrificing accuracy of the schedulability test. The key observation is that, after the division of the execution of the target job, two-part execution scenario enumerates all possible execution time of the target job in the first part for calculating the final\n            <jats:bold>Worst-Case Response Time<\/jats:bold>\n            (\n            <jats:bold>WCRT<\/jats:bold>\n            ). However, only some special execution time can cause the final result. A set of experiments is conducted to test the performance of the proposed execution framework and the result shows that the proposed execution framework can improve the efficiency of two-part execution scenario analysis by up to\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            in terms of the execution time.\n          <\/jats:p>","DOI":"10.1145\/3465474","type":"journal-article","created":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T22:50:18Z","timestamp":1631573418000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Execution Framework of Two-Part Execution Scenario Analysis"],"prefix":"10.1145","volume":"27","author":[{"given":"Ding","family":"Han","sequence":"first","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Guohui","family":"Li","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Quan","family":"Zhou","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Jianjun","family":"Li","sequence":"additional","affiliation":[{"name":"Huazhong University of Science and Technology, Wuhan, Hubei, China"}]},{"given":"Yong","family":"Yang","sequence":"additional","affiliation":[{"name":"Wuhan Fiberhome Technical Services Co., Ltd, Wuhan, Hubei, China"}]},{"given":"Xiaofei","family":"Hu","sequence":"additional","affiliation":[{"name":"Wuhan Fiberhome Technical Services Co., Ltd, Wuhan, Hubei, China"}]}],"member":"320","published-online":{"date-parts":[[2021,9,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/956418.956614"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.48"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-007-9047-9"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2009.31"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2005.40"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1782394.1782409"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.09.004"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2007.41"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2005.18"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_24"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9303-1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2016.041"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-010-9106-5"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978802.1978814"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems.","author":"Fisher Nathan","year":"2006","unstructured":"Nathan Fisher and Sanjoy Baruah . 2006 . Global static-priority scheduling of sporadic task systems on multiprocessor platforms . In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. Nathan Fisher and Sanjoy Baruah. 2006. Global static-priority scheduling of sporadic task systems on multiprocessor platforms. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2015.9"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2009.11"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.08.003"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834848.2834849"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2014.18"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2016.04.003"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2013.05.012"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2013.36"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2984633"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3167132.3167195"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2015.20"},{"key":"e_1_2_1_27_1","volume-title":"20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 1\u20139.","author":"Sun Youcheng","year":"2014","unstructured":"Youcheng Sun , Giuseppe Lipari , Nan Guan , and Wang Yi . 2014 . Improving the response time analysis of global fixed-priority multiprocessor scheduling . In 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 1\u20139. Youcheng Sun, Giuseppe Lipari, Nan Guan, and Wang Yi. 2014. Improving the response time analysis of global fixed-priority multiprocessor scheduling. In 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. 1\u20139."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3358603"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.58"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2679195"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2843763"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360513"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,13]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1,31]]}},"alternative-id":["10.1145\/3465474"],"URL":"https:\/\/doi.org\/10.1145\/3465474","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2021,9,13]]},"assertion":[{"value":"2021-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}