ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors

Abstract

The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different tradeoffs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented.