Evaluation of automatic parallelization algorithms to minimize speculative parallelism overheads: An experiment. (4th July 2021)

• Record Type: Journal Article
• Authors: Kumar, Sudhakar; Singh, Sunil Kr.; Aggarwal, Kriti; Aggarwal, Naveen
• Is Part Of: Journal of discrete mathematical sciences & cryptography. Volume 24:Number 5(2021)
• Page Start: 1517
• Page End: 1528
• Publication Date: 2021-07-04
• Subjects: 68W10 -- 68Q87; Automatic parallelization -- Independent and pipeline multi-threading -- Speculative parallelism overheads; Computer science -- Mathematics -- Periodicals; Cryptography -- Periodicals; Computer science -- Mathematics; Cryptography; Periodicals; 004.0151
• DOI: 10.1080/09720529.2021.1951435
• Languages: English
• ISSNs: 0972-0529

Abstract

Abstract: Automatic parallelization is a crucial objective of the parallel computing architecture that can be achieved through conversion of sequential code into multi-threaded code, which will run in parallel manner. This approach focuses largely on the loops since they take most of the execution time in programs. Thread level speculation techniques come into roleplay while checking for the dependencies. These dependencies cannot be identified at the compile time, thus providing a larger scope of parallelization when combined with other parallelisation techniques. This results in a greater speedup and more accurate parallel code formation. In this research paper, an experiment to evaluate the performance and comparative analysis has been done among key automatic parallelization algorithms on different parameters like number of cores, speedup and loop dependency taking into consideration of speculation.