Conversion apparatus, method of converting, and non-transient computer-readable recording medium having conversion program stored thereon
AssigneeFujitsu Limited
InventorShigeru KIMURA
Life of this patent
Estimating the term…
Abstract
A conversion apparatus for converting a source code into a machine language code, includes an information obtainment unit that obtains profile information from the source code; a determination unit that determines an optimal position of a prefetch command for access to a multi-dimensional array of multiple loops having a nest level of two or greater, on the basis of the profile information; and a placement unit that places the prefetch command at the optimal position.
Claims15
A conversion apparatus for converting a source code into a machine language code, the conversion apparatus comprising:
- an information obtainment unit that obtains profile information from the source code;
- a determination unit that determines an optimal position of a prefetch command for access to a multi-dimensional array of multiple loops having a nest level of two or greater, on the basis of the profile information;
- and
- a placement unit that places the prefetch command at the optimal position.
A method of converting a source code into a machine language code, the method comprising:
- obtaining profile information from the source code;
- determining an optimal position of a prefetch command for access to a multi-dimensional array of multiple loops having a nest level of two or greater, on the basis of the profile information;
- and
- placing the prefetch command at the optimal position.
A non-transient computer-readable recording medium that records a non-transient computer-readable recording medium having a conversion program stored thereon, for converting a source code into a machine language code, the conversion program being executed by a computer and causing the computer to:
- obtain profile information from the source code;
- determine an optimal position of a prefetch command for access to a multi-dimensional array of multiple loops having a nest level of two or greater, on the basis of the profile information;
- and
- place the prefetch command at the optimal position.
Dependencies are inferred from the claim text.