Optimizer for program loops

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364DIG1, 3642805, G06F 944

Patent

active

054577993

ABSTRACT:
In a method for optimizing loops of a program, the program is partitioned into a plurality of procedures, each procedure including instructions related for execution. A program call graph is constructed for the program, the call graph indicating the flow of execution among the several procedures. A specific one of the procedures is identified as a dominating procedure if the specific procedure is executed more than once. Procedures called from the dominating procedure are identified as descendant procedures. The descendent and dominating procedures are designated as a loop region. Any of the descendant procedure which are called by any of procedures of the program other than the dominating procedure and the descendant procedure are identified as step procedures. Step procedures are removed from the loop region. Instructions of the loop region that do not change the execution state of the computer are removed from the loop region in a sequence as determined by the frequency of execution of such instructions.

REFERENCES:
patent: 4656682 (1987-04-01), Chaitin et al.
patent: 5193190 (1993-03-01), Janczyn et al.
patent: 5202995 (1993-04-01), O'Brien
patent: 5212794 (1993-05-01), Pettis et al.
patent: 5303377 (1994-04-01), Gupta et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Optimizer for program loops does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-2316519

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.