Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs

@article{Beaumont2017ApproximationPO,
  title={Approximation Proofs of a Fast and Efficient List Scheduling Algorithm for Task-Based Runtime Systems on Multicores and GPUs},
  author={Olivier Beaumont and Lionel Eyraud-Dubois and Suraj Kumar},
  journal={2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
  year={2017},
  pages={768-777}
}
In High Performance Computing, heterogeneity is now the normwith specialized accelerators like GPUs providing efficientcomputational power. The added complexity has led to the developmentof task-based runtime systems, which allow complex computations to beexpressed as task graphs, and rely on scheduling algorithms to performload balancing between all resources of the platforms. Developing goodscheduling algorithms, even on a single node, and analyzing them canthus have a very high impact on the… CONTINUE READING