Calendar

Hardware accelerators, such as GPUs, now provide a large part of the computational power used for scientific simulations. GPUs come with their own limited memory and are connected to the main memory of the machine via a bus with limited bandwidth. Scientific simulations often operate on very large data, to the point of not fitting in the limited GPU memory. In this case, one has to turn to out-of-core computing: data are kept in the CPU memory, and moved back and forth to the GPU memory when needed for the computation. This out-of-core situation also happens when processing on multi-core CPUs with limited memory huge datasets stored on disk. In both cases, data movement quickly becomes a performance bottleneck.

Task-based runtime schedulers have emerged as an efficient way to manage large applications. They are in charge of choosing which tasks to assign on which processing unit and in which order they should be processed. During this talk, we aim to present the problem of scheduling for a task-based runtime to improve data locality in an out-of-core setting, in order to reduce data movements.

We designed strategies for both task scheduling and data eviction from limited memories. We implemented them in the StarPU runtime and compared them to existing scheduling techniques in runtime systems. Our strategies achieves significantly better performance when scheduling tasks on multiple GPUs with limited memory, as well as on multiple CPU cores with limited main memory.

We also present work on batch scheduling of IO intensive workloads. Similarly, we used data locality techniques to reduce the average latency of a job.

In a more general approach, we would like to discuss the implications of introducing locality-aware techniques into different domains and the importance of performance visualizations.