A Hardware-Aware Application Execution Model in Mixed-Criticality Internet of Things

Cristina Sorina Stângaciu, Eugenia Ana Capota, Valentin Stângaciu, Mihai Victor Micea and Daniel Ioan Curiac
Additional contact information
Cristina Sorina Stângaciu: Computer and Information Technology Department, Politehnica University, Vasile Parvan 2, 300223 Timisoara, Romania
Eugenia Ana Capota: Computer and Information Technology Department, Politehnica University, Vasile Parvan 2, 300223 Timisoara, Romania
Valentin Stângaciu: Computer and Information Technology Department, Politehnica University, Vasile Parvan 2, 300223 Timisoara, Romania
Mihai Victor Micea: Computer and Information Technology Department, Politehnica University, Vasile Parvan 2, 300223 Timisoara, Romania
Daniel Ioan Curiac: Automation and Applied Information Department, Politehnica University, Vasile Parvan 2, 300223 Timisoara, Romania

Mathematics, 2022, vol. 10, issue 9, 1-21

Abstract: The Real-Time Internet of Things is an emerging technology intended to enable real-time information communication and processing over a global network of devices at the edge level. Given the lessons learned from general real-time systems, where the mixed-criticality scheduling concept has proven to be an effective approach for complex applications, this paper formalizes the paradigm of the Mixed-Criticality Internet of Things. In this context, the evolution of real-time scheduling models is presented, reviewing all the key points in their development, together with some connections between different models. Starting from the classical mixed-criticality model, a mathematical formalization of the Mixed-Criticality Internet of Things concept, together with a specifically tailored methodology for scheduling mixed-criticality applications on IoT nodes at the edge level, is presented. Therefore, a novel real-time hardware-aware task model for distributed mixed-criticality systems is proposed. This study also offers a model for setting task parameters based on an IoT node-related affinity score, evaluates the proposed mapping algorithm for task scheduling, and presents some use cases.

Keywords: distributed computing; scheduling; scheduling algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/9/1537/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/9/1537/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:9:p:1537-:d:808084

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().