Parallelism Resource of Numerical Algorithms. Version 1
Valentina N. Aleeva, Rifkhat Zh. Aleev

TL;DR
This paper introduces a $Q$-determinant framework for analyzing and designing parallel algorithms, enabling efficient implementation by fully utilizing the parallelism resource in numerical computations.
Contribution
The paper presents the $Q$-determinant concept, a software $Q$-system for studying parallelism, and a method for designing $Q$-effective parallel programs for numerical algorithms.
Findings
The $Q$-system effectively compares parallelism resources of algorithms.
Application to various algorithms demonstrates the framework's utility.
Proposes a method for creating fully parallelized, $Q$-effective programs.
Abstract
The paper is devoted to an approach to solving a problem of the efficiency of parallel computing. The theoretical basis of this approach is the concept of a -determinant. Any numerical algorithm has a -determinant. The -determinant of the algorithm has clear structure and is convenient for implementation. The -determinant consists of -terms. Their number is equal to the number of output data items. Each -term describes all possible ways to compute one of the output data items based on the input data. We also describe a software -system for studying the parallelism resource of numerical algorithms. This system enables to compute and compare the parallelism resources of numerical algorithms. The application of the -system is shown on the example of numerical algorithms with different structures of -determinants. Furthermore, we suggest a method for designing…
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
TopicsAdvanced Data Processing Techniques
