ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors - Archive ouverte HAL Access content directly
Journal Articles Journal of Scheduling Year : 2019

ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors

(1) , (2) , (3) , (4, 5)
1
2
3
4
5

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. One of the formulations is leveraged to improve the best speedup guarantee known for a polynomial-time partitioning algorithm , from 12.9 to 7.83. Extensive computational results on synthetically generated instances are also provided to establish the effectiveness of the ILP formulations .
Fichier principal
Vignette du fichier
unrelated-jos.pdf (526.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02339161 , version 1 (30-10-2019)

Identifiers

Cite

Sanjoy K. Baruah, Vincenzo Bonifaci, Renato Bruni, Alberto Marchetti-Spaccamela. ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors. Journal of Scheduling, 2019, 22 (2), pp.195-209. ⟨10.1007/s10951-018-0593-x⟩. ⟨hal-02339161⟩

Collections

INRIA INRIA2
34 View
141 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More