Computational complexity when constructing rational plans for program execution in a given field of parallel computers

V. M. Bakanov

Russian Technological Journal
Rossiiskii Tekhnologicheskii Zhurnal

ISSN 2782-3210 (Print)
ISSN 2500-316X (Online)

User

eng | рус

Russian Technological Journal

Advanced search

Archives

Download this PDF file

Fullscreen

For citations:

Bakanov V.M. Computational complexity when constructing rational plans for program execution in a given field of parallel computers. Russian Technological Journal. 2022;10(6):7-19. https://doi.org/10.32362/2500-316X-2022-10-6-7-19

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 2782-3210 (Print)
ISSN 2500-316X (Online)

* not an advertisement

Editor-in-Chief

Alexander S. Sigov

Indexing Databases

* not an advertisement

Article Tools

Finding References

Email this article (Login required)

Email the author (Login required)

About the Author

V. M. Bakanov
MIREA – Russian Technological University
Russian Federation

Valery M. Bakanov - Dr. Sci. (Eng.), Professor, Department of Hardware, Software and Mathematical Support of Computing Systems, Institute of Cybersecurity and Digital Technologies

78, Vernadskogo pr., Moscow, 119454

Scopus Author ID 6505511355, ResearcherID L-1314-2015, RSCI SPIN-code 8868-4594

Notifications

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Russian Technological Journal

For citations:

Cookies policy