Dynamic Allocation of Processor Cores to Graph Applications on Commodity Servers

Graph processing is increasingly adopted to solve problems that span many application domains, including scientific computing, social networks, and big-data analytics. These applications present particular features (huge working sets and irregular scalability) that make the default Linux scheduler,...

Full description

Saved in:
Bibliographic Details
Published in:2023 32nd International Conference on Parallel Architectures and Compilation Techniques (PACT) pp. 323 - 324
Main Authors: Pons, Lucia, Sahuauillo, Julio, Jones, Timothy M.
Format: Conference Proceeding
Language:English
Published: IEEE 21.10.2023
Subjects:
fair scheduling
graph processing
Instruction sets
Linux
Multicore processing
multicore processor
Processor scheduling
resource management
runtime optimization
Scalability
Scientific computing
Social networking (online)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph processing is increasingly adopted to solve problems that span many application domains, including scientific computing, social networks, and big-data analytics. These applications present particular features (huge working sets and irregular scalability) that make the default Linux scheduler, which adopts a time-sharing policy to provide a fair scheduler, perform poorly when co-locating multiple graph applications in the same processor. This work focuses on maximizing processor utilization, which is a major concern of current data centers. To this end, we propose AFAIR, a flexible scheduling policy that allocates multiple graph applications on the same processor and assigns a fraction of the cores exclusively to each application instead of sharing them. Moreover, AFAIR dynamically adds/removes cores to the running applications, adapting the number of threads used for parallel execution to balance memory load. This allows AFAIR to achieve almost perfect fairness, on average 95%.
DOI:10.1109/PACT58117.2023.00035