A large-scale online discrete optimization model is formulates and a new online sampling optimization (OSO) algorithm is developed that anticipates future demand by repeatedly simulating future arrivals and reoptimizing decisions over time, demonstrating the real-world impact of optimization in cloud infrastructure management.
Abstract
Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
Data centers have grown into major components of global supply chains. This paper develops, deploys, and assesses an optimization algorithm to improve how large-scale data centers place incoming server racks dynamically while balancing space, power, cooling, and reliability constraints. Poor placement decisions can leave valuable resources stranded, leading to high costs and reduced operating resilience. This paper formulates a large-scale online discrete optimization model and develops a new online sampling optimization (OSO) algorithm that anticipates future demand by repeatedly simulating future arrivals and reoptimizing decisions over time. Theoretical results provide performance guarantees, and computational results show its benefits against state-of-the-art reoptimization methods. The system was implemented as a decision-support tool and deployed across Microsoft’s global fleet of data centers. Using postdeployment data, the paper shows that adoption of the tool reduced power stranding by one to three percentage points. At Microsoft’s scale, these improvements translate into substantial financial savings and meaningful reductions in greenhouse gas emissions, demonstrating the real-world impact of optimization in cloud infrastructure management.
This paper proposes GRM-SFCOD, which is a General Reliability-aware Multi-replica SFC Online Deployment algorithm that introduces a primary-backup replica pool that parallelizes VNFs into lightweight instances while provisioning redundant backups for fault tolerance.
Haitong Gu, Bin Guo, Jun Dong et al.· Electronics· 0 citations
Efficient transient scheduling of cluster tools is critical to stable fab-level operations in high-mix, low-volume semiconductor manufacturing. This study investigates the transient scheduling problem of dual-armed cluster tools (DACTs) processing two wafer types concurrently. From an engineering-management perspective...
Zhen-Yan Wu, Fa-Jun Yang, Chao Li et al.· IEEE transactions on enginee...· 0 citations
JointCloud environments, including multi-cloud and federated cloud systems, increasingly rely on high-performance networks (HPNs) to support large-scale cross-cloud data transfers. In such settings, advance bandwidth reservation with timedependent pricing is essential for cost-efficient and predictable data movement, w...
Liudong Zuo, Pan Lai, Michelle Zhu et al.· Fall Joint Computer Conferen...· 0 citations
InFactPlanner presents InFactPlanner, a trace-driven decision-support framework for what-if analysis of sustainable AI data center deployment for LLM inference across single and geo-distributed sites, and demonstrates scenario-driven decision analyses for hardware selection, renewable placement, geographic deployment,...
Nicoletta Tsiopani, Moysis Symeonides, G. Pallis et al.· 0 citations
This work uses spatial blindness---announced requests whose locations are revealed only when visited---as a stress test: dyadic exploration preserves a constant ratio on a known finite line, while a single hidden request on a star forces a loss linear in its degree.
Tian-Han Lu, Run-Tian Ren, Sheng-Cai Liu et al.· 0 citations
Order picking is one of the most costly activities in manual picker-to-parts warehouses, and routing quality has a direct impact on travel effort and operational efficiency. However, commercial warehouse management systems (WMSs) still often rely on simple rule-based policies because exact optimization is difficult to...
Federico Signorile, Raffaele Carli, M. Gorgoglione et al.· International Conference on...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.