Partitioning optimizations in an optimizing compiler

Details Partitioning optimizations in an optimizing compiler Partitioning optimizations in an optimizing compiler

G - Physics

06

F

354/230, 354/46

G06F 9/45 (2006.01)

Patent

CA 2019787

A computer program is optimized prior to carrying out the final compilation. Subgraphs within the program are identified and examined for optimization beginning with the entire program as the largest subgraph. The number of entities in each subgraph which are relevant to each dimension of arrays used to represent data flow equations is determined. Next, the amount of memory required to contain the arrays is determined. If that memory requirement is within a predefined memory usage limit for the compilation, then a specified procedure of the compilation process is applied. If the memory requirement to contain the arrays exceeds the predefined memory usage limit for the compilation, the process is repeated for successively smaller subgraphs within the program in an attempt to find a subgraph to which the memory limits allow application of the specified procedure.

Affiliated with

Also associated with

Rating

Partitioning optimizations in an optimizing compiler does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Partitioning optimizations in an optimizing compiler, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitioning optimizations in an optimizing compiler will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1606349