专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20070011441A1 Method and system for data-driven runtime alignment operation 审中-公开
标题翻译：数据驱动运行时对齐操作的方法和系统
公开(公告)号：US20070011441A1
公开(公告)日：2007-01-11
申请号：US11176988
申请日：2005-07-08
申请人： Alexandre Eichenberger , Michael Gschwind , Valentina Salapura , Peng Wu
发明人： Alexandre Eichenberger , Michael Gschwind , Valentina Salapura , Peng Wu
IPC分类号： G06F9/44
CPC分类号： G06F9/355 , G06F9/30032 , G06F9/30036 , G06F9/30043 , G06F9/30112 , G06F9/3013 , G06F9/3816 , G06F9/3824
摘要： A method for processing instructions and data in a processor includes steps of: preparing an input stream of data for processing in a data path in response to a first set of instructions specifying a dynamic parameter; and processing the input stream of data in the same data path in response to a second set of instructions. A common portion of a dataflow is used for preparing the input stream of data for processing in response to a first set of instructions under the control of a dynamic parameter specified by an instruction of the first set of instructions, and for operand data routing based on the instruction specification of a second set of instructions during the processing of the input stream in response to the second set of instructions.
摘要翻译：一种用于在处理器中处理指令和数据的方法，包括以下步骤：响应于指定动态参数的第一组指令，准备用于在数据路径中进行处理的输入数据流; 以及响应于第二组指令来处理相同数据路径中的输入数据流。数据流的公共部分用于在由第一组指令的指令指定的动态参数的控制下响应于第一组指令来准备用于处理的输入数据流，并且基于用于基于响应于第二组指令在输入流的处理期间的第二组指令的指令指定。

12. 发明申请

US20070169058A1 Method and system for versioning codes based on relative alignment for single instruction multiple data units 失效
标题翻译：基于单指令多数据单元相对对齐的版本编码方法和系统
公开(公告)号：US20070169058A1
公开(公告)日：2007-07-19
申请号：US11333614
申请日：2006-01-17
申请人： Alexandre Eichenberger , Amy Wang , Peng Wu , Peng Zhao
发明人： Alexandre Eichenberger , Amy Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/45
CPC分类号： G06F8/49
摘要： A method and system for generating efficient versioned codes for single instruction multiple data units whose memory systems have alignment constraints. The system creates multiple versions of codes based on relative alignments of the data streams involved in the computation. The system also analyzes characteristics of relative alignments (e.g. compile-time or runtime) to determine whether code versioning is beneficial based on a cost model.
摘要翻译：一种用于为存储器系统具有对准约束的单指令多数据单元生成有效版本代码的方法和系统。该系统基于计算中涉及的数据流的相对对齐来创建多个版本的代码。该系统还分析相对比对的特征（例如编译时或运行时间），以确定代码版本化是否基于成本模型是有益的。

13. 发明申请

US20050132172A1 Method and apparatus for eliminating the need for register assignment, allocation, spilling and re-filling 有权
标题翻译：无需注册分配，分配，溢出和重新填充的方法和设备
公开(公告)号：US20050132172A1
公开(公告)日：2005-06-16
申请号：US10735054
申请日：2003-12-12
申请人： Alexandre Eichenberger , Erik Altman , Sumedh Sathaye , John-David Wellman
发明人： Alexandre Eichenberger , Erik Altman , Sumedh Sathaye , John-David Wellman
IPC分类号： G06F9/30 , G06F9/318 , G06F9/38
CPC分类号： G06F9/30181 , G06F9/30076 , G06F9/30134 , G06F9/3836 , G06F9/3838 , G06F9/384 , G06F9/3855
摘要： A method and apparatus is provided to manage data in computer registers in a program, making more computer registers available to one or more programmers utilizing a name level instruction. The method and apparatus disclosed herein presents a way of reducing the overhead of register management, by introducing a concept of a name level for each of the named architected registers in a processor. The method provides a programmer with a larger register name-space while not increasing the size of the instruction word in the processor instruction-set architecture. It also provides for the facilitation of architectural features which overload the architected register namespace and ease the overhead of register management. This provides for the addition of more computer registers without changing the instruction format of the computer.
摘要翻译：提供了一种方法和装置来管理程序中的计算机寄存器中的数据，使得使用名称级别指令的一个或多个程序员可以使用更多的计算机寄存器。本文公开的方法和装置通过在处理器中引入每个命名架构寄存器的名称级别的概念来呈现减少注册管理开销的方式。该方法为编程器提供了更大的寄存器名称空间，而不增加处理器指令集架构中的指令字的大小。它还提供了对架构特征的便利化，这样就可以使架构化的寄存器命名空间过载，并且简化了寄存器管理的开销。这样可以增加更多的计算机寄存器，而不用改变计算机的指令格式。

14. 发明申请

US20070174825A1 Apparatus and method for optimizing scalar code executed on a SIMD engine by alignment of SIMD slots 审中-公开
标题翻译：用于通过SIMD槽的对准来优化在SIMD引擎上执行的标量的装置和方法
公开(公告)号：US20070174825A1
公开(公告)日：2007-07-26
申请号：US11339591
申请日：2006-01-25
申请人： Alexandre Eichenberger , John Kevin O'Brien
发明人： Alexandre Eichenberger , John Kevin O'Brien
IPC分类号： G06F9/45
CPC分类号： G06F9/3885 , G06F9/30032 , G06F9/30036 , G06F9/30109 , G06F9/3824
摘要： An apparatus and method for optimizing scalar code executed on a single instruction multiple data (SIMD) engine is provided that aligns the slots of SIMD registers. With the apparatus and method, a compiler is provided that parses source code and, for each statement in the program, generates an expression tree. The compiler inspects all storage inputs to scalar operations in the expression tree to determine their alignment in the SIMD registers. This alignment is propagated up the expression tree from the leaves. When the alignments of two operands in the expression tree are the same, the resulting alignment is the shared value. When the alignments of two operands in the expression tree are different, one operand is shifted. For shifted operands, a shift operation is inserted in the expression tree. The executable code is then generated for the expression tree and shifts are inserted where indicated.
摘要翻译：提供了一种用于优化在单指令多数据（SIMD）引擎上执行的标量码的装置和方法，其对准SIMD寄存器的时隙。使用设备和方法，提供了一个解析源代码的编译器，对于程序中的每个语句，都会生成一个表达式树。编译器检查表达式树中的所有存储输入到标量运算，以确定它们在SIMD寄存器中的对齐。该对齐方式从树叶中向上传播。当表达式树中的两个操作数的对齐方式相同时，生成的对齐方式是共享值。当表达式树中的两个操作数的对齐不同时，一个操作数被移位。对于移位的操作数，在表达式树中插入shift操作。然后为表达式树生成可执行代码，并在指定的位置插入移位。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式