Adam Barker
Research Subjects
Adam Barker has a total of 102 co-authors. Here are the top co-authors by number of shared publications:
Long Thai
21 shared publicationsBlesson Varghese
17 shared publications- Blesson Varghese
School of Computer Science University of St Andrews Fife UK
9 shared publications - Paolo Pareti
University of Southampton
7 shared publications - Blesson Varghese
University of St Andrews
6 shared publications Jonathan Stuart Ward
School of Computer Science, University of St Andrews, St Andrews, UK
6 shared publications
Latest Publications
- Open Access
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 938-953
Serverless Cold Starts and Where to Find Them
- 30 March 2025
- Published by Association for Computing Machinery (ACM)
- p. 938-953
Open AccessServerless Cold Starts and Where to Find Them
- Top Cited PapersOpen Access
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 443-458
How Does It Function? Characterizing Long-term Trends in Production Serverless Workloads
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 443-458
Top Cited PapersOpen AccessHow Does It Function? Characterizing Long-term Trends in Production Serverless Workloads
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 113-120
Learning to Score: Tuning Cluster Schedulers through Reinforcement Learning
Efficiently allocating incoming jobs to nodes in large-scale clusters can lead to substantial improvements in both cluster utilization and job performance. In order to allocate incoming jobs, cluster schedulers usually rely on a set of scoring functions to rank feasible nodes. Results from individual scoring functions are usually weighted equally, which could lead to suboptimal deployments as the one-size-fits-all solution does not take into account the characteristics of each workload. Tuning the weights of scoring functions, however, requires expert knowledge and is computationally expensive.This paper proposes a reinforcement learning approach for learning the weights in scheduler scoring algorithms with the overall objective of improving the end-to-end performance of jobs for a given cluster. Our approach is based on percentage improvement reward, frame-stacking, and limiting domain information. We propose a percentage improvement reward to address the objective of multi-step parameter tuning. The inclusion of frame-stacking allows for carrying information across an optimization experiment. Limiting domain information prevents overfitting and improves performance in unseen clusters and workloads. The policy is trained on different combinations of workloads and cluster setups. We demonstrate the proposed approach improves performance on average by 33% compared to fixed weights and 12% compared to the best-performing baseline in a lab-based serverless scenario.
- 25 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 113-120
Learning to Score: Tuning Cluster Schedulers through Reinforcement Learning
Efficiently allocating incoming jobs to nodes in large-scale clusters can lead to substantial improvements in both cluster utilization and job performance. In order to allocate incoming jobs, cluster schedulers usually rely on a set of scoring functions to rank feasible nodes. Results from individual scoring functions are usually weighted equally, which could lead to suboptimal deployments as the one-size-fits-all solution does not take into account the characteristics of each workload. Tuning the weights of scoring functions, however, requires expert knowledge and is computationally expensive.This paper proposes a reinforcement learning approach for learning the weights in scheduler scoring algorithms with the overall objective of improving the end-to-end performance of jobs for a given cluster. Our approach is based on percentage improvement reward, frame-stacking, and limiting domain information. We propose a percentage improvement reward to address the objective of multi-step parameter tuning. The inclusion of frame-stacking allows for carrying information across an optimization experiment. Limiting domain information prevents overfitting and improves performance in unseen clusters and workloads. The policy is trained on different combinations of workloads and cluster setups. We demonstrate the proposed approach improves performance on average by 33% compared to fixed weights and 12% compared to the best-performing baseline in a lab-based serverless scenario.
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 109-114
TSMix: time series data augmentation by mixing sources
Data augmentation for time series is challenging because of the complex multi-scale relationships spanning ordered continuous sequences: one cannot easily alter a single datum and expect these relationships to be preserved. Time series datum are not independent and identically distributed random variables. However, modern Function as a Service (FaaS) infrastructure yields a unique opportunity for data augmentation because of the multiple distinct functions within a single data source. Further, common strong periodicity afforded by the human diurnal cycle and its link to these data sources enables mixing distinct functions to form pseudo-functions for improved model training. Herein we propose time series mix (TSMix), where pseudo univariate time series are created by mixing combinations of real univariate time series. We show that TSMix improves the performance on held-out test data for two state-of-the-art forecast models (N-BEATS and N-HiTS) and linear regression.
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 109-114
Open AccessTSMix: time series data augmentation by mixing sources
Data augmentation for time series is challenging because of the complex multi-scale relationships spanning ordered continuous sequences: one cannot easily alter a single datum and expect these relationships to be preserved. Time series datum are not independent and identically distributed random variables. However, modern Function as a Service (FaaS) infrastructure yields a unique opportunity for data augmentation because of the multiple distinct functions within a single data source. Further, common strong periodicity afforded by the human diurnal cycle and its link to these data sources enables mixing distinct functions to form pseudo-functions for improved model training. Herein we propose time series mix (TSMix), where pseudo univariate time series are created by mixing combinations of real univariate time series. We show that TSMix improves the performance on held-out test data for two state-of-the-art forecast models (N-BEATS and N-HiTS) and linear regression.
- Open Access
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 71-77
FoldFormer: sequence folding and seasonal attention for fine-grained long-term FaaS forecasting
Fine-grained long-term (FGLT) time series forecasting is a fundamental challenge in Function as a Service (FaaS) platforms. The data that FaaS function requests produce are fine-grained (per-second/minute), often have daily periodicity, and are persistent over the long term. Forecasting in the FGLT data regime is challenging, and Transformer models can scale poorly for long sequences. We propose FoldFormer that combines several novel elements - time-to-latent folding, seasonal attention, and convolutions over FFT representations - as a new solution for FGLT forecasting of FaaS function requests. FoldFormer is designed to efficiently consume very fine-grained multi-day data with nearly no additional model, memory, or compute overhead, when compared to consuming coarse-grained data. We show either state-of-the-art or competitive performance for per-minute function requests on the top 5 most requested functions for three data sources, including two in-house Huawei Cloud sources and Azure 2019. We also show state-of-the-art performance at per-second granularity --- a regime that critically limits most other methods.
- 8 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 71-77
Open AccessFoldFormer: sequence folding and seasonal attention for fine-grained long-term FaaS forecasting
Fine-grained long-term (FGLT) time series forecasting is a fundamental challenge in Function as a Service (FaaS) platforms. The data that FaaS function requests produce are fine-grained (per-second/minute), often have daily periodicity, and are persistent over the long term. Forecasting in the FGLT data regime is challenging, and Transformer models can scale poorly for long sequences. We propose FoldFormer that combines several novel elements - time-to-latent folding, seasonal attention, and convolutions over FFT representations - as a new solution for FGLT forecasting of FaaS function requests. FoldFormer is designed to efficiently consume very fine-grained multi-day data with nearly no additional model, memory, or compute overhead, when compared to consuming coarse-grained data. We show either state-of-the-art or competitive performance for per-minute function requests on the top 5 most requested functions for three data sources, including two in-house Huawei Cloud sources and Azure 2019. We also show state-of-the-art performance at per-second granularity --- a regime that critically limits most other methods.
- Open Access
- 6 December 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Adaptive brokerage framework for the cloud with functional testing
In this paper, we present an Adaptive Brokerage for the Cloud (ABC) that can be used to simplify application deployment, monitoring and management processes in the cloud. The broker uses modern cloud infrastructure automation tools to test, deploy, monitor and optimise cloud resources. We used an e-commerce application to evaluate the entire functionality of the broker, we found out that different deployment options such as single-tier vs two-tier lead to interesting hardware and application performance insights. These insights are used to make effective infrastructure optimisation decisions.
- 6 December 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessAdaptive brokerage framework for the cloud with functional testing
In this paper, we present an Adaptive Brokerage for the Cloud (ABC) that can be used to simplify application deployment, monitoring and management processes in the cloud. The broker uses modern cloud infrastructure automation tools to test, deploy, monitor and optimise cloud resources. We used an e-commerce application to evaluate the entire functionality of the broker, we found out that different deployment options such as single-tier vs two-tier lead to interesting hardware and application performance insights. These insights are used to make effective infrastructure optimisation decisions.
- Open Access
Benchmarking and Performance Modelling of MapReduce Communication Pattern
Understanding and predicting the performance of big data applications running in the cloud or on-premises could help minimise the overall cost of operations and provide opportunities in efforts to identify performance bottlenecks. The complexity of the low-level internals of big data frameworks and the ubiquity of application and workload configuration parameters makes it challenging and expensive to come up with comprehensive performance modelling solutions. In this paper, instead of focusing on a wide range of configurable parameters, we studied the low-level internals of the MapReduce communication pattern and used a minimal set of performance drivers to develop a set of phase level parametric models for approximating the execution time of a given application on a given cluster. Models can be used to infer the performance of unseen applications and approximate their performance when an arbitrary dataset is used as input. Our approach is validated by running empirical experiments in two setups. On average the error rate in both setups is plus or minus 10% from the measured values.
Open AccessBenchmarking and Performance Modelling of MapReduce Communication Pattern
Understanding and predicting the performance of big data applications running in the cloud or on-premises could help minimise the overall cost of operations and provide opportunities in efforts to identify performance bottlenecks. The complexity of the low-level internals of big data frameworks and the ubiquity of application and workload configuration parameters makes it challenging and expensive to come up with comprehensive performance modelling solutions. In this paper, instead of focusing on a wide range of configurable parameters, we studied the low-level internals of the MapReduce communication pattern and used a minimal set of performance drivers to develop a set of phase level parametric models for approximating the execution time of a given application on a given cluster. Models can be used to infer the performance of unseen applications and approximate their performance when an arbitrary dataset is used as input. Our approach is validated by running empirical experiments in two setups. On average the error rate in both setups is plus or minus 10% from the measured values.
- Open Access
- 23 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 52 (9) , 68-77
Cloud Futurology
The cloud has become integral to most Internet-based applications and user gadgets. This article provides a brief history of the cloud and presents a researcher's view of the prospects for innovating at the infrastructure, middleware, and applications and delivery levels of the already crowded cloud computing stack.
- 23 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 52 (9) , 68-77
Open AccessCloud Futurology
The cloud has become integral to most Internet-based applications and user gadgets. This article provides a brief history of the cloud and presents a researcher's view of the prospects for innovating at the infrastructure, middleware, and applications and delivery levels of the already crowded cloud computing stack.
- Open Access
Plug and Play Bench: Simplifying Big Data Benchmarking Using Containers
The recent boom of big data, coupled with the challenges of its processing and storage gave rise to the development of distributed data processing and storage paradigms like MapReduce, Spark, and NoSQL databases. With the advent of cloud computing, processing and storing such massive datasets on clusters of machines is now feasible with ease. However, there are limited tools and approaches, which users can rely on to gauge and comprehend the performance of their big data applications deployed locally on clusters, or in the cloud. Researchers have started exploring this area by providing benchmarking suites suitable for big data applications. However, many of these tools are fragmented, complex to deploy and manage, and do not provide transparency with respect to the monetary cost of benchmarking an application. In this paper, we present Plug And Play Bench, an infrastructure aware abstraction built to integrate and simplify the deployment of big data benchmarking tools on clusters of machines. PAPB automates the tedious process of installing, configuring and executing common big data benchmark workloads by containerising the tools and settings based on the underlying cluster deployment framework. Our proof of concept implementation utilises HiBench as the benchmark suite, HDP as the cluster deployment framework and Azure as the cloud platform. The paper further illustrates the inclusion of cost metrics based on the underlying Microsoft Azure cloud platform.
Open AccessPlug and Play Bench: Simplifying Big Data Benchmarking Using Containers
The recent boom of big data, coupled with the challenges of its processing and storage gave rise to the development of distributed data processing and storage paradigms like MapReduce, Spark, and NoSQL databases. With the advent of cloud computing, processing and storing such massive datasets on clusters of machines is now feasible with ease. However, there are limited tools and approaches, which users can rely on to gauge and comprehend the performance of their big data applications deployed locally on clusters, or in the cloud. Researchers have started exploring this area by providing benchmarking suites suitable for big data applications. However, many of these tools are fragmented, complex to deploy and manage, and do not provide transparency with respect to the monetary cost of benchmarking an application. In this paper, we present Plug And Play Bench, an infrastructure aware abstraction built to integrate and simplify the deployment of big data benchmarking tools on clusters of machines. PAPB automates the tedious process of installing, configuring and executing common big data benchmark workloads by containerising the tools and settings based on the underlying cluster deployment framework. Our proof of concept implementation utilises HiBench as the benchmark suite, HDP as the cluster deployment framework and Azure as the cloud platform. The paper further illustrates the inclusion of cost metrics based on the underlying Microsoft Azure cloud platform.
- Open Access
A Survey and Taxonomy of Resource Optimisation for Executing Bag-of-Task Applications on Public Clouds
Cloud computing has been widely adopted due to the flexibility in resource provisioning and on-demand pricing models. Entire clusters of Virtual Machines (VMs) can be dynamically provisioned to meet the computational demands of users. However, from a user's perspective, it is still challenging to utilise cloud resources efficiently. This is because an overwhelmingly wide variety of resource types with different prices and significant performance variations are available. This paper presents a survey and taxonomy of existing research in optimising the execution of Bag-of-Task applications on cloud resources. A BoT application consists of multiple independent tasks, each of which can be executed by a VM in any order; these applications are widely used by both the scientific communities and commercial organisations. The objectives of this survey are as follows: (i) to provide the reader with a concise understanding of existing research on optimising the execution of BoT applications on the cloud, (ii) to define a taxonomy that categorises current frameworks to compare and contrast them, and (iii) to present current trends and future research directions in the area.
Open AccessA Survey and Taxonomy of Resource Optimisation for Executing Bag-of-Task Applications on Public Clouds
Cloud computing has been widely adopted due to the flexibility in resource provisioning and on-demand pricing models. Entire clusters of Virtual Machines (VMs) can be dynamically provisioned to meet the computational demands of users. However, from a user's perspective, it is still challenging to utilise cloud resources efficiently. This is because an overwhelmingly wide variety of resource types with different prices and significant performance variations are available. This paper presents a survey and taxonomy of existing research in optimising the execution of Bag-of-Task applications on cloud resources. A BoT application consists of multiple independent tasks, each of which can be executed by a VM in any order; these applications are widely used by both the scientific communities and commercial organisations. The objectives of this survey are as follows: (i) to provide the reader with a concise understanding of existing research on optimising the execution of BoT applications on the cloud, (ii) to define a taxonomy that categorises current frameworks to compare and contrast them, and (iii) to present current trends and future research directions in the area.