Abstract
The development and the usage of parallel computing systems make it necessary to research parallelization resource of algorithms for search of the most rapid implementation. The algorithm representation as Q-determinant is one of the approaches that can be applied for that case. Such representation allows getting the most rapid possible implementation of the algorithm evaluates its performance complexity. Our work is to develop software system QStudio, which presents algorithm in the form of Q-determinant using the flowchart, finds the most rapid implementation of that one and builds an execution plan. The obtained results are oriented to ideal model of parallel computer system. However they can be a basis for automated execution of the most rapid algorithm implementations for real parallel computing systems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aleeva, V.N.: Analysis of parallel numerical algorithms: Preprint No. 590. Novosibirsk, Computing Center of the Siberian Branch of the Academy of Sciences of the USSR (1985)
Voevodin, V.V., Voevodin, V.V.: The V-ray technology of optimizing programs to parallel computers. In: Vulkov, L.G., Yalamov, P., Waśniewski, J. (eds.) WNAA 1996. LNCS, vol. 1196, pp. 546–556. Springer, Heidelberg (1997)
Shamakina, A.V., Sokolinsky L.B.: Testing methodology of instrumental complexes for constructing parallel programs. In: Scientific service on the Internet: Multicore Computer World. 15 years RFBR: Proceedings of the all-Russian Scientific Conference (Novorossijsk, Russia, September, 24–29, 2007), pp. 227–230. Publishing of the Moscow State University, Moscow (2007)
Ignatyev, S.V.: Definition of parallelism resource of algorithms on the base of the concept of Q-determinant. In: Scientific Service on the Internet: Supercomputer Centers and Tasks: Proceedings of the International Supercomputer Conference (Novorossijsk, Russia, September, 20–25, 2010), pp. 590–595. Publishing of the Moscow State University, Moscow (2010)
Svirihin, D.I.: Definition of parallelism resource of algorithm and its effective use for of a finite number of processors. In: Scientific Service on the Internet: the Search for New Solutions: Proceedings of the International Supercomputer Conference (Novorossijsk, Russia, September, 17–22, 2012), pp. 257–260. Publishing of the Moscow State University, Moscow (2012)
Svirihin, D.I., Aleeva, V.N.: Definition the maximum effective realization of algorithm on the base of the conception of Q-determinant. In: Parallel Computational Technologies (PCT 2013): Proceedings of the International Scientific Conference (Chelyabinsk, Russia, April, 1–5, 2013), p. 617. Publishing of the South Ural State University, Chelyabinsk (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Aleeva, V.N., Sharabura, I.S., Suleymanov, D.E. (2015). Software System for Maximal Parallelization of Algorithms on the Base of the Conception of Q-determinant. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2015. Lecture Notes in Computer Science(), vol 9251. Springer, Cham. https://doi.org/10.1007/978-3-319-21909-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-21909-7_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21908-0
Online ISBN: 978-3-319-21909-7
eBook Packages: Computer ScienceComputer Science (R0)