Optimizing source code for iterative execution

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.

1 : An optimizer stored within a memory of a computer system for optimizing source code, comprising: 
 means for generating the optimized source code having first instructions for instructing a central processing unit (CPU) to iteratively compute values for a recurrence element, said CPU operatively coupled to fast operating memory (FOM) and operatively coupled to slow operating memory (SOM) for storing said generated optimized source code; and    means for generating the optimized source code having second instructions for instructing said CPU to store a computed value of said recurrence element in a storage location of said FOM for use in a further iteration.    
   
   
       2 : The optimizer of  claim 1  wherein said recurrence element is a primary recurrence element, and further comprising means for generating said generated optimized source code having third instructions for instructing said CPU to consign, for use in a further iteration step, said computed value of said primary recurrence element from said storage location to another storage location of said FOM.  
   
   
       3 : The optimizer of  claim 2  further comprising means for causing said CPU to iteratively compute values for a subsequent recurrence element, and means for generating optimized source code having fourth instructions for instructing said CPU to compute a value of said primary recurrence element using a computed value of said subsequent recurrence element located in other storage locations of said FOM.  
   
   
       4 : The optimizer of  claim 2  wherein said another storage location contains at least one subsequent recurrence element.  
   
   
       5 : The optimizer of  claim 3  further comprising means for generating said optimized source code having fifth instructions for instructing said CPU to load an initial value of said subsequent recurrence element from said SOM to said FOM prior to computing an initial value of said primary recurrence element.  
   
   
       6 : The optimizer of  claim 3  wherein said subsequent recurrence element is a secondary recurrence element.  
   
   
       7 - 15 . (canceled)  
   
   
       16 : A method for optimizing source code, comprising: 
 instructing, by optimized source code, in a first source code instruction, a central processing unit (CPU) to iteratively compute values for a recurrence element; and    instructing, by said optimized source code, in a second source code instruction, the CPU to store a computed value of said recurrence element in a storage location of fast operating memory (FOM) for use in a further iteration by replacing said recurrence element with an instruction identifier for identifying a particular storage location within said FOM, wherein said CPU is operatively coupled to said FOM and operatively coupled to slow operating memory (SOM) for storing said optimized source code.    
   
   
       17 : The method of  claim 16  wherein said optimized source code is compiled and executed as machine code on said CPU.  
   
   
       18 : The method of  claim 17  wherein said recurrence element is a primary recurrence element, and said method further comprises consigning, by said optimized source code, in a third source code instruction, for use in a further iteration step, said computed value of said primary recurrence element from said storage location to another storage location of said FOM.  
   
   
       19 : The method of  claim 18  further comprising: 
 instructing, by said optimized source code, in a fourth source code instruction, said CPU to:    iteratively compute values for a subsequent recurrence element; and    compute a value of said primary recurrence element using a computed value of said subsequent recurrence element located in other storage locations of said FOM.    
   
   
       20 - 31 . (canceled)  
   
   
       32 : A computer program product for use in a computer system operatively coupled to a computer readable memory, the computer program product including a computer-readable data storage medium tangibly embodying computer readable program instructions for providing an optimizer, comprising: 
 first instructions for instructing a central processing unit (CPU) to iteratively compute values for a recurrence element, said CPU operatively coupled to fast operating memory (FOM) and operatively coupled to slow operating memory (SOM) for storing said generated optimized source code; and    second instructions for instructing said CPU to store a computed value of said recurrence element in a storage location of said FOM for use in a further iteration.    
   
   
       33 - 50 . (canceled)