| US 7,340,733 B2 | ||
| Optimizing source code for iterative execution | ||
| Roch Georges Archambault, Scarborough (Canada); Robert James Blainey, Newmarket (Canada); Charles Brian Hall, Calgary (Canada); and Yingwei Zhang, Sunnyvale, Calif. (US) | ||
| Assigned to International Business Machines Corporation, Armonk, N.Y. (US) | ||
| Filed on Dec. 05, 2002, as Appl. No. 10/314,094. | ||
| Claims priority of application No. 2365375 (CA), filed on Dec. 18, 2001. | ||
| Prior Publication US 2003/0115579 A1, Jun. 19, 2003 | ||
| Int. Cl. G06F 9/44 (2006.01); G06F 9/45 (2006.01) | ||
| U.S. Cl. 717—151 [717/106; 717/140; 717/158; 717/159] | 48 Claims |
| 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, wherein said recurrence element is
a primary recurrence element;
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; and
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.
|