Internet of Things (IoT) has become omnipresent in many applications, such as healthcare, vehicles, and precision farming. They sense data from dozens of sensors scheduled periodically in a synchronous fashion on mobile CPUs that are forwarded to the cloud or other IoT devices via an essentially stochastic wireless channel. Hence, the task response time becomes stochastic, preventing optimization at compile time. On the other hand, knowing response time at compile time along with jitter, availability, and scalability is crucial to ensure a certain level of Quality of Service. This contribution presents a stochastic framework for performance analyses of multiapplications on a possible multiprocessor platform. When annotated with (stochastic) execution time, a traditional synchronous dataflow (SDF) graph can be transformed into a directed acyclic workflow graph, revealing the timing of individual actors. A generalized version of the rejection sampling Monte Carlo algorithm explores the properties of the workflow graph, to determine the distribution of the response time in a single application as well as a multiapplication multiple access scenario. Mean and jitter are the moments of the distribution. An IoT toy example with a number of distributed smart sensors was deployed in real environments to assess the performance of the proposed framework. Our analysis framework works at compile time of the code, scales with the number of things, and has low computational complexity.

Iterative Probabilistic Performance Prediction for Multiple IoT Applications in Contention

Kocian A.
;
Chessa S.
2022-01-01

Abstract

Internet of Things (IoT) has become omnipresent in many applications, such as healthcare, vehicles, and precision farming. They sense data from dozens of sensors scheduled periodically in a synchronous fashion on mobile CPUs that are forwarded to the cloud or other IoT devices via an essentially stochastic wireless channel. Hence, the task response time becomes stochastic, preventing optimization at compile time. On the other hand, knowing response time at compile time along with jitter, availability, and scalability is crucial to ensure a certain level of Quality of Service. This contribution presents a stochastic framework for performance analyses of multiapplications on a possible multiprocessor platform. When annotated with (stochastic) execution time, a traditional synchronous dataflow (SDF) graph can be transformed into a directed acyclic workflow graph, revealing the timing of individual actors. A generalized version of the rejection sampling Monte Carlo algorithm explores the properties of the workflow graph, to determine the distribution of the response time in a single application as well as a multiapplication multiple access scenario. Mean and jitter are the moments of the distribution. An IoT toy example with a number of distributed smart sensors was deployed in real environments to assess the performance of the proposed framework. Our analysis framework works at compile time of the code, scales with the number of things, and has low computational complexity.
2022
Kocian, A.; Chessa, S.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/1159792
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
social impact