Abstract
An autotracing approach to the problem of the algorithm graph construction based on the possibility of overloading operators in the C++ language is suggested. The basic idea of the approach is to replace the standard double type by a special class number, which supports basic operations on numbers (arithmetic, input/output) and constructs the graph in a background mode. A class graph is responsible for general control of the graph construction process. Classes vector and matrix are introduced to support the construction of the graph for vector and matrix operations. The library of classes developed is a powerful and flexible tool for analysis of the algorithm graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Voevodin, V.V., Matematicheskie osnovy parallel'nykh vychislenii (Mathematical Foundations of Parallel Computation), Moscow: Mosk. Gos. Univ., 1991.
Ortega, J.M., Introduction to Parallel and Vector Solution of Linear Systems, New York: Plenum, 1988. Translated under the title Vvedenie v parallel'nye i vectornye metody resheniya lineinykh sistem, Moscow: Mir, 1991.
CONVEX CXpa Reference, 1996, 2nd edition.
Voevodin, Vl.V., Analytical and Software Tools for Examination of Fine Program Structure, Doctoral (Phys.-Math.) Dissertation, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ershov, N.M. Construction of the Algorithm Graph by Autotracing Method. Programming and Computer Software 26, 335–340 (2000). https://doi.org/10.1023/A:1026608606909
Issue Date:
DOI: https://doi.org/10.1023/A:1026608606909