SearcharxivSearch

arXiv · 2408.01176

Power Aware Container Placement in Cloud Computing with Affinity and Cubic Power Model

Abstract

Modern data centres are increasingly adopting containers to enhance power and performance efficiency. These data centres consist of multiple heterogeneous machines, each equipped with varying amounts of resources such as CPU, I/O, memory, and network bandwidth. Data centers rent their resources to applications, which demand different amounts of resources and execute on machines for extended durations if the machines provide the demanded resources to the applications. Certain applications run efficiently on specific machines, referred to as system affinity between applications and machines. In contrast, others are incompatible with specific machines, referred to as anti-affinity between applications and machines. We consider that there are multiple applications, and data centers need to execute as many applications as possible. Data centers incur electricity based on CPU usage due to the execution of applications, with the cost being proportional to the cube of the total CPU usage. It is a challenging problem to place applications on the machines they have an affinity for while keeping the electricity cost in check. Our work addresses the placement problem of matching applications to machines to minimize overall electricity costs while maximizing the number of affinity pairs of machines and applications. We propose three solution approaches: (a) Power-Aware Placement (PAP): applications are placed on machines where power usage is minimized, (b) Affinity-Aware Placement (AAP): applications are placed on machines where affinity is maximized, (c) Combined Power-Affinity Placement (CPAAP): this approach integrates the benefits of both PAP and AAP. Our proposed approach improves the affinity satisfaction ratio by up to 4% while reducing the total system cost by up to 26% and improving the affinity payoff ratio by up to 37% compared to state-of-the-art approaches for real-life datasets.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Suvarthi Sarkar, Nandini Sharma, Akshat Mittal, Aryabartta Sahu. 2024-08-02. Power Aware Container Placement in Cloud Computing with Affinity and Cubic Power Model. https://doi.org/10.1007/s00607-025-01566-0

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Online Treasure Hunt in Vertex-Permuted Dynamic Rings

We study the problem of treasure hunt by a group of $k \geq 1$ agents in vertex-permuted dynamic rings (VP). In this model, the $n$ vertices remain on a ring but are permuted at each time step. We first show that treasure hunt is impossible for any $k \leq n-3$ agents, if there are no restrictions on the sequence of permutations used in the dynamic ring. We then study the $VP(\delta)$ setting, in which for every pair $i, j$ of vertices, the edge $(i, j)$ is guaranteed to appear within $\delta$ steps. We show that the class $VP(\delta)$ is feasible only for $\delta \geq \left\lceil \frac{n-1}{2}\right\rceil$. For the one-agent case, we show a tight bound of $\Theta(\delta n)$ on the worst-case search time as well as competitive ratio of any online algorithm for treasure hunt, provided $\delta \geq 2n$. We then give an optimal algorithm for $k$ agents, thereby showing that $k$ agents can obtain a speedup of $k$ on the worst-case search time. Finally, in the R-VP setting, in which in every step, the vertices are arranged as a ring according to a random permutation, we show that treasure hunt takes expected $\Theta(n)$ steps against an oblivious adversary and $\Theta(n \log n)$ steps against an adaptive adversary.

cs.DC

The Computing Channel: How Modulation Programs the Airwaves

Distributed computing and distributed artificial intelligence require frequent exchanges of intermediate results, although many applications need only an aggregate rather than messages from individual devices. Conventional systems recover each message before computing the aggregate, whereas over-the-air computation (OAC) exploits simultaneous transmission to obtain it directly. However, dominant OAC implementations rely on analog signaling, creating a mismatch with finite-precision data and digital communication procedures. This article presents digital function-oriented communication, in which finite-alphabet symbol representations and receiver decisions are jointly designed so that multiple-access superposition encodes the desired function without recovering individual inputs. We introduce its computational-constellation principle, main design approaches, extensions, and implementation challenges. Federated edge learning illustrates how the framework can reduce user-dependent data-bearing resources while operating directly on quantized model updates.

cs.DC

Can AI Remediate Backend Failures Safely? GuardedAct with Blast-Radius-Aware Sandboxing

Large Language Models (LLMs) have shown promising capabilities in generating remediation actions for microservice failures. However, directly executing AI-generated repair actions in production risks cascading collateral damage. We propose GuardedAct, a sandbox-first remediation framework that interposes a blast-radius-aware verification layer between the LLM action generator and the production environment. GuardedAct operates in four phases: (1) ingesting a diagnosis report together with the live system topology and recent telemetry, (2) prompting an LLM to produce a ranked list of candidate remediation actions, (3) simulating each action in a lightweight digital-twin sandbox that estimates the blast radius and assigns a risk label, and (4) enforcing a rollback-confidence gate that auto-executes only low-risk actions while escalating high-risk ones for human review. We evaluate GuardedAct on five fault scenarios injected into the DeathStarBench social-network application. Experimental results show that GuardedAct achieves an overall recovery rate of 87.4% while reducing collateral damage by 79.7% relative to direct LLM execution (from 25.6% to 5.2%), at the cost of a modest sandbox-induced increase in mean time to recovery (approximately 8 s). Ablation studies confirm that each component contributes meaningfully to the safety-speed trade-off.

cs.DC