Bellamy: Reusing Performance Models for Distributed Dataflow Jobs Across Contexts
Not on the map. Why?
Abstract (arXiv)
Distributed dataflow systems enable the use of clusters for scalable data analytics. However, selecting appropriate cluster resources for a processing job is often not straightforward. Performance models trained on historical executions of a concrete job are helpful in such situations, yet they are usually bound to a specific job execution context (e.g. node type, software versions, job parameters) due to the few considered input parameters. Even in case of slight context changes, such supportive models need to be retrained and cannot benefit from historical execution data from related contexts. This paper presents Bellamy, a novel modeling approach that combines scale-outs, dataset sizes, and runtimes with additional descriptive properties of a dataflow job. It is thereby able to capture the context of a job execution. Moreover, Bellamy is realizing a two-step modeling approach. First, a general model is trained on all the available data for a specific scalable analytics algorithm, hereby incorporating data from different contexts. Subsequently, the general model is optimized for the specific situation at hand, based on the available data for the concrete context. We evaluate our approach on two publicly available datasets consisting of execution data from various dataflow jobs carried out in different environments, showing that Bellamy outperforms state-of-the-art methods.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 12 of its 33 references that are in the map. First posted on arXiv 29 Jul 2021.
Builds on
12 of 33 references.
References · 12
- 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,590
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2017Self-Normalizing Neural Networkscited by 591
- 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
- 2017Low-Level Augmented Bayesian Optimization for Finding the Best Cloud VMcited by 9
- 2018Micky: A Cheaper Alternative for Selecting Cloud Instancescited by 6
- 2020Tuneful: An Online Significance-Aware Configuration Tuner for Big Data Analyticscited by 5
- 2021C3O: Collaborative Cluster Configuration Optimization for Distributed Data Processing in Public Cloudscited by 5
- 2018Scout: An Experienced Guide to Find the Best Cloud Configurationcited by 4
- 2013Parallelization in Scientific Workflow Management Systemscited by 3
- 2020Towards Collaborative Optimization of Cluster Configurations for Distributed Dataflow Jobscited by 3
- 2016OptEx: A Deadline-Aware Cost Optimization Model for Sparkcited by 1
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 1.
4 papers.
- 2021Enel: Context-Aware Dynamic Scaling of Distributed Dataflow Jobs using Graph Propagationcited by 2
- 2021On the Potential of Execution Traces for Batch Processing Workload Optimization in Public Cloudscited by 1
- 2022Perona: Robust Infrastructure Fingerprinting for Resource-Efficient Big Data Analyticscited by 1
- 2023Karasu: A Collaborative Approach to Efficient Cluster Configuration for Big Data Analyticscited by 0
- 2023Karasu: A Collaborative Approach to Efficient Cluster Configuration for Big Data Analytics22 Aug 2023
- 2022Perona: Robust Infrastructure Fingerprinting for Resource-Efficient Big Data Analytics15 Nov 2022
- 2021On the Potential of Execution Traces for Batch Processing Workload Optimization in Public Clouds16 Nov 2021
- 2021Enel: Context-Aware Dynamic Scaling of Distributed Dataflow Jobs using Graph Propagation27 Aug 2021