Image de couverture de livre

Evaluation of Dynamic Vector Bin Packing for Virtual Machine Placement

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Zong Yu, Tang, Xueyan
Format:	Preprint
Publié:	2026
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Balls and Bins and the Infinite Process with Random Deletions
par: Berenbrink, Petra, et autres
Publié: (2025)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
par: Li, Qian, et autres
Publié: (2024)

A Hybrid Vectorized Merge Sort on ARM NEON
par: Zhou, Jincheng, et autres
Publié: (2024)

Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
par: Flin, Maxime, et autres
Publié: (2024)

Parallel Dynamic Maximal Matching
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Dynamic Maximal Matching in Clique Networks
par: Li, Minming, et autres
Publié: (2024)

Parallel Batch-Dynamic Maximal Independent Set
par: Blelloch, Guy, et autres
Publié: (2026)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Parallel and (Nearly) Work-Efficient Dynamic Programming
par: Ding, Xiangyun, et autres
Publié: (2024)

An Implementation and Experimental Comparison of Dynamic Ordered Sets
par: Malek, Jordan
Publié: (2024)

Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
par: De Man, Quinten, et autres
Publié: (2025)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
par: Cambus, Mélanie, et autres
Publié: (2022)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update
par: Blelloch, Guy E., et autres
Publié: (2025)

Parallel Batch Dynamic Vertex Coloring in $O(\log Δ)$ Amortized Update Time
par: Hutton, Chase, et autres
Publié: (2025)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
par: Blin, Lelia, et autres
Publié: (2026)

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
par: Dang'ana, Michael
Publié: (2026)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Two Efficient Message-passing Exclusive Scan Algorithms
par: Träff, Jesper Larsson
Publié: (2026)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
par: Flin, Maxime, et autres
Publié: (2026)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Efficient calculation of available space for multi-NUMA virtual machines
par: Gudkov, Andrei, et autres
Publié: (2026)

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
par: Filtser, Arnold, et autres
Publié: (2026)

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)

Exploiting Multi-Core Parallelism in Blockchain Validation and Construction
par: Karmegam, Arivarasan, et autres
Publié: (2026)

Near-optimal population protocols on bounded-degree trees
par: Rybicki, Joel, et autres
Publié: (2026)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

Round-Delayed Amnesiac Flooding
par: Alafin, Oluwatobi, et autres
Publié: (2026)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
par: Fokkink, Wan, et autres
Publié: (2026)

Fast Concurrent Primitives Despite Contention
par: Bender, Michael A., et autres
Publié: (2026)

A Simple Distributed Deterministic Planar Separator
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2026)

Beyond BFS: A Comparative Study of Rooted Spanning Tree Algorithms on GPUs
par: Sahu, Abhijeet, et autres
Publié: (2026)

Fast Spanning Tree Sampling in Broadcast Congested Clique
par: Anari, Nima, et autres
Publié: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Perfect Matching with Few Link Activations
par: Mirault, Hugo, et autres
Publié: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)