Optimizing source code for iterative execution

Details Optimizing source code for iterative execution Optimizing source code for iterative execution

2002-12-05

2008-03-04

Dam, Tuan (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S106000, C717S140000, C717S158000, C717S159000

Reexamination Certificate

active

07340733

ABSTRACT:
An embodiment of the present invention provides an optimizer for optimizing source code to generate optimized source code having instructions for instructing a central processing unit (CPU) to iteratively compute values for a primary recurrence element. A computer programmed loop for computing the primary recurrence element and subsequent recurrence elements is an example of a case involving iteratively computing the primary recurrence element. The CPU is operatively coupled to fast operating memory (FOM) and operatively coupled to slow operating memory (SOM). SOM stores the generated optimized source code. The optimized source code includes instructions for instructing said CPU to store a computed value of the primary recurrence element in a storage location of FOM. The instructions also includes instructions to consign the computed value of the primary recurrence element from the storage location to another storage location of the FOM.

REFERENCES:
patent: 5136696 (1992-08-01), Beckwith et al.
patent: 5333283 (1994-07-01), Emma et al.
patent: 5704053 (1997-12-01), Santhanam
patent: 5751981 (1998-05-01), Witt et al.
patent: 5778423 (1998-07-01), Sites et al.
patent: 5794028 (1998-08-01), Tran
patent: 5805863 (1998-09-01), Chang
patent: 5867682 (1999-02-01), Witt et al.
patent: 5867683 (1999-02-01), Witt et al.
patent: 6226790 (2001-05-01), Wolf et al.
patent: 6351849 (2002-02-01), Chen
patent: 6539541 (2003-03-01), Geva
patent: 6748589 (2004-06-01), Johnson et al.
patent: 7000227 (2006-02-01), Henry
patent: 2001/0020294 (2001-09-01), Ogawa et al.
patent: 2003/0079209 (2003-04-01), Sinha
patent: 2004/0205320 (2004-10-01), Haugen et al.
patent: 2004/0255284 (2004-12-01), Kobayashi
“Branch Strategies: Modeling and Optimization”, Dubey et al., IEEE Transactions on Computers, vol. 40, No. 10, Oct. 1991, pp. 1159-1167.
“Reducing Indirect Function Call Overhead in C++ Programs”, Calder et al., Conference Record of POPL '94: 21stACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
“Simultaneous Viewing of Performance Monitor Data Independent of Counters”, IBM Technical Disclosure Bulletin, vol. 39, No. 10, Oct. 1996, pp. 181-183.
“Optimum Thread Selection In An OO Application Server” IBM Research Disclosure, Article 416151, Dec. 1998, pp. 1722-1723.

Affiliated with

Also associated with

Rating

Optimizing source code for iterative execution does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Optimizing source code for iterative execution, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing source code for iterative execution will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3977388