Adaptive Scheduling of Collocated Applications Using a Task-Based Runtime System
Resumo
Task-based runtime systems are considered as one of the options for dealing with the challenges of upcoming parallel architectures. The greater flexibility of these runtime systems can also be used to dynamically adjust the resources allocated to the applications, adapting to the current load of the system and the progress of the applications. In our work, we have extended our implementation of the Open Community Runtime to support dynamic adjustment of execution threads. The runtimes communicate with an agent process, which collects performance data, computes thread allocation, and instructs the runtimes to make the required adjustments. We have tested our solution under different scenarios, focusing on producer-consumer applications, where the dynamic resource management was used to keep the applications in sync, improving the overall performance in some cases.
Palavras-chave:
Task analysis, Runtime, Instruction sets, Resource management, Optical character recognition software, Parallel processing, Operating systems, task-based parallelism, runtime systems, concurrent workloads, adaptive scheduling
Publicado
24/09/2018
Como Citar
DOKULIL, Jiri; BENKNER, Siegfried.
Adaptive Scheduling of Collocated Applications Using a Task-Based Runtime System. In: INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD), 30. , 2018, Lyon/FR.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2018
.
p. 41-48.
