{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:59:46Z","timestamp":1742381986487},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J CIRCUIT SYST COMP"],"published-print":{"date-parts":[[2017,10]]},"abstract":"<jats:p> The integration of mixed-critical tasks into a platform is an increasingly important trend in the design of real-time systems due to its efficient resource usage. With a growing variety of activation patterns considered in real-time systems, some of them capture arbitrary activation patterns. As a consequence, the existing scheduling approaches in mixed-criticality systems (MCs), which assume the sporadic tasks with implicit deadlines, have sometimes become inapplicable or are ineffective. In this paper, we extend the sporadically activated task model to the arbitrarily activated task model in MCs with the preemptive fixed-task-priority schedule. By using the event arrival curve to model task activations, we present the necessary and sufficient schedulability tests that are based on the well-established results from Real-Time Calculus. We propose to use the busy-window analysis to do the sufficient test because it has been shown to be tighter than the sufficient test of using Real-Time Calculus. According to our experimental results, for sporadic task sets, our proposed test can achieve the same performance as the state-of-the-art schedulability test. However, compared with the previous schedulability analysis of preemptive fixed-task-priority, our approaches can handle more general tasks with blocking, jitter, and arbitrary deadlines. <\/jats:p>","DOI":"10.1142\/s0218126617501596","type":"journal-article","created":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T23:06:52Z","timestamp":1489014412000},"page":"1750159","source":"Crossref","is-referenced-by-count":6,"title":["Schedulability Analysis Towards Arbitrarily Activated Tasks in Mixed-Criticality Systems"],"prefix":"10.1142","volume":"26","author":[{"given":"Biao","family":"Hu","sequence":"first","affiliation":[{"name":"Institute of Robotics and Embedded Systems, Technical University Munich, Boltzmannstr. 3, Garching 85748, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Xiaoguwei Island, Panyu District, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Computer Science and Engineering, Northeastern University, Wenhua Road, Heping District, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Cheng","sequence":"additional","affiliation":[{"name":"Institute of Robotics and Embedded Systems, Technical University Munich, Boltzmannstr. 3, Garching 85748, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongkun","family":"Han","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering, University of Michigan, Francois-Xavier Bagnoud Building, 1320 Beal Ave, Ann Arbor, MI 48109, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alois","family":"Knoll","sequence":"additional","affiliation":[{"name":"School of Data and Computer Science, Sun Yat-sen University, Xiaoguwei Island, Panyu District, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"key":"S0218126617501596BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-013-9187-z"},{"key":"S0218126617501596BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.05.011"},{"key":"S0218126617501596BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/BF01088593"},{"key":"S0218126617501596BIB014","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20045088"},{"key":"S0218126617501596BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126617500165"},{"key":"S0218126617501596BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0218126616500626"},{"key":"S0218126617501596BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00165-4"},{"key":"S0218126617501596BIB020","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-010-9107-4"},{"key":"S0218126617501596BIB021","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21338-0_13"},{"key":"S0218126617501596BIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24541-1_12"},{"key":"S0218126617501596BIB029","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45318-0"},{"key":"S0218126617501596BIB033","volume-title":"Optimal Priority Assignment and Feasibility of Static Priority Tasks with Arbitrary Start Times","author":"Audsley N. C.","year":"1991"}],"container-title":["Journal of Circuits, Systems and Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218126617501596","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:01:00Z","timestamp":1565139660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218126617501596"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,8]]},"references-count":12,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2017,2,27]]},"published-print":{"date-parts":[[2017,10]]}},"alternative-id":["10.1142\/S0218126617501596"],"URL":"https:\/\/doi.org\/10.1142\/s0218126617501596","relation":{},"ISSN":["0218-1266","1793-6454"],"issn-type":[{"value":"0218-1266","type":"print"},{"value":"1793-6454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,8]]}}}