mlsanityData to 14 Oct 2026

Improving all-reduce collective operations for imbalanced process arrival patterns

arXiv 1804.05349 ↗First posted 15 Apr 2018cs.DCcited by 1

Not on the map. Why?

Abstract (arXiv)

Two new algorithms for the all-reduce operation, optimized for imbalanced process arrival patterns (PAPs) are presented: (i) sorted linear tree (SLT), (ii) pre-reduced ring (PRR) as well as a new way of on-line PAP detection, including process arrival time (PAT) estimations and their distribution between cooperating processes was introduced. The idea, pseudo-code, implementation details, benchmark for performance evaluation and a real case example for machine learning are provided. The results of the experiments were described and analyzed, showing that the proposed solution has high scalability and improved performance in comparison with the usually used ring and Rabenseifner algorithms.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 15 Apr 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.