Scheduling streaming applications on a complex multicore platform

Scheduling streaming applications on a complex multicore platform
复制标题

在复杂的多核平台上调度流应用程序

DOI:
--
复制
发表时间:
2012
期刊:
Concurrency and Computation
影响因子:
--
通讯作者:
L. Marchal
L. Marchal
中科院分区:
--
文献类型:
--
作者:
Tudor David;Mathias Jacquelin;L. Marchal

文献摘要

被引文献

相似文献

在本文中,我们考虑了在异构多核平台IBM QS 22平台上,嵌入两个STI Cell宽带引擎处理器的复杂任务图描述的流应用程序调度问题。我们首先在综合基准测试的基础上推导出一个完整的平台计算和通信模型。然后我们用这个模型来表达在这个平台上的流媒体应用的吞吐量最大化问题。虽然这个问题已经被证明是NP完全的,但我们提出了一个基于混合线性规划的最优解。我们还提出了更简单的调度启发式算法来计算应用程序任务图在平台上的映射。然后我们回到这个平台,提出了一个调度软件来部署这个平台上的流应用程序。这使我们能够在真实平台上彻底测试我们的调度策略。因此,我们表明,无论是使用混合线性规划方案还是使用相关的调度启发式,我们都能够实现良好的加速。版权所有©2011 John Wiley & Sons, Ltd
In this paper, we consider the problem of scheduling streaming applications described by complex task graphs on a heterogeneous multicore platform, the IBM QS 22 platform, embedding two STI Cell Broadband Engine processor. We first derive a complete computation and communication model of the platform on the basis of comprehensive benchmarks. Then we use this model to express the problem of maximizing the throughput of a streaming application on this platform. Although the problem is proven NP‐complete, we present an optimal solution based on mixed linear programming. We also propose simpler scheduling heuristics to compute mapping of the application task graph on the platform. We then come back to the platform and propose a scheduling software to deploy streaming applications on this platform. This allows us to thoroughly test our scheduling strategies on the real platform. We thus show that we are able to achieve a good speed‐up either with the mixed linear programming solution or using involved scheduling heuristics. Copyright © 2011 John Wiley & Sons, Ltd.