-
SOSP'25 COpter: Efficient Large-Scale Resource-Allocation via Continual Optimization
Suhas Jayaram Subramanya, Don Kurian Dennis, Gregory R. Ganger, Virginia Smith
Keywords: Resource-Allocation, MILP.
Motivation: 1) Exsiting solvers are not scalable: Extremely slow with large scales. 2) Exsitings accelerating techniques cannot keep efficiency and optimality. 3) Accelerate and keep optimality .
Design: 1) Solving a standard LP: Utilize standard LP to unify different problems. 2) System-level problem parametere manipulation for acceleration. 3) Eliminate slow post-processes from related LP solutions to MILP solutions by simple rounding.
-
SOSP'24 Tiered Memory Management: Access Latency is the Key!
Midhul Vuppalapati, Rachit Agarwal
Keywords: Measurement, Page placement
Motivation: 1) Hotest pages may be not expected: Demonstrated by experiments. 3) Palcement should minimize expected latency.
Design: 1) Measure expected queue with small effort: CPU-to-memory datapath. 2) Algorithm (Or principle): Change type (hot or alternative) of pages by measured latencies.
-
SIGCOMM'25 SaTE: Low-Latency Traffic Engineering for Satellite Networks
Hao Wu, Yizhan Han, Mohit Rajpal, Qizhen Zhang, Jingxian Wang
Keywords: Satellite Network, Traffic Engineering, ML Generalization
Motivation: 1) Dynamic: Satellite Networks' topology change frequently. 2) Generalization: NN-like approaches' general problem. 3) Large Scale: Numerous nodes and links.
Design: 1) GNN-only. 2) Graph pruning based on topology similarity (to an existing baseline topology). 3) Supervisely learn Gurobi's solution.