{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:44:25Z","timestamp":1760240665661,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T00:00:00Z","timestamp":1564531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2019R1F1A1059663"],"award-info":[{"award-number":["2019R1F1A1059663"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>A timing constraint and a high level of reliability are the fundamental requirements for designing hard real-time systems. To support both requirements, the N modular redundancy (NMR) technique as a fault-tolerant real-time scheduling has been proposed, which executes identical copies for each task simultaneously on multiprocessor platforms, and a single correct one is voted on, if any. However, this technique can compromise the schedulability of the target system during improving reliability because it produces N identical copies of each job that execute in parallel on multiprocessor platforms, and some tasks may miss their deadlines due to the enlarged computing power required for completing their executions. In this paper, we propose task-level N modular redundancy (TL-NMR), which improves the system reliability of the target system of which tasks are scheduled by any fixed-priority (FP) scheduling without schedulability loss. Based on experimental results, we demonstrate that TL-NMR maintains the schedulability, while significantly improving average system safety compared to the existing NMR.<\/jats:p>","DOI":"10.3390\/sym11080960","type":"journal-article","created":{"date-parts":[[2019,7,31]],"date-time":"2019-07-31T11:37:07Z","timestamp":1564573027000},"page":"960","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An N-Modular Redundancy Framework Incorporating Response-Time Analysis on Multiprocessor Platforms"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9115-9452","authenticated-orcid":false,"given":"Jaemin","family":"Baek","sequence":"first","affiliation":[{"name":"Agency for Defense Development (ADD), Defense Satellite Systems PMO, Daejeon 34063, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6752-3936","authenticated-orcid":false,"given":"Jeonghyun","family":"Baek","sequence":"additional","affiliation":[{"name":"Agency for Defense Development (ADD), The 3rd R&amp;D Institute-3rd Directorate, Daejeon 34063, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3228-0951","authenticated-orcid":false,"given":"Jeeheon","family":"Yoo","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Incheon National University (INU), Incheon 22012, Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-3556","authenticated-orcid":false,"given":"Hyeongboo","family":"Baek","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Incheon National University (INU), Incheon 22012, Korea"}]}],"member":"1968","published-online":{"date-parts":[[2019,7,31]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","article-title":"Scheduling Algorithms for Multi-programming in A Hard-Real-Time Environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. ACM"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ekpo, S., and George, D. (2010, January 5\u20138). A system-based design methodology and architecture for highly adaptive small satellites. Proceedings of the IEEE International Systems Conference, San Diego, CA, USA.","DOI":"10.1109\/SYSTEMS.2010.5482323"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/TSE.1975.6312842","article-title":"System structure for software fault tolerance","volume":"SE-1","author":"Randell","year":"1975","journal-title":"IEEE Trans. Softw. Eng."},{"key":"ref_4","first-page":"132","article-title":"A review of fault tolerant scheduling in multicore systems","volume":"4","author":"Malhotra","year":"2015","journal-title":"Int. J. Sci. Technol. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"990","DOI":"10.15837\/ijccc.2012.5.1358","article-title":"A Fault-Tolerant Scheduling Algorithm using Hybrid Overloading Technology for Dynamic Grouping based Multiprocessor Systems","volume":"7","author":"Yu","year":"2012","journal-title":"Int. J. Comput. Commun. Control."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218126617500165","article-title":"Fault-Tolerant Task Scheduling for Mixed-Criticality Real-Time Systems","volume":"26","author":"Zhou","year":"2017","journal-title":"J. Circuits Syst. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1109\/71.584093","article-title":"Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems","volume":"8","author":"Ghosh","year":"1997","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1109\/71.735960","article-title":"A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis","volume":"9","author":"Manimaran","year":"1998","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.jpdc.2004.03.015","article-title":"Efficient overloading techniques for primary-backup scheduling in real-time systems","volume":"64","author":"Somani","year":"2004","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Cirinei, M., Bini, E., Lipari, G., and Ferrari, A. (2007, January 26\u201330). A Flexible Scheme for Scheduling Fault-Tolerant Real-Time Tasks on Multiprocessors. Proceedings of the IEEE International Parallel and Distributed Processing Symposium, Rome, Italy.","DOI":"10.1109\/IPDPS.2007.370342"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/TC.2011.42","article-title":"A comparative study of system-level energy management methods for fault-tolerant hard real-time systems","volume":"60","author":"Aminzadeh","year":"2011","journal-title":"IEEE Trans. Comput."},{"key":"ref_12","unstructured":"Bertogna, M., Cirinei, M., and Lipari, G. (2005, January 6\u20138). Improved Schedulability Analysis of EDF on Multiprocessor Platforms. Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), Balearic Islands, Spain."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Bertogna, M., and Cirinei, M. (2007, January 3\u20136). Response-Time Analysis for globally scheduled Symmetric Multiprocessor Platforms. Proceedings of the IEEE Real-Time Systems Symposium (RTSS), Tucson, AZ, USA.","DOI":"10.1109\/RTSS.2007.31"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TPDS.2008.129","article-title":"Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms","volume":"20","author":"Bertogna","year":"2009","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_15","unstructured":"Baker, T.P. (2005). Comparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority EDF Scheduling for Hard Real-Time, Department of Computer Science, Florida State University. Technical Report TR\u2013050601."},{"key":"ref_16","unstructured":"Andersson, B., Bletsas, K., and Baruah, S. (December, January 30). Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessor. Proceedings of the IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, Barcelona, Spain."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/12.57058","article-title":"Priority Inheritance Protocols: An Approach to Real-Time Synchronization","volume":"39","author":"Sha","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Easwaran, A., and Adersson, B. (2009, January 1\u20134). Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling. Proceedings of the IEEE Real-Time Systems Symposium (RTSS), Washington, DC, USA.","DOI":"10.1109\/RTSS.2009.37"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/8\/960\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:11:37Z","timestamp":1760188297000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/8\/960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,31]]},"references-count":18,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2019,8]]}},"alternative-id":["sym11080960"],"URL":"https:\/\/doi.org\/10.3390\/sym11080960","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2019,7,31]]}}}