ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors ILP-based approaches to partitioning recurrent workloads upon heterogeneous multiprocessors
Abstract
—The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multi-processor 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.
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|
Loading...