Paper Info
Title
Odyn: Deadlock Prevention and Hybrid Scheduling Algorithm for Real-Time Dataflow Applications
Abstract
In recent wireless communication standards (4G, 5G), the growing need for dynamic adjustments of transmission parameters (e.g., modulation, bandwidth, channel coding rate) makes traditional static scheduling approaches less and less efficient. The reason being that precomputed fixed mapping and scheduling prevent the system from dynamically adapting to changes of the operating conditions (e.g. wireless channel quality, available bandwidth). In this paper, we present Odyn, a hybrid approach for the scheduling and memory management of periodic dataflow applications on parallel, heterogeneous, Non-Uniform Memory Architecture (NUMA) platforms. In Odyn, the ordering of tasks and memory allocation are distributed and computed simultaneously at run-time for each Processing Element. Odyn also proposes a mechanism to prevent deadlocks caused by attempts to allocate buffers in size-limited memories. This technique, based on the static computation of exclusion relations among buffers in a target application, removes the need for backtracking that is typical of dynamic scheduling algorithms. We demonstrate the effectiveness of Odyn on a testbench that simulates the interactions of randomly generated concurrent applications. We also demonstrate its deadlock prevention technique on a selection of use cases.
Year
DOI
Venue
2019
10.1109/DSD.2019.00023
2019 22nd Euromicro Conference on Digital System Design (DSD)
Keywords
Field
DocType
Dynamic scheduling,Embedded systems,Deadlock prevention
Scheduling (computing),Computer science,Deadlock,Algorithm,Memory management,Dataflow,Deadlock prevention algorithms,Dynamic priority scheduling,Hybrid Scheduling,Memory architecture
Conference
ISBN
Citations 
PageRank 
978-1-7281-2863-4
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Benjamin Dauphin100.34
Renaud Pacalet226024.51
Andrea Enrici300.34
Ludovic Apvrille413622.23