Automatic Task Parallelization of Dataflow Graphs in ML/DL models
Srinjoy Das, Lawrence Rauchwerger

TL;DR
This paper introduces Ramiel, a lightweight tool that automatically parallelizes ML dataflow graphs using critical-path clustering, enabling efficient execution on resource-constrained devices with up to 1.9x speedup.
Contribution
The paper presents a novel critical-path-based clustering method and a tool that generates readable parallel code from ML models in ONNX format, improving efficiency and applicability.
Findings
Achieved up to 1.9x speedup over serial execution.
Generated readable and executable parallel code in PyTorch+Python.
Outperformed existing mechanisms in both compile and runtime performance.
Abstract
Several methods exist today to accelerate Machine Learning(ML) or Deep-Learning(DL) model performance for training and inference. However, modern techniques that rely on various graph and operator parallelism methodologies rely on search space optimizations which are costly in terms of power and hardware usage. Especially in the case of inference, when the batch size is 1 and execution is on CPUs or for power-constrained edge devices, current techniques can become costly, complicated or inapplicable. To ameliorate this, we present a Critical-Path-based Linear Clustering approach to exploit inherent parallel paths in ML dataflow graphs. Our task parallelization approach further optimizes the structure of graphs via cloning and prunes them via constant propagation and dead-code elimination. Contrary to other work, we generate readable and executable parallel Pytorch+Python code from input…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Parallel Computing and Optimization Techniques · Embedded Systems Design Techniques
