Loop allocation for optimizing compilers

Details Loop allocation for optimizing compilers Loop allocation for optimizing compilers

G - Physics

06

F

G06F 9/45 (2006.01)

Patent

CA 2288614

Loop allocation for optimizing compilers includes the generation of a program dependence graph for a source code segment. Control dependence graph representations of the nested loops, from innermost to outermost, are generated and data dependence graph representations are generated for each level of nested loop as constrained by the control dependence graph. An interference graph is generated with the nodes of the data dependence graph. Weights are generated for the edges of the interference graph reflecting the affinity between statements represented by the nodes joined by the edges. Nodes in the interference graph are given weights reflecting resource usage by the statements associated with the nodes. The interference graph is partitioned using a profitability test based on the weights of edges and nodes and on a correctness test based on the reachability of nodes in the data dependence graph. Code is emitted based on the partitioned interference graph.

Affiliated with

Also associated with

Rating

Loop allocation for optimizing compilers does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Loop allocation for optimizing compilers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loop allocation for optimizing compilers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1830087