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

1. 发明申请

US20130151822A1 Efficient Enqueuing of Values in SIMD Engines with Permute Unit 审中-公开
标题翻译：有效排队SIMD发动机与价值单位
公开(公告)号：US20130151822A1
公开(公告)日：2013-06-13
申请号：US13315596
申请日：2011-12-09
申请人： Alexandre E. Eichenberger , John K.P. O'Brien , Yuan Zhao
发明人： Alexandre E. Eichenberger , John K.P. O'Brien , Yuan Zhao
IPC分类号： G06F9/38
CPC分类号： G06F9/30072 , G06F9/30018 , G06F9/30036
摘要： Mechanisms, in a data processing system having a processor, for generating enqueued data for performing computations of a conditional branch of code are provided. Mask generation logic of the processor operates to generate a mask representing a subset of iterations of a loop of the code that results in a condition of the conditional branch being satisfied. The mask is used to select data elements from an input data element vector register corresponding to the subset of iterations of the loop of the code that result in the condition of the conditional branch being satisfied. Furthermore, the selected data elements are used to perform computations of the conditional branch of code. Iterations of the loop of the code that do not result in the condition of the conditional branch being satisfied are not used as a basis for performing computations of the conditional branch of code.
摘要翻译：提供了在具有处理器的数据处理系统中用于生成用于执行代码的条件分支的计算的入队数据的机制。处理器的掩码生成逻辑操作以产生代表导致条件分支的条件得到满足的代码循环的迭代子集的掩码。该掩码用于从输入数据元素向量寄存器中选择数据元素，该数据元素对应于导致满足条件分支条件的代码循环的迭代子集。此外，所选择的数据元素用于执行代码的条件分支的计算。不导致满足条件分支的条件的代码的循环的迭代不用作执行代码的条件分支的计算的基础。

2. 发明申请

US20110055484A1 Detecting Task Complete Dependencies Using Underlying Speculative Multi-Threading Hardware 有权
标题翻译：使用基础投机多线程硬件检测任务完成依赖关系
公开(公告)号：US20110055484A1
公开(公告)日：2011-03-03
申请号：US12553314
申请日：2009-09-03
申请人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Lakshminarayanan Renganarayana , Xiaotong Zhuang
发明人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Lakshminarayanan Renganarayana , Xiaotong Zhuang
IPC分类号： G06F9/30 , G06F12/08
CPC分类号： G06F9/3814 , G06F9/3834 , G06F9/3838 , G06F9/3842 , G06F9/3851 , G06F9/3857 , G06F9/3859
摘要： Mechanisms are provided for tracking dependencies of threads in a multi-threaded computer program execution. The mechanisms detect a dependency of a first thread's execution on results of a second thread's execution in an execution flow of the multi-threaded computer program. The mechanisms further store, in a hardware thread dependency vector storage associated with the first thread's execution, an identifier of the dependency by setting at least one bit in the hardware thread dependency vector storage corresponding to the second thread. Moreover, the mechanisms schedule tasks performed by the multi-threaded computer program based on the hardware thread dependency vector storage to minimize squashing of threads.
摘要翻译：提供了用于跟踪多线程计算机程序执行中线程依赖性的机制。该机制检测第一个线程执行对多线程计算机程序执行流程中第二个线程执行结果的依赖性。这些机制通过在与第二线程相对应的硬件线程相关性向量存储中设置至少一个比特来进一步存储与第一线程的执行相关联的硬件线程依赖向量存储中的依赖关系的标识符。此外，该机制基于硬件线程依赖向量存储来调度由多线程计算机程序执行的任务以最小化线程的挤压。

3. 发明申请

US20110219222A1 Building Approximate Data Dependences with a Moving Window 失效
标题翻译：用移动窗口构建近似数据依赖
公开(公告)号：US20110219222A1
公开(公告)日：2011-09-08
申请号：US12717985
申请日：2010-03-05
申请人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Kai-Ting A. Wang , Xiaotong Zhuang
发明人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Kai-Ting A. Wang , Xiaotong Zhuang
IPC分类号： G06F9/32
CPC分类号： G06F9/32
摘要： Mechanisms for building approximate data dependences using a moving look-back window are provided. The mechanisms track dependence information for memory accesses over iterations of execution of a portion of code. The mechanisms receive a memory access of an iteration of the portion of code, the memory access having an address for access the memory and an access type indicating at least one of a read or a write access type. An entry in a moving look-back window data structure is generated corresponding to a memory location accessed by the memory access. The entry comprises at least an identification of the address, the access type, and an iteration number corresponding to the iteration of the memory access. The moving look-back window data structure is utilized to determine dependence information for memory accesses over a plurality of iterations of the portion of code.
摘要翻译：提供了使用移动后视窗构建近似数据依赖关系的机制。机制跟踪代码的一部分执行迭代的存储器访问的依赖信息。机构接收代码部分的迭代的存储器访问，存储器访问具有用于访问存储器的地址和指示读取或写入访问类型中的至少一个的访问类型。对应于由存储器访问访问的存储器位置产生移动后视窗数据结构中的条目。该条目至少包括对应于存储器访问的迭代的地址的标识，访问类型和迭代号。移动后视窗数据结构用于确定代码部分的多个迭代中的存储器访问的依赖信息。

