Statically Inferring Usage Bounds for Infrastructure as Code
- URL: http://arxiv.org/abs/2402.15632v1
- Date: Fri, 23 Feb 2024 22:27:56 GMT
- Title: Statically Inferring Usage Bounds for Infrastructure as Code
- Authors: Feitong Qiao, Aryana Mohammadi, J\"urgen Cito, Mark Santolucito
- Abstract summary: Infrastructure as Code (IaC) has enabled cloud customers to have more agility in creating and modifying complex deployments of cloud-provisioned resources.
We propose a tool for fine-grained static usage analysis that works by modeling the inter-resource interactions in an IaC deployment as a set of constraints.
- Score: 0.9886108751871757
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Infrastructure as Code (IaC) has enabled cloud customers to have more agility
in creating and modifying complex deployments of cloud-provisioned resources.
By writing a configuration in IaC languages such as CloudFormation, users can
declaratively specify their infrastructure and CloudFormation will handle the
creation of the resources. However, understanding the complexity of IaC
deployments has emerged as an unsolved issue. In particular, estimating the
cost of an IaC deployment requires estimating the future usage and pricing
models of every cloud resource in the deployment. Gaining transparency into
predicted usage/costs is a leading challenge in cloud management. Existing work
either relies on historical usage metrics to predict cost or on coarse-grain
static analysis that ignores interactions between resources. Our key insight is
that the topology of an IaC deployment imposes constraints on the usage of each
resource, and we can formalize and automate the reasoning on constraints by
using an SMT solver. This allows customers to have formal guarantees on the
bounds of their cloud usage. We propose a tool for fine-grained static usage
analysis that works by modeling the inter-resource interactions in an IaC
deployment as a set of SMT constraints, and evaluate our tool on a benchmark of
over 1000 real world IaC configurations.
Related papers
- Continuous reasoning for adaptive container image distribution in the cloud-edge continuum [1.9458156037869137]
This article presents a novel declarative approach for replicating container images across the cloud-edge continuum.
Considering resource availability, network and storage costs, we leverage logic programming to determine optimal placements.
We evaluate our solution through simulations, showcasing how combining ASP and Prolog continuous reasoning can balance cost optimisation and prompt decision-making.
arXiv Detail & Related papers (2024-07-17T14:33:52Z) - Predicting Resource Consumption of Kubernetes Container Systems using
Resource Models [3.138731415322007]
This paper considers how to derive resource models for cloud systems empirically.
We do so based on models of deployed services in a formal language with explicit adherence to CPU and memory resources.
We report on leveraging data collected empirically from small deployments to simulate the execution of higher intensity scenarios on larger deployments.
arXiv Detail & Related papers (2023-05-12T17:59:01Z) - Computationally Budgeted Continual Learning: What Does Matter? [128.0827987414154]
Continual Learning (CL) aims to sequentially train models on streams of incoming data that vary in distribution by preserving previous knowledge while adapting to new data.
Current CL literature focuses on restricted access to previously seen data, while imposing no constraints on the computational budget for training.
We revisit this problem with a large-scale benchmark and analyze the performance of traditional CL approaches in a compute-constrained setting.
arXiv Detail & Related papers (2023-03-20T14:50:27Z) - SOLIS -- The MLOps journey from data acquisition to actionable insights [62.997667081978825]
In this paper we present a unified deployment pipeline and freedom-to-operate approach that supports all requirements while using basic cross-platform tensor framework and script language engines.
This approach however does not supply the needed procedures and pipelines for the actual deployment of machine learning capabilities in real production grade systems.
arXiv Detail & Related papers (2021-12-22T14:45:37Z) - Reproducible Performance Optimization of Complex Applications on the
Edge-to-Cloud Continuum [55.6313942302582]
We propose a methodology to support the optimization of real-life applications on the Edge-to-Cloud Continuum.
Our approach relies on a rigorous analysis of possible configurations in a controlled testbed environment to understand their behaviour.
Our methodology can be generalized to other applications in the Edge-to-Cloud Continuum.
arXiv Detail & Related papers (2021-08-04T07:35:14Z) - CoreDiag: Eliminating Redundancy in Constraint Sets [68.8204255655161]
We present a new algorithm which can be exploited for the determination of minimal cores (minimal non-redundant constraint sets)
The algorithm is especially useful for distributed knowledge engineering scenarios where the degree of redundancy can become high.
In order to show the applicability of our approach, we present an empirical study conducted with commercial configuration knowledge bases.
arXiv Detail & Related papers (2021-02-24T09:16:10Z) - A Predictive Autoscaler for Elastic Batch Jobs [8.354712625979776]
Large batch jobs such as Deep Learning, HPC and Spark require far more computational resources and higher cost than conventional online service.
We propose a predictive autoscaler to provide an elastic interface for the customers and overprovision instances.
arXiv Detail & Related papers (2020-10-10T17:35:55Z) - AI-based Resource Allocation: Reinforcement Learning for Adaptive
Auto-scaling in Serverless Environments [0.0]
Serverless computing has emerged as a compelling new paradigm of cloud computing models in recent years.
A common approach among both commercial and open source serverless computing platforms is workload-based auto-scaling.
In this paper we investigate the applicability of a reinforcement learning approach to request-based auto-scaling in a serverless framework.
arXiv Detail & Related papers (2020-05-29T06:18:39Z) - Budget Learning via Bracketing [50.085728094234476]
The budget learning problem poses the learner's goal as minimising use of the cloud while suffering no discernible loss in accuracy.
We propose a new formulation for the BL problem via the concept of bracketings.
We empirically validate our theory on real-world datasets, demonstrating improved performance over prior gating based methods.
arXiv Detail & Related papers (2020-04-14T04:38:14Z) - A Privacy-Preserving Distributed Architecture for
Deep-Learning-as-a-Service [68.84245063902908]
This paper introduces a novel distributed architecture for deep-learning-as-a-service.
It is able to preserve the user sensitive data while providing Cloud-based machine and deep learning services.
arXiv Detail & Related papers (2020-03-30T15:12:03Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.