Abstract: A non-transitory computer-readable recording medium stores a program for causing a computer to execute a process, the process includes acquiring a source code that includes descriptions of a plurality of tasks to be executed in parallel, detecting descriptions of two or more communication tasks each of which controls communication, among the descriptions of the plurality of tasks defined in the acquired source code, and adding a description that forms data dependency between communication tasks chosen in accordance with execution orders of the two or more communication tasks, to each of the detected descriptions of the two or more communication tasks in the acquired source code.

Abstract: A recording medium stores a program causing a computer to execute a process including: generating, based on a dependency relationship between statements in a program, a directed graph in which the statement in the program is a node and the dependency relationship is an edge; detecting, based on the dependency relationship represented by the edge, a node of which a part of a loop process has a dependency relationship with another preceding or following node, from the directed graph; updating the directed graph by dividing the detected node into a first node having the part of the loop process and a second node having a loop process other than the part of the loop process, fusing the divided first node and the another node, and assigning dependency information based on a data access pattern to a node after fusing; and converting the program, based on the directed graph after update.

Abstract: The present disclosure relates to a non-transitory computer-readable recording medium storing a complier that causes a computer to execute a process. The process includes generating a program. The program includes a first code that compares a first execution time from a start to an end of a loop processing when the loop processing is executed with a fixed-length SIMD instruction, with a second execution time from the start to the end of the loop processing when the loop processing is executed with a variable-length SIMD instruction, and a second code that executes the loop processing with the variable length SIMD instruction when a result of the comparison reveals that the first execution time is longer than the second execution time.

Abstract: An information processing device includes: a processor coupled to a memory and configured to: obtain a source code including loop operations, statements being included in the loop operations; split each of the loop operations into a plurality of loop operations to maintain dependency relationships among statements in the source code; and in a case where the two statements each included in corresponding one of the two loop operations after the split have a plurality of data structures including elements including contiguous addresses, when the total number of the data structures included in the two statements does not exceed a number of memory fetch streams, perform a fusion of the two loop operations to maintain a dependency relationship between the two statements, and when the total number of the data structures included in the two statements exceeds the number of memory fetch streams, not perform the fusion.

Abstract: An information processing device includes: a processor coupled to a memory and configured to: obtain a source code including loop operations, statements being included in the loop operations; split each of the loop operations into a plurality of loop operations to maintain dependency relationships among statements in the source code; and in a case where the two statements each included in corresponding one of the two loop operations after the split have a plurality of data structures including elements including contiguous addresses, when the total number of the data structures included in the two statements does not exceed a number of memory fetch streams, perform a fusion of the two loop operations to maintain a dependency relationship between the two statements, and when the total number of the data structures included in the two statements exceeds the number of memory fetch streams, not perform the fusion.