Published 2024
“…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-
tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing
parallelism, assigning an optimal discrete
frequency for each task and each message using a Non-Linear Programming (NLP)-based
algorithm and an Integer-Linear Programming (ILP)-based
algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
Get full text
Get full text
Get full text
Article