4. 发明申请

US20130283250A1 Thread Specific Compiler Generated Customization of Runtime Support for Application Programming Interfaces 审中-公开
标题翻译：线程专用编译器生成的应用程序编程接口运行时支持的定制
公开(公告)号：US20130283250A1
公开(公告)日：2013-10-24
申请号：US13453411
申请日：2012-04-23
申请人： Alexandre E. Eichenberger , John K.P. O'Brien
发明人： Alexandre E. Eichenberger , John K.P. O'Brien
IPC分类号： G06F9/45
CPC分类号： G06F8/43
摘要： Mechanisms are provided for generating a customized runtime library for source code. Source code is analyzed to identify a region of code implementing an application programming interface or programming standard of interest. An invocation tree data structure is generated based on results of analysis of functions of the application programming interface or programming standard of interest that the region of code invokes. A custom runtime library is generated based on the invocation tree data structure. The custom runtime library comprises only a subset of runtime library functions, less than a total number of runtime library functions for the application programming interface or programming standard of interest, actually invoked by the region of code and does not include all runtime library functions in the total number of runtime library functions for the application programming interface or programming standard of interest.
摘要翻译：提供了用于生成用于源代码的定制运行时库的机制。分析源代码以识别实现应用编程接口或感兴趣的编程标准的代码区域。基于应用编程接口的功能分析结果或代码调用的兴趣编程标准的结果生成调用树数据结构。基于调用树数据结构生成自定义运行时库。自定义运行时库仅包含运行时库函数的一部分，小于应用程序编程接口的运行时库函数的总数或感兴趣的编程标准，实际上由代码区域调用，并且不包括所有运行时库函数用于应用程序编程接口的运行时库函数的总数或感兴趣的编程标准。

5. 发明申请

US20120246654A1 Constant Time Worker Thread Allocation Via Configuration Caching 有权
标题翻译：通过配置缓存来定时工作线程分配
公开(公告)号：US20120246654A1
公开(公告)日：2012-09-27
申请号：US13070811
申请日：2011-03-24
申请人： Alexandre E. Eichenberger , John K.P. O'Brien
发明人： Alexandre E. Eichenberger , John K.P. O'Brien
IPC分类号： G06F9/46
CPC分类号： G06F9/5066
摘要： Mechanisms are provided for allocating threads for execution of a parallel region of code. A request for allocation of worker threads to execute the parallel region of code is received from a master thread. Cached thread allocation information identifying prior thread allocations that have been performed for the master thread are accessed. Worker threads are allocated to the master thread based on the cached thread allocation information. The parallel region of code is executed using the allocated worker threads.
摘要翻译：提供了用于分配用于执行并行区域代码的线程的机制。从主线程接收到用于分配工作线程以执行代码并行区域的请求。识别为主线程执行的先前线程分配的缓存线程分配信息被访问。工作线程基于缓存的线程分配信息分配给主线程。使用分配的工作线程来执行代码的并行区域。

6. 发明申请

US20090083702A1 System and Method for Selective Code Generation Optimization for an Advanced Dual-Representation Polyhedral Loop Transformation Framework 失效
标题翻译：用于高级双表示多面体环转换框架的选择性代码生成优化的系统和方法
公开(公告)号：US20090083702A1
公开(公告)日：2009-03-26
申请号：US11861493
申请日：2007-09-26
申请人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Nicolas T. Vasilache
发明人： Alexandre E. Eichenberger , John K.P. O'Brien , Kathryn M. O'Brien , Nicolas T. Vasilache
IPC分类号： G06F9/44
CPC分类号： G06F8/4452
摘要： A system and method for selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.
摘要翻译：提供了一种用于高级双表示多面体环转换框架的选择性代码生成优化的系统和方法。说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。这些代码生成转换具有重要的属性，它们不改变中间表示中的语句的程序顺序。该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制，用于附加优化。

7. 发明授权

US08584103B2 Reducing parallelism of computer source code 有权
标题翻译：减少计算机源代码的并行性
公开(公告)号：US08584103B2
公开(公告)日：2013-11-12
申请号：US12817999
申请日：2010-06-17
申请人： Uday Kumar Bondhugula , Alexandre E. Eichenberger , John Kevin P. O'Brien , Lakshminarayanan Renganarayana , Yuan Zhao
发明人： Uday Kumar Bondhugula , Alexandre E. Eichenberger , John Kevin P. O'Brien , Lakshminarayanan Renganarayana , Yuan Zhao
IPC分类号： G06F9/44 , G06F9/45 , G06F9/46
CPC分类号： G06F8/443 , G06F8/51
摘要： An example embodiment disclosed is a method for reducing parallelism of computer source code. The method includes receiving multi-threaded program source code and representing the multi-threaded program source code as a polyhedral framework stored in computer readable memory. The polyhedral framework is used to convert the polyhedral framework from the multi-threaded program source code representation to a single-threaded program source code representation.
摘要翻译：所公开的示例性实施例是用于减少计算机源代码的并行性的方法。该方法包括接收多线程程序源代码并将多线程程序源代码表示为存储在计算机可读存储器中的多面体框架。多面体框架用于将多面体框架从多线程程序源代码表示转换为单线程程序源代码表示。

