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

1. 发明授权

US08818787B2 Method and system for predicting performance of software applications on prospective hardware architecture 有权
标题翻译：用于预测软件应用程序在预期硬件架构上的性能的方法和系统
公开(公告)号：US08818787B2
公开(公告)日：2014-08-26
申请号：US13018243
申请日：2011-01-31
申请人： Arun Kejariwal , Paolo D'Alberto , Sapan Panigrahi , Rosario Cammarota
发明人： Arun Kejariwal , Paolo D'Alberto , Sapan Panigrahi , Rosario Cammarota
IPC分类号： G06F9/45 , G06F9/44
CPC分类号： G06F11/3447 , G06F11/3409 , G06F11/3419 , G06F11/3442 , G06F11/3466 , G06F2201/81 , G06F2201/83 , G06F2201/86 , G06F2201/865 , G06F2201/88
摘要： A system and method for identifying optimal system architectures for a reference application are provided. The system and method comprise executing a reference application and a plurality of test applications on a current system architecture and sampling performance data for each of the applications. The performance data is used to compute an application signature for each application. A similarity element is derived from the application signatures that illustrates the similarity between each application and every other application. Using a similarity threshold and an algorithm, a subset of test applications that are similar to the reference application are derived.
摘要翻译：提供了一种用于识别参考应用的最佳系统架构的系统和方法。该系统和方法包括在当前系统架构上执行参考应用和多个测试应用，并针对每个应用采样性能数据。性能数据用于计算每个应用程序的应用程序签名。相似性元素从应用程序签名中得出，该签名说明了每个应用程序和每个其他应用程序之间的相似性。使用相似性阈值和算法，推导出与参考应用程序相似的测试应用程序子集。

2. 发明授权

US08856767B2 System and method for analyzing dynamic performance of complex applications 有权
标题翻译：用于分析复杂应用的动态性能的系统和方法
公开(公告)号：US08856767B2
公开(公告)日：2014-10-07
申请号：US13097446
申请日：2011-04-29
申请人： Rohit Jalan , Arun Kejariwal
发明人： Rohit Jalan , Arun Kejariwal
IPC分类号： G06F9/45
CPC分类号： G06F11/3466 , G06F11/3419 , G06F2201/81 , G06F2201/865 , G06F2201/88
摘要： A system and method for monitoring the performance and execution flow of a target application and generating a corresponding data model are provided. The system and method comprise attaching to a thread or process of a target application and tracking the execution of subroutines using instrumentation commands. Data representing the execution flow of the various subroutines, subroutine calls, and their performance is gathered and used to generate data models representing the threads and processes of the application. The data models are optionally merged and/or pruned. A visualization of the data models is generated indicating relevant points of interest within the target application's execution flow.
摘要翻译：提供了一种用于监视目标应用程序的性能和执行流程并生成相应数据模型的系统和方法。系统和方法包括附加到目标应用程序的线程或进程，并使用仪器命令跟踪子程序的执行。收集表示各种子程序，子程序调用及其性能的执行流程的数据，并用于生成表示应用程序的线程和进程的数据模型。数据模型可选地合并和/或修剪。生成数据模型的可视化，指示目标应用程序的执行流程中的相关兴趣点。

3. 发明授权

US08458170B2 Prefetching data for document ranking 有权
标题翻译：预取文档排名数据
公开(公告)号：US08458170B2
公开(公告)日：2013-06-04
申请号：US12165307
申请日：2008-06-30
申请人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
发明人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： The subject matter disclosed herein relates to prefetching data for use in ranking of electronic documents via a document ranking component.
摘要翻译：本文公开的主题涉及经由文档排序组件预取用于电子文档排名的数据。

4. 发明申请

US20100070457A1 Efficient Data Layout Techniques for Fast Machine Learning-Based Document Ranking 有权
标题翻译：基于快速机器学习的文档排序的高效数据布局技术
公开(公告)号：US20100070457A1
公开(公告)日：2010-03-18
申请号：US12211636
申请日：2008-09-16
申请人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
发明人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
IPC分类号： G06N5/02
CPC分类号： G06N99/005
摘要： A computer readable medium stores a program for optimization for a search, and has sets of instructions for receiving a first decision tree. The first decision tree includes several nodes, and each node is for comparing a feature value to a threshold value. The instructions are for weighting the nodes within the first decision tree, determining the weighted frequency of a first feature within the first decision tree, and determining the weighted frequency of a second feature within the first decision tree. The instructions order the features based on the determined weighted frequencies, and store the ordering such that values of features having higher weighted frequencies are retrieved more often than values of features having lower weighted frequencies within the first decision tree.
摘要翻译：计算机可读介质存储用于搜索的优化的程序，并且具有用于接收第一决策树的指令集。第一决策树包括几个节点，每个节点用于将特征值与阈值进行比较。所述指令用于对第一决策树内的节点进行加权，确定第一决策树内的第一特征的加权频率，以及确定第一决策树内的第二特征的加权频率。指令基于确定的加权频率对特征进行排序，并存储排序，使得具有较高加权频率的特征值比第一决策树中具有较低加权频率的特征的值更频繁地检索。

