Invention Grant
- Patent Title: Operand data structure for block computation
- Patent Title (中): 块计算的操作数数据结构
-
Application No.: US12336301Application Date: 2008-12-16
-
Publication No.: US08407680B2Publication Date: 2013-03-26
- Inventor: Ravi K. Arimilli , Balaram Sinharoy
- Applicant: Ravi K. Arimilli , Balaram Sinharoy
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Yudell Isidore Ng Russell PLLC
- Main IPC: G06F9/45
- IPC: G06F9/45

Abstract:
In response to receiving pre-processed code, a compiler identifies a code section that is not a candidate for acceleration and a code block that is a candidate for acceleration. The code block specifies an iterated operation having a first operand and a second operand, where each of multiple first operands and each of multiple second operands for the iterated operation has a defined addressing relationship. In response to the identifying, the compiler generates post-processed code containing lower level instruction(s) corresponding to the identified code section and creates and outputs an operand data structure separate from the post-processed code. The operand data structure specifies the defined addressing relationship for the multiple first operands and for the multiple second operands. The compiler places a block computation command in the post-processed code that invokes processing of the operand data structure to compute operand addresses.
Public/Granted literature
- US20100153931A1 Operand Data Structure For Block Computation Public/Granted day:2010-06-17
Information query