| 摘要 |
<P>PROBLEM TO BE SOLVED: To generate high-performance parallel programs at a low cost. <P>SOLUTION: On the basis of information indicating a task boundary and first dependence information which includes N pieces of nodes corresponding to data access to one data and edges indicating dependence among the nodes, and in which at least one node has an access certainty flag indicating that the corresponding data access is certain/uncertain, a task boundary edge one part of which an uncertain access node is connected is specified among the edges over the task boundary, and presentation information indicating the uncertain access node is generated. According to dependence presence/absence information input corresponding to one data, conversion information including information indicating that there is no data access to the uncertain access node is output. According to the conversion information, the first dependence information is converted to second dependence information including M (0≤M≤N) pieces of nodes corresponding to the data access to one data and the edges indicating the dependence among the nodes. <P>COPYRIGHT: (C)2012,JPO&INPIT |
