{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T19:57:15Z","timestamp":1767211035684,"version":"3.37.3"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2018,6,30]]},"abstract":"<jats:p> Recently, an increasing number of real-time systems are implemented on multicore systems. To fully utilize the computation power of multicore systems, the scheduling problem of the real-time parallel task model is receiving more attention. Different types of scheduling algorithms and analysis techniques have been proposed for parallel real-time tasks modeled as directed acyclic graphs (DAG). In this paper, we study the scheduling problem for DAGs under the decomposition paradigm. We propose a new schedulability test and corresponding decomposition strategy. We show that this new decomposition approach strictly dominates the latest decomposition-based approach. Simulations are conducted to evaluate the real-time performance of our proposed scheduling algorithm, against the state-of-the-art scheduling and analysis methods of different types. Experimental results show that our method consistently outperforms other global methods under different parameter settings. <\/jats:p>","DOI":"10.1142\/s0218126618501013","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:08:19Z","timestamp":1508976499000},"page":"1850101","source":"Crossref","is-referenced-by-count":4,"title":["Improved Decomposition-Based Global EDF Scheduling of DAGs"],"prefix":"10.1142","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2675-2895","authenticated-orcid":false,"given":"Xu","family":"Jiang","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Beihang University, Beijing 100191, P. R. China"}]},{"given":"Xiang","family":"Long","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Beihang University, Beijing 100191, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,3,26]]},"reference":[{"doi-asserted-by":"publisher","key":"S0218126618501013BIB002","DOI":"10.1007\/BF01995675"},{"doi-asserted-by":"publisher","key":"S0218126618501013BIB003","DOI":"10.1007\/s11241-012-9166-9"},{"doi-asserted-by":"publisher","key":"S0218126618501013BIB005","DOI":"10.1109\/TPDS.2013.2297919"},{"doi-asserted-by":"publisher","key":"S0218126618501013BIB010","DOI":"10.1023\/A:1008022923184"},{"doi-asserted-by":"publisher","key":"S0218126618501013BIB011","DOI":"10.1093\/ietisy\/e89-d.6.1962"},{"doi-asserted-by":"publisher","key":"S0218126618501013BIB017","DOI":"10.1007\/978-3-642-35476-2_2"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126618501013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:30:26Z","timestamp":1565083826000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126618501013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,26]]},"references-count":6,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2018,3,26]]},"published-print":{"date-parts":[[2018,6,30]]}},"alternative-id":["10.1142\/S0218126618501013"],"URL":"https:\/\/doi.org\/10.1142\/s0218126618501013","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"type":"print","value":"0218-1266"},{"type":"electronic","value":"1793-6454"}],"subject":[],"published":{"date-parts":[[2018,3,26]]}}}