Optimizing source code for iterative execution

G - Physics – 06 – F

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

G06F 9/44 (2006.01) G06F 9/45 (2006.01)

Patent

CA 2365375

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.

LandOfFree

Say what you really think

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

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

     

Profile ID: LFCA-PAI-O-1893826

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