Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth
Distributed, Parallel, and Cluster Computing
2020-11-02 v1 Optimization and Control
Abstract
The paper considers the problem of scheduling software modules on a multi-core processor, taking into account the limited bandwidth of the data bus and the precedence constraints. Two problem formulations with different levels of problem-specific detail are suggested and both shown to be NP-hard. A mixed integer linear programming (MILP) model is proposed for the first problem formulation, and a greedy algorithm is developed for the second one. An experimental comparison of the results of the greedy algorithm and the MILP solutions found by CPLEX solver is carried out.
Cite
@article{arxiv.2010.16058,
title = {Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth},
author = {Anton V. Eremeev and Anton A. Malakhov and Maxim A. Sakhno and Maria Y. Sosnovskaya},
journal= {arXiv preprint arXiv:2010.16058},
year = {2020}
}
Comments
Accepted for the second volume of OPTIMA'2020 proceedings