Invention Grant
- Patent Title: Method and system for performing reassociation in software loops
- Patent Title (中): 在软件循环中执行重新关联的方法和系统
-
Application No.: US11238303Application Date: 2005-09-29
-
Publication No.: US07774766B2Publication Date: 2010-08-10
- Inventor: Kalyan Muthukumar , Daniel M Lavery
- Applicant: Kalyan Muthukumar , Daniel M Lavery
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Blakely, Sokoloff, Taylor & Zafman LLP
- Main IPC: G06F9/45
- IPC: G06F9/45 ; G06F15/00

Abstract:
Various embodiments of the present invention relate to methods and systems for optimizing an intermediate code in a compilation logic. The intermediate code is optimized by performing reassociation in software loops. The intermediate code includes at least one critical recurrence cycle. The performance of reassociation in software loops can reduce a critical recurrence cycle in them, which can speed up their execution. The subject method can include the determination of one or more critical recurrence cycles in a software loop. The method can also include the determination of at least one edge in a critical recurrence cycle, with respect to which reassociation can be performed, if one or more pre-determined criteria are met. The method can further include performing reassociation of a dependee and a dependent of an edge. In an embodiment, when one or more pre-determined criteria are met, the logic of the software loop is maintained after performing reassociation of the dependee and the dependent of the edge. Consequently, the number of cycles in a critical recurrence cycle of the software loop is reduced. The execution time of the software loop is also decreased.
Public/Granted literature
- US20070074186A1 Method and system for performing reassociation in software loops Public/Granted day:2007-03-29
Information query