A Graph-Partition-Based Scheduling Policy for Heterogeneous Architectures

Autor:	Wu, Hao, Lohmann, Daniel, Schröder-Preikschat, Wolfgang
Rok vydání:	2015
Předmět:	Computer Science - Distributed Parallel and Cluster Computing
Druh dokumentu:	Working Paper
Popis:	In order to improve system performance efficiently, a number of systems choose to equip multi-core and many-core processors (such as GPUs). Due to their discrete memory these heterogeneous architectures comprise a distributed system within a computer. A data-flow programming model is attractive in this setting for its ease of expressing concurrency. Programmers only need to define task dependencies without considering how to schedule them on the hardware. However, mapping the resulting task graph onto hardware efficiently remains a challenge. In this paper, we propose a graph-partition scheduling policy for mapping data-flow workloads to heterogeneous hardware. According to our experiments, our graph-partition-based scheduling achieves comparable performance to conventional queue-base approaches. Comment: Presented at DATE Friday Workshop on Heterogeneous Architectures and Design Methods for Embedded Image Systems (HIS 2015) (arXiv:1502.07241)
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1502.07451 Zobrazit plný text záznamu View this record from Arxiv