| 摘要 |
<p>PROBLEM TO BE SOLVED: To more efficiently extract a set of loop division candidates in which cache misses are few.SOLUTION: A loop division detection program has the steps of: dividing a loop in a loop division object program into a plurality of divided loops on the basis of a loop division designation parameter, and converting the loop division object program to a test program having a cache miss measurement instruction for measuring a cache miss count; sequentially executing the test program while changing the loop division designation parameter, extracting a loop division candidate in which the cache miss count measured by the cache miss measurement instruction exceeds a reference count as a first loop division candidate group, and extracting a loop division candidate in which the cache miss count does not exceed the reference count as a second loop division candidate group; comparing a loop division of the loop division designation parameter with a loop division of a loop division candidate in the first loop division candidate group, and excluding a loop division in which the cache miss count exceeds the reference count from the candidate on which the test program is executed.</p> |
