{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T16:06:43Z","timestamp":1774541203278,"version":"3.50.1"},"reference-count":26,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":346,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62171361"],"award-info":[{"award-number":["62171361"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Sensors"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Most of the multiprocessor real\u2010time scheduling algorithms follow the partitioned approach, the global approach, or the semipartitioned approach which is a hybrid of the first two by allowing a small subset of tasks to migrate. EDF\u2010fm (Earliest Deadline First\u2010based Fixed and Migrating) and EDF\u2010os (Earliest Deadline First\u2010based Optimal Semipartitioned) are semipartitioned approaches and were proposed for soft real\u2010time sporadic task systems. Despite their desirable property that migrations are boundary\u2010limited such as they can only occur at job boundaries, EDF\u2010fm and EDF\u2010os are not always optimal and have higher tardiness and cost of overheads due to task migration. To address these issues, in this paper, we classify the systems into different types according to the utilization of their tasks and propose a new semipartitioned scheduling algorithm, earliest deadline first\u2010adaptive, dubbed as EDF\u2010adaptive. Our experiments show that EDF\u2010adaptive can achieve better performance than EDF\u2010fm and EDF\u2010os, in terms of system utilization and tardiness overhead. It is also proved that EDF\u2010adaptive is able to lessen the task migration overhead, by reducing the number of migrating jobs and the number of processors to which a task is migrated.<\/jats:p>","DOI":"10.1155\/2021\/6377024","type":"journal-article","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T03:50:07Z","timestamp":1639453807000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["EDF\u2010Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real\u2010Time"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9246-2808","authenticated-orcid":false,"given":"Shujuan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-8692","authenticated-orcid":false,"given":"Tiansen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-5780","authenticated-orcid":false,"given":"Zhihao","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2895-1727","authenticated-orcid":false,"given":"Feng","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3016-8405","authenticated-orcid":false,"given":"Wenjuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,12,13]]},"reference":[{"key":"e_1_2_9_1_2","doi-asserted-by":"crossref","unstructured":"BastoniA. BrandenburgB. B. andAndersonJ. H. An empirical com-parison of global partitioned and clustered multiprocessor EDF schedulers Proc. 31st Int. Conf. IEEE Real-Time Systems Symposium 2010 San Diego CA USA 14\u201324.","DOI":"10.1109\/RTSS.2010.23"},{"key":"e_1_2_9_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2614669"},{"key":"e_1_2_9_3_2","doi-asserted-by":"crossref","unstructured":"GeorgeL.andHermantJ. F. A norm approach for the partitioned EDF scheduling of sporadic task systems Proc. 21st Euromicro Conf. Real-Time Systems 2009 Dublin Ireland 161\u2013169.","DOI":"10.1109\/ECRTS.2009.29"},{"key":"e_1_2_9_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10617-018-9208-1"},{"key":"e_1_2_9_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.052013.130261"},{"key":"e_1_2_9_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-014-9213-9"},{"key":"e_1_2_9_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2016.2608775"},{"key":"e_1_2_9_8_2","doi-asserted-by":"crossref","unstructured":"DaoudiyE. M.andKerfaliA. Reducing the inter processor preemptions of the EDHS scheduling Proc. 5th Int.Conf. Optimization and Applications 2019 Kenitra Morocco 1\u20136.","DOI":"10.1109\/ICOA.2019.8727672"},{"key":"e_1_2_9_9_2","doi-asserted-by":"crossref","unstructured":"MoulikS.andDasZ. TASOR: a temperature-aware semi- partitioned real-time scheduler Proc. IEEE Region 10 Conf. Technology Knowledge and Society 2019 Kochi IN-DIA 1578\u20131583.","DOI":"10.1109\/TENCON.2019.8929501"},{"key":"e_1_2_9_10_2","doi-asserted-by":"crossref","unstructured":"BonifaciV. D\u2032AngeloG. andSpaccamelaA. M. Algorithms for hierarchical and semi-partitioned parallel scheduling Proc. 31st Int. Conf. IEEE Inter-national Parallel and Distributed Processing Symposium (IPDPS) 2017 Orlando FL 738\u2013747.","DOI":"10.1109\/IPDPS.2017.22"},{"key":"e_1_2_9_11_2","doi-asserted-by":"crossref","unstructured":"BastoniA. BrandenburgB. B. andAndersonJ. H. Poster ab-stract: online semi- partitioned multiprocessor scheduling of soft real-time peri-odic tasks for QoS optimization Proc. 22nd Int. Conf. IEEE Real-Time and Embedded Technology and Appli-cations Symposium 2016 Vienna AUSTRALIA 1\u20131.","DOI":"10.1109\/RTAS.2016.7461350"},{"key":"e_1_2_9_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-007-9035-0"},{"key":"e_1_2_9_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-015-0983-7"},{"key":"e_1_2_9_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-011-9127-8"},{"key":"e_1_2_9_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-013-9190-4"},{"key":"e_1_2_9_16_2","doi-asserted-by":"crossref","unstructured":"EricksonJ. P.andAndersonJ. H. Reducing tardiness under global scheduling by splitting jobs Proc. 25th Int. Conf. Real-Time Systems ECE Grad Sch Engn 2013 Paris FRANCE 14\u201324.","DOI":"10.1109\/ECRTS.2013.13"},{"key":"e_1_2_9_17_2","doi-asserted-by":"publisher","DOI":"10.12694\/scpe.v19i3.1397"},{"key":"e_1_2_9_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_9_19_2","doi-asserted-by":"crossref","unstructured":"LiuY. ZhangX. LiH. andQianD. Allocating tasks in multi-core processor based parallel systems Proc. 3rd Int. Conf. Network and Parallel Computing-Workshops 2007 Dalian China 748\u2013753.","DOI":"10.1109\/NPC.2007.26"},{"key":"e_1_2_9_20_2","doi-asserted-by":"crossref","unstructured":"SenobaryS.andNaghibzadehM. First-fit semi-partitioned scheduling based on rate monotonic algorithm 309 Proc. 1st Int. Conf. Intelligent Computing Communication and Devices SOA Univ 2015 Bhubaneswar INDIA 173\u2013181.","DOI":"10.1007\/978-81-322-2009-1_20"},{"key":"e_1_2_9_21_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.127"},{"key":"e_1_2_9_22_2","first-page":"272","article-title":"The performance evaluation of rate monotonic tasks assignment algorithms on multiprocessor","volume":"34","author":"Tao W. A. N. G.","year":"2007","journal-title":"Computer Science of China"},{"key":"e_1_2_9_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2019.01.015"},{"key":"e_1_2_9_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2018.01.002"},{"key":"e_1_2_9_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/2933388"},{"key":"e_1_2_9_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3291387"}],"container-title":["Journal of Sensors"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2021\/6377024.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/js\/2021\/6377024.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6377024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:15:43Z","timestamp":1726308943000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6377024"}},"subtitle":[],"editor":[{"given":"Gengxin","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6377024"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6377024","archive":["Portico"],"relation":{},"ISSN":["1687-725X","1687-7268"],"issn-type":[{"value":"1687-725X","type":"print"},{"value":"1687-7268","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2021-10-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6377024"}}