Multi-Core Processor Scheduling with Respect to Data Bus Bandwidth

10/30/2020
by   Anton V. Eremeev, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 12

11/29/2018

A Mixed Integer Linear Programming Model for Multi-Satellite Scheduling

We address the multi-satellite scheduling problem with limited observati...
06/22/2021

Dominance-based linear formulation for the Anchor-Robust Project Scheduling Problem

In project scheduling under processing times uncertainty, the Anchor-Rob...
01/21/2019

Mixed integer formulations using natural variables for single machine scheduling around a common due date

While almost all existing works which optimally solve just-in-time sched...
09/06/2019

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes

Resource Constrained Project Scheduling Problems (RCPSPs) without preemp...
01/25/2020

Vehicle Scheduling Problem

We define a new problem called the Vehicle Scheduling Problem (VSP). The...
09/17/2019

Network-Aware Container Scheduling in Multi-Tenant Data Center

Network management on multi-tenant container-based data centers has crit...
10/12/2012

A Flexible Mixed Integer Programming framework for Nurse Scheduling

In this paper, a nurse-scheduling model is developed using mixed integer...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.