Pricing-Driven Resource Allocation in the Computing Continuum

• URL: http://arxiv.org/abs/2604.12642v1
• Date: Tue, 14 Apr 2026 12:12:14 GMT
• Title: Pricing-Driven Resource Allocation in the Computing Continuum
• Abstract summary: This paper presents a pricing-based formulation of the resource allocation problem in the computing continuum.<n>It also explores the potential of pricings as general-purpose representations of configuration spaces.
• Score: 42.28135382167815
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Deploying applications across the computing continuum requires selecting infrastructure nodes from geographically distributed and heterogeneous environments while satisfying constraints (e.g., performance, location). This decision problem is an important facet of resource allocation. As infrastructures grow in scale and heterogeneity, the resulting decision space becomes inherently combinatorial. Existing approaches typically formulate this problem as a constrained optimization task using ad-hoc representations of infrastructure topologies and demand, which hinders generalization across solutions. In contrast, Software as a Service ecosystems address a structurally similar configuration problem through pricings -structures whose plans and add-ons implicitly define the configuration space of possible subscriptions. Building on this observation, this work explores the potential of pricings as general-purpose representations of configuration spaces, positioning them as a promising alternative for addressing configuration problems, such as resource allocation, across the computing continuum. To this end, the paper presents the following contributions: i) a pricing-based formulation of the resource allocation problem in the computing continuum, enabling infrastructure configuration spaces to be represented using pricings; ii) a workflow that leverages PRIME, a pricing analysis engine, to explore these spaces and compute cost-optimal deployments satisfying functional and non-functional constraints; iii) generation processes for synthetic infrastructure topologies and workload demands; and iv) a dataset comprising 9,600 precomputed resource allocation scenarios to support benchmarking.

Related papers

• ScaleSense: Cost-Intelligent Scaling Framework via Learned Resource Estimation in Alibaba AnalyticDB [59.708423132520515]
  Cloud-native serverless data warehouses achieve fine-grained elasticity by decoupling storage from compute.<n>Yet determining the optimal resource allocation for highly heterogeneous ad-hoc queries remains a formidable industrial challenge.<n>We propose ScaleSense, a proactive, query-level resource scaling framework.
  arXiv  Detail & Related papers  (2026-08-08T06:10:35Z)
• CRAWO: Custom Resources for Adaptive Workload Orchestration [0.08910173568215411]
  This paper introduces CRAWO, an architectural framework for coordinating AI pipelines across distributed edge environments.<n>The framework incorporates a hardware-aware allocator with a pluggable multi-criteria decision layer that enables adaptive workload placement.
  arXiv  Detail & Related papers  (2026-06-08T15:45:03Z)
• Real-Time AI Service Economy: A Framework for Agentic Computing Across the Continuum [10.35088918434398]
  This article shows that the structure of service-dependency graphs, modelled as DAGs, is a primary determinant of whether decentralised, price-based resource allocation can work reliably at scale.<n>We propose a hybrid management architecture in which cross-domain sub-graphs into resource slices that present a simpler, well-structured interface to the rest of the market.
  arXiv  Detail & Related papers  (2026-03-05T19:14:54Z)
• Adaptive GPU Resource Allocation for Multi-Agent Collaborative Reasoning in Serverless Environments [0.3668877906130206]
  Multi-agent systems powered by large language models have emerged as a promising paradigm for solving complex reasoning tasks.<n> efficiently deploying these systems on serverless GPU platforms presents significant resource allocation challenges.<n>This paper presents an adaptive GPU resource allocation framework that achieves 85% latency reduction compared to round-robin scheduling.
  arXiv  Detail & Related papers  (2025-12-15T09:21:48Z)
• Joint Partitioning and Placement of Foundation Models for Real-Time Edge AI [43.38839324900098]
  We introduce a framework in which both the spatial placement and internal segmentation of foundation models are elevated to runtime-resolved constructs.<n>We introduce architectural and algorithmic components, along with a representative use case in 6G multi-access edge computing.
  arXiv  Detail & Related papers  (2025-11-30T19:16:30Z)
• Dynamic Function Configuration and its Management in Serverless Computing: A Taxonomy and Future Directions [14.448267395835721]
  The serverless cloud computing model offers a framework where the service provider abstracts the underlying infrastructure management from developers.<n>In this serverless model, F provides an event-driven, function-oriented computing service characterised by fine-grained, usage-based pricing that eliminates cost for idle resources.
  arXiv  Detail & Related papers  (2025-10-02T03:09:54Z)
• Computing entanglement costs of non-local operations on the basis of algebraic geometry [0.0]
  We develop a framework to systematically simplify the optimization over separable (SEP) channels.<n>We apply this framework to computing one-shot entanglement cost for implementing non-local operations under SEP channels.
  arXiv  Detail & Related papers  (2025-01-29T03:16:30Z)
• Conjunctive Query Based Constraint Solving For Feature Model Configuration [79.14348940034351]
  We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
  arXiv  Detail & Related papers  (2023-04-26T10:08:07Z)
• Multi-Resource Allocation for On-Device Distributed Federated Learning Systems [79.02994855744848]
  This work poses a distributed multi-resource allocation scheme for minimizing the weighted sum of latency and energy consumption in the on-device distributed federated learning (FL) system. Each mobile device in the system engages the model training process within the specified area and allocates its computation and communication resources for deriving and uploading parameters, respectively.
  arXiv  Detail & Related papers  (2022-11-01T14:16:05Z)
• Decision-making Oriented Clustering: Application to Pricing and Power Consumption Scheduling [61.062312682535755]
  We formulate the framework of decision-making oriented clustering and propose an algorithm providing a decision-based partition of the data space and good representative decisions. By applying this novel framework and algorithm to a typical problem of real-time pricing and that of power consumption scheduling, we obtain several insightful analytical results.
  arXiv  Detail & Related papers  (2021-06-02T08:41:04Z)
• Clustered Federated Learning via Generalized Total Variation Minimization [83.26141667853057]
  We study optimization methods to train local (or personalized) models for local datasets with a decentralized network structure. Our main conceptual contribution is to formulate federated learning as total variation minimization (GTV) Our main algorithmic contribution is a fully decentralized federated learning algorithm.
  arXiv  Detail & Related papers  (2021-05-26T18:07:19Z)
• 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)

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.