5. 发明授权

US08621424B2 Compiler based code modification for use in document ranking 有权
标题翻译：基于编译器的代码修改用于文档排名
公开(公告)号：US08621424B2
公开(公告)日：2013-12-31
申请号：US12165457
申请日：2008-06-30
申请人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
发明人： Arun Kejariwal , Girish Vaitheeswaran , Sapan Panigrahi
IPC分类号： G06F9/44 , G06F9/45 , G06F13/00
CPC分类号： G06F8/41 , G06F9/3004 , G06F9/30072 , G06F9/30087 , G06F17/30864
摘要： The subject matter disclosed herein relates to alter an expression of executable instructions via a compiler component for use in ranking of electronic documents.
摘要翻译：本文公开的主题涉及通过用于电子文档排名的编译器组件来改变可执行指令的表达。

6. 发明申请

US20100205183A1 METHOD AND SYSTEM FOR PERFORMING SELECTIVE DECODING OF SEARCH RESULT MESSAGES 审中-公开
标题翻译：执行搜索结果信息的选择性解码的方法和系统
公开(公告)号：US20100205183A1
公开(公告)日：2010-08-12
申请号：US12370278
申请日：2009-02-12
申请人： Scott Banachowski , Swee Lim , Ki Moon Kim , Arun Kejariwal
发明人： Scott Banachowski , Swee Lim , Ki Moon Kim , Arun Kejariwal
IPC分类号： G06F17/30
CPC分类号： G06F16/951
摘要： Methods and systems are provided that may be used to selectively decode results in messages received from child nodes for a particular search query.
摘要翻译：提供了可用于选择性地解码针对特定搜索查询从子节点接收的消息中的结果的方法和系统。

7. 发明申请

US20100023474A1 Decision Tree Coalescing for Document Ranking 有权
标题翻译：决策树合并文件排名
公开(公告)号：US20100023474A1
公开(公告)日：2010-01-28
申请号：US12178483
申请日：2008-07-23
申请人： Arun Kejariwal , Sapan Panigrahi , Girish Vaitheeswaran
发明人： Arun Kejariwal , Sapan Panigrahi , Girish Vaitheeswaran
IPC分类号： G06N5/02
CPC分类号： G06F17/30864
摘要： Machine-learned ranking algorithms, e.g. for ranking search results, often use a sequence of decision trees involving decision nodes based on threshold values of features. Modules, systems and methods of optimizing such algorithms involve analyzing threshold feature values to determine threshold intervals for each feature and grouping decision trees according to the feature used in a root decision node. Then coalescing the decision trees within each group to form a coalesced group tree for each group and finally coalescing the coalesced group trees to form a coalesced tree that implements the algorithm.
摘要翻译：机器学习排名算法，例如为了排序搜索结果，经常使用涉及基于特征阈值的决策节点的决策树序列。优化这种算法的模块，系统和方法涉及分析阈值特征值以根据根决策节点中使用的特征来确定每个特征的阈值间隔和分组决策树。然后将每个组中的决策树合并，以形成每个组的合并组树，并最终合并聚合组树以形成实现该算法的合并树。

8. 发明授权

