{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T18:54:32Z","timestamp":1772996072819,"version":"3.50.1"},"reference-count":37,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety\u2010critical real\u2010time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges. In this paper, unlike previous work, we tackle these challenges by proposing integer linear programming (ILP) models to generate optimal preemptive and non\u2010preemptive CEs, considering both partitioned and global work allocation schemes. Additionally, we introduce a local search\u2010based heuristic to efficiently produce approximate solutions. Our methods are evaluated on both synthetic and benchmark instances from the literature, encompassing thousands of tasks and complex inter\u2010task dependencies, and include a direct comparison with a state\u2010of\u2010the\u2010art approximation method. The experimental results highlight the effectiveness of the proposed approaches in generating optimal or near\u2010optimal CEs for large\u2010scale task sets.<\/jats:p>","DOI":"10.1002\/cpe.70629","type":"journal-article","created":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T14:24:47Z","timestamp":1772979887000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations"],"prefix":"10.1002","volume":"38","author":[{"given":"Bruno","family":"Nogueira","sequence":"first","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o Universidade Federal de Alagoas  Macei\u00f3 Brazil"},{"name":"Programa de P\u00f3s\u2010gradua\u00e7\u00e3o em Engenharia de Computa\u00e7\u00e3o Universidade de Pernambuco  Recife Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Lima","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o Universidade Federal Fluminense  Niter\u00f3i Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Tavares","sequence":"additional","affiliation":[{"name":"Centro de Inform\u00e1tica Universidade Federal de Pernambuco  Recife Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodrigo","family":"Paes","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o Universidade Federal de Alagoas  Macei\u00f3 Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco Airton","family":"Silva","sequence":"additional","affiliation":[{"name":"Laboratory of Applied Research to Distributed Systems Universidade Federal do Piau\u00ed  Teresina Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"key":"e_1_2_13_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02341919"},{"key":"e_1_2_13_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0967-0661(94)00072-O"},{"key":"e_1_2_13_4_1","volume-title":"Real\u2010Time Systems","author":"Liu J. W. S.","year":"2000"},{"key":"e_1_2_13_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22570-4"},{"key":"e_1_2_13_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.03.004"},{"key":"e_1_2_13_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3431232"},{"key":"e_1_2_13_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90080-9"},{"key":"e_1_2_13_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(83)90044-5"},{"key":"e_1_2_13_10_1","article-title":"Update on Using Multicore Processors With a Commercial ARINC 653 Implementation","author":"Parkinson P.","year":"2017","journal-title":"Aviation Electronics Europe"},{"key":"e_1_2_13_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSD.2014.38"},{"key":"e_1_2_13_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2021.104421"},{"key":"e_1_2_13_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS49844.2020.00012"},{"key":"e_1_2_13_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365463"},{"key":"e_1_2_13_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1754"},{"key":"e_1_2_13_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3186489"},{"key":"e_1_2_13_17_1","volume-title":"International Workshop on Explainability of Real\u2010time Systems and their Analysis (ERSA)","author":"Baruah S.","year":"2022"},{"key":"e_1_2_13_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2018.11.004"},{"key":"e_1_2_13_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2015.8"},{"key":"e_1_2_13_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-011-9069-3"},{"key":"e_1_2_13_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3086698"},{"key":"e_1_2_13_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2011.11"},{"key":"e_1_2_13_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-60588-3_13"},{"key":"e_1_2_13_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2006.1704187"},{"key":"e_1_2_13_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/330560.330566"},{"key":"e_1_2_13_26_1","first-page":"1","volume-title":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)","author":"Kyriakakis E.","year":"2021"},{"key":"e_1_2_13_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.micpro.2019.03.004"},{"key":"e_1_2_13_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISORC52572.2022.9812791"},{"key":"e_1_2_13_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126533"},{"key":"e_1_2_13_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3044724"},{"key":"e_1_2_13_31_1","volume-title":"Software Synthesis From Dataflow Graphs","author":"Bhattacharyya S. S.","year":"2012"},{"key":"e_1_2_13_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394810.3394820"},{"key":"e_1_2_13_33_1","first-page":"1","article-title":"Principles of Tabu Search","volume":"23","author":"Glover F.","year":"2007","journal-title":"Approximation Algorithms and Metaheuristics"},{"key":"e_1_2_13_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1850771.1850779"},{"key":"e_1_2_13_35_1","first-page":"43","volume-title":"6th International Workshop on Analysis Tools and Methodologies for Embedded and Real\u2010Time Systems (WATERS)","author":"Kramer S.","year":"2015"},{"key":"e_1_2_13_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_2_13_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430363"},{"key":"e_1_2_13_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS61025.2024.00010"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70629","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.70629","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T15:52:00Z","timestamp":1772985120000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1002\/cpe.70629"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70629","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"2025-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-23","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70629"}}