Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

An Efficient Optimization Method for Computational Cost Constrained Problems in Compiler Optimization

A technology of constraint problems and optimization methods, applied in the field of compiler optimization, can solve problems such as computational cost constraints and large algorithm execution time overhead, and achieve the effects of speeding up iteration, improving operating efficiency, and reducing operating time.

Active Publication Date: 2021-04-20
DALIAN UNIV OF TECH
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this solution suffers from computational cost constraints
For example, in the genetic algorithm, the optimization effect of each compilation optimization sequence in the population needs to be calculated in each round of iteration, that is, the compiler needs to use each optimization sequence to compile the program to be compiled once, and execute the program to obtain the optimization effect, which The execution time overhead of the algorithm is very huge, which brings about the problem of computational cost constraints

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An Efficient Optimization Method for Computational Cost Constrained Problems in Compiler Optimization
  • An Efficient Optimization Method for Computational Cost Constrained Problems in Compiler Optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] This solution is deployed on a server, and the required compiler needs to be installed according to the compilation optimization sequence selection problem. The method is composed of encoding program, approximate agent function construction program, local search program, evolution operation program and program compiler program.

[0031] Such as figure 1 As shown in , the selection of the optimal compilation optimization sequence for the program to be compiled is carried out as follows. In the iterative process of compilation optimization sequence selection, in addition to the deterministic factors specified in the compilation environment, other factors, such as population size, iteration termination conditions, crossover operators, etc., are set according to specific situations.

[0032] Step 1: Encoding. This scheme uses the binary encoding strategy, that is, the 0, 1 string generated by the binary character set {0, 1} to represent the candidate solution in the probl...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides an efficient optimization method oriented to the calculation cost constraint problem in compilation optimization, is a solution to the calculation cost constraint problem, and belongs to the field of compiler optimization. In this method, the compiled optimization sequence is first binary coded and the fitness function is designed, and a new population is iteratively generated by crossover operation and selection operation, so as to obtain the optimal solution. In this iterative process, an approximate surrogate function is constructed using the compiled optimization sequence and the corresponding fitness value, a local search is performed for each individual in the population, and the individual is replaced with a local optimal solution, thereby improving evolutionary efficiency. The invention can effectively select the optimal compilation optimization sequence for the program to be compiled, accelerate the iteration speed, and improve the operation efficiency of the algorithm.

Description

technical field [0001] The invention belongs to the technical field of compiler optimization, and is a solution to the calculation cost constraint problem in the compilation optimization sequence selection. Background technique [0002] Compiler is a very important basic tool in the process of software development. It takes the source program written in high-level computer language as input, and after lexical analysis, syntax analysis, semantic analysis, intermediate code generation, code optimization, and object code generation, it finally obtains Executable target machine code. In the actual development process, the compiled target machine code needs to have relatively ideal performance, such as small executable code size, fast execution speed, and low power consumption. Therefore, the compiler provides a large number of compilation optimization options, and the developer needs to select a set of compilation optimization options according to the actual situation to form a...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F8/30G06F8/41
CPCG06F8/37G06F8/443
Inventor 江贺高国军任志磊
Owner DALIAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Eureka Blog
Learn More
PatSnap group products