Skip to main content
main-content
Top

Hint

Swipe to navigate through the articles of this issue

20-11-2020 | Issue 6/2021 Open Access

The Journal of Supercomputing 6/2021

Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns

Journal:
The Journal of Supercomputing > Issue 6/2021
Authors:
Jerzy Proficz, Krzysztof M. Ocetkiewicz
Important notes

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Abstract

The Clairvoyant algorithm proposed in “A novel MPI reduction algorithm resilient to imbalances in process arrival times” was analyzed, commented and improved. The comments concern handling certain edge cases in the original pseudocode and description, i.e., adding another state of a process, improved cache friendliness more precise complexity estimations and some other issues improving the robustness of the algorithm implementation. The proposed improvements include skipping of idle loop rounds, simplifying generation of the ready set and management of the state array and an about 90-fold reduction in memory usage. Finally an extension enabling process arrival times (PATs) prediction was added: an additional background thread used to exchange the data with the PAT estimations. The performed tests, with a dedicated mini-benchmark executed in an HPC environment, showed correctness and improved performance of the solution, with comparison to the original or other state-of-the-art algorithms.
Literature
About this article

Other articles of this Issue 6/2021

The Journal of Supercomputing 6/2021 Go to the issue

Premium Partner

    Image Credits