paper-with-me

홈 › Papers

Celeritas: Fast Optimizer for Large Dataflow Graphs

2022-07-30 · Hengwei Xu, Yong Liao, Haiyong Xie, Pengyuan Zhou

The rapidly enlarging neural network models are becoming increasingly challenging to run on a single device. Hence model parallelism over multiple devices is critical to guarantee the efficiency of training large models. Recent proposals fall short either in long processing time or poor performance. Therefore, we propose Celeritas, a fast framework for optimizing device placement for large models. Celeritas employs a simple but efficient model parallelization strategy in the Standard Evaluation, and generates placement policies through a series of scheduling algorithms. We conduct experiments to deploy and evaluate Celeritas on numerous large models. The results show that Celeritas not only reduces the placement policy generation time by 26.4\% but also improves the model running time by 34.2\% compared to most advanced methods.

📄 PDF Abstract BibTeX arXiv:2208.00184

Code (0)

등록된 구현이 없습니다.

Tasks

Scheduling

Similar Papers 제목 키워드 기반

GDP: Generalized Device Placement for Dataflow Graphs

2019-09-28 · Yanqi Zhou, Sudip Roy, Amirali Abdolrashidi, Daniel Wong 외

Runtime and scalability of large neural networks can be significantly affected by the placement of operations in their dataflow graphs on suitable devices. With increasingly complex neural network architectures and heter…

Graph Neural Network

Learned Cost Model for Placement on Reconfigurable Dataflow Hardware

2025-10-21 · Etash Guha, Tianxiao Jiang, Andrew Deng, Jian Zhang 외 arxiv

Mapping a dataflow-graph of an ML model onto a reconfigurable system is difficult, as different mappings have different throughputs and consume resource constraints differently. To solve this, a model to evaluate the thr…

Recursive Function Definitions in Static Dataflow Graphs and their Implementation in TensorFlow

2024-10-26 · Kelly Kostopoulou, Angelos Charalambidis, Panos Rondogiannis

Modern machine learning systems represent their computations as dataflow graphs. The increasingly complex neural network architectures crave for more powerful yet efficient programming abstractions. In this paper we prop…

A Data-Driven Approach to Dataflow-Aware Online Scheduling for Graph Neural Network Inference

2024-11-25 · Pol Puigdemont, Enrico Russo, Axel Wassington, Abhijit Das 외

Graph Neural Networks (GNNs) have shown significant promise in various domains, such as recommendation systems, bioinformatics, and network analysis. However, the irregularity of graph data poses unique challenges for ef…

CPUGPUGraph Neural NetworkRecommendation Systems+1

KAPLA: Pragmatic Representation and Fast Solving of Scalable NN Accelerator Dataflow

2023-06-09 · Zhiyao Li, Mingyu Gao

Dataflow scheduling decisions are of vital importance to neural network (NN) accelerators. Recent scalable NN accelerators support a rich set of advanced dataflow techniques. The problems of comprehensively representing …

Scheduling