Abstract
This paper deals with the creation of rational methods for developing a schedule (execution plan) of programs for parallel computing systems of a given (homo- and heterogeneous) architecture for arbitrary algorithms. To solve this task, a software system is proposed that allows the implementation of various (heuristic) methods for building up an execution schedule for parallel programs and to quantitatively evaluate and compare the computational complexity of these methods. The quantitative results gained from the application of some methods for constructing rational parallel execution plans for classical data processing algorithms are presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
AlgoWiki. Open Encyclopedia of Algorithm Properties. http://algowiki-project.org. Accessed 30 June 2021
Fedotov, I.E.: Parallel programming. Models and techniques. M.: SOLON-Press, p. 390 (2018)
Dennis, J.B., Misunas, D.P.: A preliminary architecture for a basic data-flow processor. In: Proceedings of Second Annual Symp. Computer Architecture, Houston, Texas, pp. 126–132, January 1975
Bakanov, V.M.: Controlling the dynamics of computations in processors of streaming architecture for various types of algorithms. Softw. Eng. J. 9, 20–24 (2015)
Tanenbaum, E., Austin, T.: Computer Architecture. SPb.: Peter Publishing House, p. 816 (2019)
Bakanov, V.M.: Software complex for modeling and optimization of program implementation on parallel calculation systems. Open Comput. Sci. 8(1), 228–234, ISSN (Online) 2299-1093. https://doi.org/10.1515/comp-2018-0019
Gehry, M., Johnson, D.: Computing machines and intractable tasks. Mir, Book on Demand, p. 420 (2012)
Ierusalimschy, R.: Programming in Lua. 3rd edn. PUC-Rio, Brasil, Rio de Janeiro, p. 348 (2013)
Fisher, J.A.: Very long instruction word architectures and the ELI-512. In: International Symposium on Computer Architecture. Proceedings of the 10th Annual International Symposium on Computer Architecture, pp. 140–150. Association for Computing Machinery (ACM), New York (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bakanov, V. (2021). Research and Selection of Rational Methods for Obtaining Framework of Schedules for the Parallel Programs Execution. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Data Science and Intelligent Systems. CoMeSySo 2021. Lecture Notes in Networks and Systems, vol 231. Springer, Cham. https://doi.org/10.1007/978-3-030-90321-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-90321-3_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-90320-6
Online ISBN: 978-3-030-90321-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)