Affine Transformations of Loop Nests for Parallel Execution and Distribution of Data over Processors
E. V. Adutskevich, S. V. Bakhanovich, N. A. Likhoded
Abstract
The paper is devoted to the problem of mapping affine loop nests onto distributed memory parallel computers. A method to find affine transformations of loop nests for parallel execution and distribution of data over processors is presented. The method tends to minimize the number of communications between processors and to improve locality of data within one processor. A problem of determination of data exchange sequence is investigated. Conditions to determine the ability to arrange broadcast is presented.
Create a lesson
Related papers
Consensus with Stochastic Broadcast
Pierre Fraigniaud, Boaz Patt-Shamir, Sergio Rajsbaum
Decoupled I/O-Dominant Pipelines for Large-Scale Whole-Slide Image Embedding Extraction
Mayanka Chandrashekar, Xi Zhang, Ethan Seefried et al.
Sintr: Safe Interactive Transactions in the Presence of Byzantine Clients
Austin T. Li, Daniel H. Lee, Lorenzo Alvisi et al.
Benchmarking Confidential Computing Performance on NVIDIA Blackwell GPUs
Daniyal Khan, Amean Asad, Ansgar Grunseid
Optimizing API Gateway Placement in Multi-Cloud Kubernetes
Vinoth Punniyamoorthy, Murali Shankar Dulam, Aswathnarayan Muthukrishnan Kirubakaran et al.
VPP: Virtual Pipeline Parallelism for Efficient Chunked Prefill in Long-Context LLM Inference
Yan Shi, Xiaochao Wang, Jingchun Gao et al.