Abstract
The possibilities of the method of speculative multithreading dynamic parallelization of sequential programs. It implemented its formalization and identified characteristics of the method, the account which will increase the efficiency of its use in automatic parallelizing. The results of experimental studies of the algorithm dynamically allocate speculative regions.
Highlights
The possibilities of the method of speculative multithreading dynamic parallelization of sequential programs. It implemented its formalization and identified characteristics of the method, the account which will increase the efficiency of its use in automatic parallelizing
Использование предложенного алгоритма позволило повысить производительность параллельной обработки метода спекулятивной многопоточности от 5% до 65% за счет рационального выделения спекулятивных регионов и определения оптимального количества смежных итераций, выполняемых внутри каждой спекулятивной эпохи
Summary
The possibilities of the method of speculative multithreading dynamic parallelization of sequential programs. На вычислительной системе состоящей из p процессорных элементов, корректность выполнения ∀ej+k | k = 1, ( p −1) гарантируется, если подтверждена корректность ∀ej+k–1 эпохи и проверки корректности результатов между каждой парой эпох
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