US07571301B2 Fast lock-free post-wait synchronization for exploiting parallelism on multi-core processors 失效
标题翻译：快速无锁后等待同步，以利于多核处理器上的并行性
公开(公告)号：US07571301B2
公开(公告)日：2009-08-04
申请号：US11395841
申请日：2006-03-31
申请人： Arun Kejariwal , Hideki Saito , Xinmin Tian , Milind Girkar , Sanjiv Shah , Wei Li , Utpal Banerjee
发明人： Arun Kejariwal , Hideki Saito , Xinmin Tian , Milind Girkar , Sanjiv Shah , Wei Li , Utpal Banerjee
IPC分类号： G06F9/45 , G06F9/52
CPC分类号： G06F9/3009 , G06F8/458 , G06F9/30087 , G06F9/3836 , G06F9/3838 , G06F9/3851 , G06F9/3855 , G06F9/3857 , G06F9/3891
摘要： A method for improving parallel processing of computer programs. DOACROSS loops and similar code are identified and parallelized using a post-wait control structure. The post-wait control structure may be implemented to include any one of a single counter to enforce an order of execution, an array to track code completion that is indexed by a modulus of a positive integer number, and/or a set of arrays to track a last code completed by a thread and a current code being executed by a thread.
摘要翻译：一种改进计算机程序并行处理的方法。 DOACROSS循环和类似代码使用后等待控制结构进行标识和并行化。后等待控制结构可以被实现为包括执行执行顺序的单个计数器中的任何一个，用于跟踪由正整数的模数索引的代码完成的数组，和/或一组数组跟踪由线程完成的最后一个代码以及由线程执行的当前代码。

9. 发明申请

US20080244549A1 METHOD AND APPARATUS FOR EXPLOITING THREAD-LEVEL PARALLELISM 有权
标题翻译：用于开发螺纹水平并联的方法和装置
公开(公告)号：US20080244549A1
公开(公告)日：2008-10-02
申请号：US11695012
申请日：2007-03-31
申请人： Arun Kejariwal , Xinmin Tian , Wei Li , Milind B. Girkar
发明人： Arun Kejariwal , Xinmin Tian , Wei Li , Milind B. Girkar
IPC分类号： G06F9/45
CPC分类号： G06F8/456
摘要： According to one example embodiment, there is disclosed herein uses partial recurrence relaxation for parallelizing DOACROSS loops on multi-core computer architectures. By one example definition, a DOACROSS may be a loop that allows successive iterations executing by overlapping; that is, all iterations must impose a partial execution order. According to one embodiment, the inventive subject matter may be used to transform the dependence structure of a given loop with recurrences for maximal degree of thread-level parallelism (TLP), where the threads can be mapped on to either different logical processors (in a hyperthreaded processor) or can be mapped onto different physical cores (or processors) in a multi-core processor.
摘要翻译：根据一个示例性实施例，这里公开了在多核计算机体系结构上使用部分递归松弛来并行化DOACROSS循环。通过一个示例定义，DOACROSS可以是允许通过重叠执行连续迭代的循环; 也就是说，所有迭代必须强制执行部分执行顺序。根据一个实施例，本发明的主题可以用于以线程级并行度（TLP）的最大程度的递归来转换给定循环的依赖结构，其中线程可以被映射到不同的逻辑处理器（在超线程处理器）或可以映射到多核处理器中的不同物理核心（或处理器）上。

10. 发明申请

US20070234326A1 Fast lock-free post-wait synchronization for exploiting parallelism on multi-core processors 失效
标题翻译：快速无锁后等待同步，以利于多核处理器上的并行性
公开(公告)号：US20070234326A1
公开(公告)日：2007-10-04
申请号：US11395841
申请日：2006-03-31
申请人： Arun Kejariwal , Hideki Saito , Xinmin Tian , Milind Girkar , Sanjiv Shah , Wei Li , Utpal Banerjee
发明人： Arun Kejariwal , Hideki Saito , Xinmin Tian , Milind Girkar , Sanjiv Shah , Wei Li , Utpal Banerjee
IPC分类号： G06F9/45
CPC分类号： G06F9/3009 , G06F8/458 , G06F9/30087 , G06F9/3836 , G06F9/3838 , G06F9/3851 , G06F9/3855 , G06F9/3857 , G06F9/3891
摘要： A method for improving parallel processing of computer programs. DOACROSS loops and similar code are identified and parallelized using a post-wait control structure. The post-wait control structure may be implemented to include any one of a single counter to enforce an order of execution, an array to track code completion that is indexed by a modulus of a positive integer number, and/or a set of arrays to track a last code completed by a thread and a current code being executed by a thread.
摘要翻译：一种改进计算机程序并行处理的方法。 DOACROSS循环和类似代码使用后等待控制结构进行标识和并行化。后等待控制结构可以被实现为包括执行执行顺序的单个计数器中的任何一个，用于跟踪由正整数的模数索引的代码完成的数组，和/或一组数组跟踪由线程完成的最后一个代码以及由线程执行的当前代码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式