Efficient resource allocation for concurrent graph workloads

One or more non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform functions comprising:

• receiving a request to execute a graph processing workload on a dataset, wherein the dataset is modeled as a graph;
• identifying a plurality of graph operators that constitute the graph processing workload;
• determining that execution of each graph operator of the plurality of graph operators is either processor intensive or memory intensive;
• assigning a task weight to each graph operator of the plurality of graph operators based on the determining;
• performing, based on the task weights assigned to the plurality of graph operators, a first allocation of computing resources to execute the plurality of graph operators;
• causing, according to the first allocation, execution of the plurality of graph operators by the computing resources;
• monitoring computing resource usage of the plurality of graph operators executed by the computing resources according to the first allocation;
• performing, responsive to monitoring the computing resource usage, a second allocation of computing resources to execute the plurality of graph operators, wherein the second allocation is different than the first allocation;
• and
• causing, according to the second allocation instead of according to the first allocation, execution of the plurality of graph operators by the computing resources.