Cover Image

Efficient calculation of available space for multi-NUMA virtual machines

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gudkov, Andrei, Ponomareva, Elizaveta, Pospelov, Alexis
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
by: Meir, Shachar, et al.
Published: (2025)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)

Parallel and (Nearly) Work-Efficient Dynamic Programming
by: Ding, Xiangyun, et al.
Published: (2024)

Two Efficient Message-passing Exclusive Scan Algorithms
by: Träff, Jesper Larsson
Published: (2026)

BLEST: Blazingly Efficient BFS using Tensor Cores
by: Elbek, Deniz, et al.
Published: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
by: Banasik, Dominick, et al.
Published: (2025)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
by: Wang, Letong, et al.
Published: (2023)

Efficient Distributed Data Structures for Future Many-core Architectures
by: Fatourou, Panagiota, et al.
Published: (2024)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
by: Chang, Yi-Jun, et al.
Published: (2026)

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
by: Chang, Yi-Jun
Published: (2023)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
by: Shovan, S. M., et al.
Published: (2025)

MTASet: A Tree-based Set for Efficient Range Queries in Update-heavy Workloads
by: Manor, Daniel, et al.
Published: (2025)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)

Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
by: Flin, Maxime, et al.
Published: (2026)

Distributed Stochastic Graph Algorithms
by: Censor-Hillel, Keren, et al.
Published: (2026)

Parallel Batch-Dynamic Maximal Independent Set
by: Blelloch, Guy, et al.
Published: (2026)

Fast Deterministic Distributed Degree Splitting
by: Maus, Yannic, et al.
Published: (2026)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
by: Filtser, Arnold, et al.
Published: (2026)

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
by: Karmegam, Arivarasan, et al.
Published: (2026)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
by: Blelloch, Guy, et al.
Published: (2026)

Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement
by: Lee, Zong Yu, et al.
Published: (2026)

Near-optimal population protocols on bounded-degree trees
by: Rybicki, Joel, et al.
Published: (2026)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
by: Garg, Vijay K., et al.
Published: (2026)

Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
by: Fokkink, Wan, et al.
Published: (2026)

Fast Concurrent Primitives Despite Contention
by: Bender, Michael A., et al.
Published: (2026)

A Simple Distributed Deterministic Planar Separator
by: Abd-Elhaleem, Yaseen, et al.
Published: (2026)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
by: Sahu, Abhijeet, et al.
Published: (2026)

Fast Spanning Tree Sampling in Broadcast Congested Clique
by: Anari, Nima, et al.
Published: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)

Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)