arXiv subjects

Chang-Lin Chen

Publications and source records attributed to Chang-Lin Chen.

4 recordsLinked to original sources

arXiv2025

Rack Position Optimization in Large-Scale Heterogeneous Data Centers

As rapidly growing AI computational demands accelerate the need for new hardware installation and maintenance, this work explores optimal data center resource management by balancing operational efficiency with fault tolerance through strategic rack positioning considering diverse resources and locations. Traditional mixed-integer programming (MIP) approaches often struggle with scalability, while heuristic methods may result in significant sub-optimality. To address these issues, this paper presents a novel two-tier optimization framework using a high-level deep reinforcement learning (DRL) model to guide a low-level gradient-based heuristic for local search. The high-level DRL agent employs Leader Reward for optimal rack type ordering, and the low-level heuristic efficiently maps racks to positions, minimizing movement counts and ensuring fault-tolerant resource distribution. This approach allows scalability to over 100,000 positions and 100 rack types. Our method outperformed the gradient-based heuristic by 7\% on average and the MIP solver by over 30\% in objective value. It achieved a 100\% success rate versus MIP's 97.5\% (within a 20-minute limit), completing in just 2 minutes compared to MIP's 1630 minutes (i.e., almost 4 orders of magnitude improvement). Unlike the MIP solver, which showed performance variability under time constraints and high penalties, our algorithm consistently delivered stable, efficient results - an essential feature for large-scale data center management.

cs.AI↗

arXiv2024

Conceptual Design of the Muonium-to-Antimuonium Conversion Experiment (MACE)

The spontaneous conversion of muonium to antimuonium is one of the interesting charged lepton flavor violation phenomena offering a sensitive probe of potential new physics and serving as a tool to constrain the parameter space beyond the Standard Model. The Muonium-to-Antimuonium Conversion Experiment (MACE) is designed to utilize a high-intensity muon beam, a Michel electron magnetic spectrometer, a positron transport system, and a positron detection system, to either discover or constrain this rare process with a conversion probability of $\mathcal{O}(10^{-13})$. This article presents an overview of the theoretical framework as well as a detailed description of the experimental design for the search for muonium-to-antimuonium conversion.

hep-ex↗

arXiv2023

Learning-based Two-tiered Online Optimization of Region-wide Datacenter Resource Allocation

Online optimization of resource management for large-scale data centers and infrastructures to meet dynamic capacity reservation demands and various practical constraints (e.g., feasibility and robustness) is a very challenging problem. Mixed Integer Programming (MIP) approaches suffer from recognized limitations in such a dynamic environment, while learning-based approaches may face with prohibitively large state/action spaces. To this end, this paper presents a novel two-tiered online optimization to enable a learning-based Resource Allowance System (RAS). To solve optimal server-to-reservation assignment in RAS in an online fashion, the proposed solution leverages a reinforcement learning (RL) agent to make high-level decisions, e.g., how much resource to select from the Main Switch Boards (MSBs), and then a low-level Mixed Integer Linear Programming (MILP) solver to generate the local server-to-reservation mapping, conditioned on the RL decisions. We take into account fault tolerance, server movement minimization, and network affinity requirements and apply the proposed solution to large-scale RAS problems. To provide interpretability, we further train a decision tree model to explain the learned policies and to prune unreasonable corner cases at the low-level MILP solver, resulting in further performance improvement. Extensive evaluations show that our two-tiered solution outperforms baselines such as pure MIP solver by over $15\%$ while delivering $100\times$ speedup in computation.

cs.NI↗

arXiv2015

Deterministic Differential Search Algorithm for Distributed Sensor/Relay Networks

For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply since the power source of the transmitters cannot be recharged continually. To resolve this, distributed beamforming has been proposed as a viable solution where all distributed transmitters seek to align in phase at the receiver end. However, it is difficult to implement such transmit beamforming in a distributed fashion in practice since perfect channel state information (CSI) need to be made available at all distributed transmitters, requiring tremendous overhead to feed back CSI from the receiver to all distributed transmitters. In this paper, we propose a novel algorithm that belongs to the category of deterministic phase adjustment algorithm: the Deterministic Differential Search Algorithm (DDSA), where the differences between the measured received signal strength (RSS) are utilized judiciously to help us predict the deterministic phase adjustment done at distributed transmitters. Numerical simulations demonstrate rapid convergence to a pre-determined threshold.

cs.IT↗