Search
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.
Citations
-
0
CrossRef
-
0
Web of Science
-
1
Scopus
Cite as
Full text
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuły w czasopismach
- Published in:
-
JOURNAL OF SUPERCOMPUTING
no. 77,
pages 6145 - 6177,
ISSN: 0920-8542 - Language:
- English
- Publication year:
- 2021
- Bibliographic description:
- Proficz J., Ocetkiewicz K.: Improving Clairvoyant: reduction algorithm resilient to imbalanced process arrival patterns// JOURNAL OF SUPERCOMPUTING -Vol. 77, (2021), s.6145-6177
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s11227-020-03499-1
- Verified by:
- Gdańsk University of Technology
seen 114 times