Method for improving the efficiency of arithmetic code generatio

Details Method for improving the efficiency of arithmetic code generatio Method for improving the efficiency of arithmetic code generatio

1986-10-31

1989-01-31

Shaw, Gareth D.

Boots, shoes, and leggings

364200, G06F 944

Patent

active

048020915

ABSTRACT:
A procedure for use in an optimizing compiler termed "reassociation" determines the preferred order of combining terms in a sum so as to produce loop invariant subcomputations, or to promote common subexpressions among several essential computations, by applying the associative law of addition. To achieve this, the requisite optimization of an object program or program segment, the following discrete steps must be performed after the strongly connected regions, USE and DEF chains have all been identified:

REFERENCES:
patent: 4215416 (1980-07-01), Muramatsu
patent: 4309756 (1982-01-01), Beckler
patent: 4367535 (1983-01-01), Matsugama
patent: 4399517 (1983-08-01), Niehaus et al.
Randolph G. Scarborough and Harwood G. Kolsky, "Improved Optimization of Fortran Object Programs," IBM J. Res. Develop. vol. 24, No. 6, pp. 660-676, Nov. 1980.
Robert Paige, "Formal Differentiation," Courant Computer Science Report #15, Courant Institute of Mathematical Sciences, New York University, Sep. 1979.

Affiliated with

Also associated with

Rating

Method for improving the efficiency of arithmetic code generatio does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for improving the efficiency of arithmetic code generatio, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for improving the efficiency of arithmetic code generatio will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-182074