Code used to simulate a hybrid computing platform (CPUs + GPUs) to test several online algorithms (that discover the task graph as it is unveiled) and to compare them to the classical HEFT offline scheduler.<br
As we know there are different algorithms based on heterogeneous environment. Earliest finish time a...
We propose and evaluate a hybrid task scheduling method in order to reduce elapse time of parallel a...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
Code used to simulate a hybrid computing platform (consisting of CPUs and GPUs) to test several onl...
International audienceModern computing platforms commonly include accelerators. We target the proble...
International audienceModern computing platforms commonly include accelerators. We target the proble...
Modern computing platforms commonly include accelerators. We target the problem of scheduling applic...
This paper presents a hybrid scheduling methodology for task graphs to multiprocessor embedded syste...
Scalability of applications is a key requirement to gaining performance in hybrid and cluster comput...
International audienceWe study the problem of executing an application represented by a precedence t...
Many of today's high level parallel languages support dynamic, fine-grained parallelism. These ...
AbstractThe emergence of applications that demand to handle efficiently growing amounts of data has ...
As we know there are different algorithms based on heterogeneous environment. Earliest finish time a...
We propose and evaluate a hybrid task scheduling method in order to reduce elapse time of parallel a...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
Code used to simulate a hybrid computing platform (consisting of CPUs and GPUs) to test several onl...
International audienceModern computing platforms commonly include accelerators. We target the proble...
International audienceModern computing platforms commonly include accelerators. We target the proble...
Modern computing platforms commonly include accelerators. We target the problem of scheduling applic...
This paper presents a hybrid scheduling methodology for task graphs to multiprocessor embedded syste...
Scalability of applications is a key requirement to gaining performance in hybrid and cluster comput...
International audienceWe study the problem of executing an application represented by a precedence t...
Many of today's high level parallel languages support dynamic, fine-grained parallelism. These ...
AbstractThe emergence of applications that demand to handle efficiently growing amounts of data has ...
As we know there are different algorithms based on heterogeneous environment. Earliest finish time a...
We propose and evaluate a hybrid task scheduling method in order to reduce elapse time of parallel a...
International audienceThis paper presents an efficient algorithm with performance guarantee (approxi...
DOI
Add to ORKG