paper-with-me

Papers

Phoebe: A Learning-based Checkpoint Optimizer

2021-10-05 · Yiwen Zhu, Matteo Interlandi, Abhishek Roy, Krishnadhan Das, Hiren Patel, Malay Bag, Hitesh Sharma, Alekh Jindal

Easy-to-use programming interfaces paired with cloud-scale processing engines have enabled big data system users to author arbitrarily complex analytical jobs over massive volumes of data. However, as the complexity and scale of analytical jobs increase, they encounter a number of unforeseen problems, hotspots with large intermediate data on temporary storage, longer job recovery time after failures, and worse query optimizer estimates being examples of issues that we are facing at Microsoft. To address these issues, we propose Phoebe, an efficient learning-based checkpoint optimizer. Given a set of constraints and an objective function at compile-time, Phoebe is able to determine the decomposition of job plans, and the optimal set of checkpoints to preserve their outputs to durable global storage. Phoebe consists of three machine learning predictors and one optimization module. For each stage of a job, Phoebe makes accurate predictions for: (1) the execution time, (2) the output size, and (3) the start/end time taking into account the inter-stage dependencies. Using these predictions, we formulate checkpoint optimization as an integer programming problem and propose a scalable heuristic algorithm that meets the latency requirement of the production environment. We demonstrate the effectiveness of Phoebe in production workloads, and show that we can free the temporary storage on hotspots by more than 70% and restart failed jobs 68% faster on average with minimum performance impact. Phoebe also illustrates that adding multiple sets of checkpoints is not cost-efficient, which dramatically reduces the complexity of the optimization.

📄 PDF Abstract BibTeX arXiv:2110.02313

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Phoebe: Reuse-Aware Online Caching with Reinforcement Learning for Emerging Storage Models

2020-11-13 · Nan Wu, Pengcheng Li

With data durability, high access speed, low power efficiency and byte addressability, NVMe and SSD, which are acknowledged representatives of emerging storage technologies, have been applied broadly in many areas. Howev…

reinforcement-learningReinforcement Learning (RL)

The Eclipsing Binaries via Artificial Intelligence. II. Need for Speed in PHOEBE Forward Models

2024-12-16 · Marcin Wrona, Andrej Prša

In modern astronomy, the quantity of data collected has vastly exceeded the capacity for manual analysis, necessitating the use of advanced artificial intelligence (AI) techniques to assist scientists with the most labor…

Astronomyparameter estimation

DataStates-LLM: Lazy Asynchronous Checkpointing for Large Language Models

2024-06-15 · Avinash Maurya, Robert Underwood, M. Mustafa Rafique, Franck Cappello 외

LLMs have seen rapid adoption in all domains. They need to be trained on high-end high-performance computing (HPC) infrastructures and ingest massive amounts of input data. Unsurprisingly, at such a large scale, unexpect…

Backward-Friendly Optimization: Training Large Language Models with Approximate Gradients under Memory Constraints

2025-10-26 · Jing Yang, Kaitong Cai, Yijia Fan, Yufeng Yang 외 arxiv

Full fine-tuning of Large Language Models (LLMs) is notoriously memory-intensive, primarily because conventional optimizers such as SGD or Adam assume access to exact gradients derived from cached activations. Existing s…

How the Optimizer Shapes Learned Solutions in Equivariant Neural Networks

2026-05-26 · Teodor-Mihai Stupariu, Andrei Manolache arxiv

Equivariant neural networks encode geometric symmetries by construction, yet they are often difficult to optimize and can underperform less constrained architectures. A growing body of work addresses this through archite…