{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:37:09Z","timestamp":1761896229053},"reference-count":0,"publisher":"University of Zielona G\u00f3ra, Poland","issue":"4","license":[{"start":{"date-parts":[[2015,12,1]],"date-time":"2015-12-01T00:00:00Z","timestamp":1448928000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.<\/jats:p>","DOI":"10.1515\/amcs-2015-0051","type":"journal-article","created":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T12:12:01Z","timestamp":1454069521000},"page":"709-722","source":"Crossref","is-referenced-by-count":7,"title":["Maintaining the Feasibility of Hard Real\u2013Time Systems with a Reduced Number of Priority Levels"],"prefix":"10.61822","volume":"25","author":[{"given":"Muhammad Bilal","family":"Qureshi","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, COMSATS Institute of Information Technology, Islamabad 46000, Pakistan"}]},{"given":"Saleh","family":"Alrashed","sequence":"additional","affiliation":[{"name":"College of Computer Science and Information Technology, University of Dammam, Saudi Arabia"}]},{"given":"Nasro","family":"Min-Allah","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, COMSATS Institute of Information Technology, Islamabad 46000, Pakistan"},{"name":"College of Computer Science and Information Technology, University of Dammam, Saudi Arabia"}]},{"given":"Joanna","family":"Ko\u0142odziej","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Cracow University of Technology, ul. Warszawska 24, 31-155 Cracow, Poland"}]},{"given":"Piotr","family":"Arabas","sequence":"additional","affiliation":[{"name":"Institute of Control and Computation Engineering, Warsaw University of Technology, W\u0105wozowa 18, 02-796 Warsaw, Poland"}]}],"member":"37438","published-online":{"date-parts":[[2015,12,30]]},"container-title":["International Journal of Applied Mathematics and Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/amcs\/25\/4\/article-p709.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/amcs-2015-0051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T22:56:51Z","timestamp":1715813811000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/amcs-2015-0051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,1]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,12,30]]},"published-print":{"date-parts":[[2015,12,1]]}},"alternative-id":["10.1515\/amcs-2015-0051"],"URL":"https:\/\/doi.org\/10.1515\/amcs-2015-0051","relation":{},"ISSN":["2083-8492"],"issn-type":[{"value":"2083-8492","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,1]]}}}