期刊
JOURNAL OF SCHEDULING
卷 22, 期 2, 页码 195-209出版社
SPRINGER
DOI: 10.1007/s10951-018-0593-x
关键词
Task partitioning; Sporadic tasks; Unrelated machines; Speedup bound; ILP rounding
资金
- NSF [CNS 1115284, CNS 1218693, CNS 1409175, CPS 1446631]
- AFOSR [FA9550-14-1-0161]
- ARO [W911NF-14-1-0499]
- General Motors Corp.
- research project Designing Human-Agent Collectives for Sustainable Future Societies of Sapienza University of Rome [C26A15TXCF]
- MIUR PRIN Grant [2012JXB3YF_003]
- National Group of Computing Science (GNCS-INDAM)
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 trade-offs 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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据