Name
Abstract | ||
|---|---|---|
More and more computers use hybrid architectures combining multi-core processors and hardware accelerators such as graphics processing units GPUs. We present in this paper a new method for scheduling efficiently parallel applications with m CPUs and k GPUs, where each task of the application can be processed either on a core CPU or on a GPU. The objective is to minimize the maximum completion time makespan. The corresponding scheduling problem is Non-deterministic Polynomial NP-time hard, Copyright © 2014 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1002/cpe.3359 | Concurrency and Computation: Practice & Experience |
Keywords | DocType | Volume |
scheduling,approximation algorithms,parallel heterogeneous systems | Journal | 27 |
Issue | ISSN | Citations |
6 | 1532-0626 | 4 |
PageRank | References | Authors |
0.48 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raphaél Bleuse | 1 | 14 | 2.40 |
| Safia Kedad-Sidhoum | 2 | 211 | 17.92 |
| Florence Monna | 3 | 18 | 2.78 |
| Grégory Mounié | 4 | 128 | 9.68 |
| Denis Trystram | 5 | 10 | 1.29 |