STATIC PROFITABILITY CONTROL FOR SPECULATIVE AUTOMATIC PARALLELIZATION
First Claim
1. A method for compilation comprising:
- analyzing source code;
identifying candidate code for parallelization;
determining a profitability of parallelizing the candidate code;
parallelizing said candidate code, in response to determining said profitability meets a predetermined criteria;
forgoing parallelization of said candidate code, in response to determining said profitability does not meet said criteria.
2 Assignments
0 Petitions
Accused Products
Abstract
A compilation method and mechanism for parallelizing program code. A method for compilation includes analyzing source code and identifying candidate code for parallelization. Having identified one or more suitable candidates, the profitability of parallelizing the candidate code is determined. If the profitability determination meets a predetermined criteria, then the candidate code may be parallelized. If, however, the profitability determination does not meet the predetermined criteria, then the candidate code may not be parallelized. Candidate code may comprises a loop, and determining profitability of parallelization may include computing a probability of transaction failure for the loop. Additionally, a determination of an execution time of a parallelized version of the loop is made. If the determined execution time is less than an execution time of a non-parallelized version of said loop by at least a given amount, then the loop may be parallelized. If the determined execution time is not less than an execution time of a non-parallelized version of said loop by at least a given amount, then the loop may not be parallelized.
-
Citations
20 Claims
-
1. A method for compilation comprising:
-
analyzing source code; identifying candidate code for parallelization; determining a profitability of parallelizing the candidate code; parallelizing said candidate code, in response to determining said profitability meets a predetermined criteria; forgoing parallelization of said candidate code, in response to determining said profitability does not meet said criteria. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer readable storage medium comprising program instructions operable for compilation, wherein the program instructions are executable to:
-
analyze source code; identify candidate code for parallelization; determine a profitability of parallelizing the candidate code; parallelize said candidate code, in response to determining said profitability meets a predetermined criteria; forego parallelization of said candidate code, in response to determining said profitability does not meet said criteria. - View Dependent Claims (10, 11, 12, 13, 14, 15, 16)
-
-
17. A computing system comprising:
-
a processor; a storage medium configured to store application source code; and a storage medium comprising program instructions, wherein the program instructions are executable by the processor to; analyze said source code; identify candidate code of the source code for parallelization; determine a profitability of parallelizing the candidate code; parallelize said candidate code, in response to determining said profitability meets a predetermined criteria; and forego parallelization of said candidate code, in response to determining said profitability does not meet said criteria. - View Dependent Claims (18, 19, 20)
-
Specification