Bounded transmission latency in real-time edge computing: a scheduling analysis

With the recent advancements in computing power and energy efficiency, embedded system platforms have become capable of providing services that previously required compu-tational support from cloud infrastructures. Accordingly, the edge computing paradigm is becoming increasingly relevant, as it all...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings (Euromicro Conference on Digital Systems Design) s. 618 - 625
Hlavní autoři: Fara, Pietro, Serra, Gabriele, Aromolo, Federico
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 06.09.2023
Témata:
Behavioral sciences
crowdsensing
edge computing
Energy efficiency
Processor scheduling
real time analysis
real time scheduling
Real-time systems
Security
Time factors
Timing
transmission latency
ISSN:2771-2508
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:With the recent advancements in computing power and energy efficiency, embedded system platforms have become capable of providing services that previously required compu-tational support from cloud infrastructures. Accordingly, the edge computing paradigm is becoming increasingly relevant, as it allows, among other advantages, to foster security and privacy preservation by processing data at its origin. On the other hand, these systems demand predictability across the IoT-edge-cloud continuum. Regardless of the communication link, real-time tasks at the edge send data on the network, employing one or more transmission queues. For a system designer, analyzing the timing behavior of a task becomes challenging when each task has to wait for a variable amount of time before sending a packet. This paper analyzes the transmission behavior of a network of nodes regarding the latency introduced when dealing with a communication interface. The proposed analysis provides necessary conditions under which the data traffic is guaranteed not to exceed the transmission queue limit, thus avoiding unbounded waiting times on task execution, while a response time analysis technique is provided to ensure the schedulability of periodic tasks executing in each node of the network. An experimental campaign was carried out to evaluate the schedulability performance obtained with different system configurations when the proposed analysis was applied.
ISSN:2771-2508
DOI:10.1109/DSD60849.2023.00090