8. 发明申请

US20110314442A1 REDUCING PARALLELISM OF COMPUTER SOURCE CODE 有权
标题翻译：减少计算机源代码并行计算
公开(公告)号：US20110314442A1
公开(公告)日：2011-12-22
申请号：US12817999
申请日：2010-06-17
申请人： Uday Kumar Bondhugula , Alexandre E. Eichenberger , John Kevin P. O'Brien , Lakshminarayanan Renganarayana , Yuan Zhao
发明人： Uday Kumar Bondhugula , Alexandre E. Eichenberger , John Kevin P. O'Brien , Lakshminarayanan Renganarayana , Yuan Zhao
IPC分类号： G06F9/44
CPC分类号： G06F8/443 , G06F8/51
摘要： An example embodiment disclosed is a method for reducing parallelism of computer source code. The method includes receiving multi-threaded program source code and representing the multi-threaded program source code as a polyhedral framework stored in computer readable memory. The polyhedral framework is used to convert the polyhedral framework from the multi-threaded program source code representation to a single-threaded program source code representation.
摘要翻译：所公开的示例性实施例是用于减少计算机源代码的并行性的方法。该方法包括接收多线程程序源代码并将多线程程序源代码表示为存储在计算机可读存储器中的多面体框架。多面体框架用于将多面体框架从多线程程序源代码表示转换为单线程程序源代码表示。

9. 发明授权

US09223580B2 Systems, methods and computer products for cross-thread scheduling 有权
标题翻译：用于跨线程调度的系统，方法和计算机产品
公开(公告)号：US09223580B2
公开(公告)日：2015-12-29
申请号：US11847556
申请日：2007-08-30
申请人： Alexandre E. Eichenberger , Michael K. Gschwind , John A Gunnels , James L. McInnes , Mark P. Mendell
发明人： Alexandre E. Eichenberger , Michael K. Gschwind , John A Gunnels , James L. McInnes , Mark P. Mendell
IPC分类号： G06F9/455 , G06F9/46 , G06F9/38 , G06F9/45
CPC分类号： G06F9/3851 , G06F8/445 , G06F9/3885
摘要： Systems, methods and computer products for cross-thread scheduling. Exemplary embodiments include a cross thread scheduling method for compiling code, the method including scheduling a scheduling unit with a scheduler sub-operation in response to the scheduling unit being in a non-multithreaded part of the code and scheduling the scheduling unit with a cross-thread scheduler sub-operation in response to the scheduling unit being in a multithreaded part of the code.
摘要翻译：用于跨线程调度的系统，方法和计算机产品。示例性实施例包括用于编译代码的交叉线程调度方法，所述方法包括：响应于所述调度单元处于所述代码的非多线程部分中的调度器子操作来调度调度单元，并且调度所述调度单元，响应于调度单元处于代码的多线程部分中的线程调度器子操作。

10. 发明授权

US08954943B2 Analyze and reduce number of data reordering operations in SIMD code 有权
标题翻译：分析和减少SIMD代码中数据重排序的数量
公开(公告)号：US08954943B2
公开(公告)日：2015-02-10
申请号：US11340452
申请日：2006-01-26
申请人： Alexandre E. Eichenberger , Kai-Ting Amy Wang , Peng Wu , Peng Zhao
发明人： Alexandre E. Eichenberger , Kai-Ting Amy Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/45 , G06F15/00 , G06F15/76
CPC分类号： G06F8/443
摘要： A method for analyzing data reordering operations in Single Issue Multiple Data source code and generating executable code therefrom is provided. Input is received. One or more data reordering operations in the input are identified and each data reordering operation in the input is abstracted into a corresponding virtual shuffle operation so that each virtual shuffle operation forms part of an expression tree. One or more virtual shuffle trees are collapsed by combining virtual shuffle operations within at least one of the one or more virtual shuffle trees to form one or more combined virtual shuffle operations, wherein each virtual shuffle tree is a subtree of the expression tree that only contains virtual shuffle operations. Then code is generated for the one or more combined virtual shuffle operations.
摘要翻译：提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。收到输入。识别输入中的一个或多个数据重排序操作，并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作，使得每个虚拟随机播放操作形成表达式树的一部分。通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树，其中每个虚拟随机播放树是仅包含表达式树的子树虚拟随机操作。然后为一个或多个组合的虚拟随机操作生成代码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式