会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明申请
    • Method for improving processing of relatively aligned memory references for increased reuse opportunities
    • 用于改善相对一致的存储器引用的处理以增加再利用机会的方法
    • US20070226453A1
    • 2007-09-27
    • US11387218
    • 2006-03-23
    • Alexandre EichenbergerRohini NairKai-Ting WangPeng WuPeng Zhao
    • Alexandre EichenbergerRohini NairKai-Ting WangPeng WuPeng Zhao
    • G06F15/00
    • G06F9/3885G06F9/30036G06F9/345G06F9/383
    • Computer implemented method, system and computer program product for aligning vectors to be processed by SIMD code. A pair of vectors to be aligned at runtime and having a known relative alignment at compile time is identified. A modified second memory reference is generated by modifying an address of the second memory reference to be in a same congruence class as the first memory reference, wherein the congruence class is mod V and wherein V is SIMD byte width. A first SIMD load located at the modified second memory reference and a next adjacent SIMD load located at a third memory reference corresponding to the modified second memory reference address plus V are loaded, and the first SIMD load and the next adjacent SIMD load are concatenated to generate a resultant vector of length 2V. The resultant vector is left shifted by an amount corresponding to a difference between the addresses of the first memory reference and the second memory reference mod V, and the leftmost V bytes of the resultant vector are retained to align the first and second vectors.
    • 计算机实现的方法,系统和计算机程序产品,用于对齐由SIMD代码处理的向量。 识别在运行时对准并且在编译时具有已知的相对对准的一对向量。 通过将第二存储器引用的地址修改为与第一存储器引用相同的一致类来生成修改的第二存储器引用,其中,同余类是mod V,并且其中V是SIMD字节宽度。 位于修改的第二存储器基准的第一SIMD负载和位于与修改的第二存储器参考地址加V相对应的第三存储器引用的下一相邻SIMD负载被加载,并且第一SIMD负载和下一相邻SIMD负载被级联到 产生长度为2V的合成矢量。 将所得到的矢量移位一个与第一存储器参考和第二存储器参考模V的地址之间的差相对应的量,并且保留所得到的矢量的最左侧的V字节以对齐第一和第二矢量。
    • 53. 发明申请
    • Method to analyze and reduce number of data reordering operations in SIMD code
    • 在SIMD代码中分析和减少数据重排序操作的方法
    • US20070192762A1
    • 2007-08-16
    • US11340452
    • 2006-01-26
    • Alexandre EichenbergerKai-Ting WangPeng WuPeng Zhao
    • Alexandre EichenbergerKai-Ting WangPeng WuPeng Zhao
    • G06F9/45
    • 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.
    • 提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。 收到输入。 识别输入中的一个或多个数据重排序操作,并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作,使得每个虚拟随机播放操作形成表达式树的一部分。 通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树,其中每个虚拟随机播放树是仅包含表达式树的子树 虚拟随机操作。 然后为一个或多个组合的虚拟随机操作生成代码。
    • 57. 发明申请
    • Non-stale incremental planning
    • 非陈旧增量计划
    • US20060010020A1
    • 2006-01-12
    • US10887468
    • 2004-07-08
    • Ranjit NotaniPeng ZhaoMark WhippleKen McAloon
    • Ranjit NotaniPeng ZhaoMark WhippleKen McAloon
    • G06Q99/00
    • G06Q10/087G06Q10/0631
    • Exemplary methods and systems of the invention include a value chain management program that uses the most current, up-to-date data to re-plan a value chain. The value chain management program of the invention is an event-driven solution that updates the data in the value chain whenever a change in state of the value chain occurs or an exception occurs, resulting in the most recent data being used. Moreover, the value chain management program is able to identify and process only the portion of the value chain that is affected by the state change, or the exception instead of the entire value chain, thereby reducing processing time tremendously. The value chain management program then uses the up-to-date value chain data to determine whether any changes are needed to the affected portion of the value chain plan.
    • 本发明的示例性方法和系统包括使用最新的最新数据来重新计划价值链的价值链管理程序。 本发明的价值链管理程序是事件驱动的解决方案,每当发生价值链的状态变化或发生异常时,更新价值链中的数据,导致最近使用的数据。 此外,价值链管理程序只能识别和处理受状态变化影响的价值链部分,或者异常而不是整个价值链,从而大大减少处理时间。 然后,价值链管理程序使用最新的价值链数据来确定是否需要对价值链计划的受影响部分进行任何更改。
    • 60. 发明授权
    • Procedure control descriptor-based code specialization for context sensitive memory disambiguation
    • 过程控制描述符代码专用于上下文敏感内存消歧
    • US08332833B2
    • 2012-12-11
    • US11757941
    • 2007-06-04
    • Roch Georges ArchambaultShimin CuiYaoqing GaoRaul Esteban SilveraPeng Zhao
    • Roch Georges ArchambaultShimin CuiYaoqing GaoRaul Esteban SilveraPeng Zhao
    • G06F9/45
    • G06F8/4441
    • A computer implemented method for facilitating debugging of source code. The source code is scanned to identify a candidate region. A procedure control descriptor is generated, wherein the procedure control descriptor corresponds to the candidate region. The procedure control descriptor identifies, for the candidate region, a condition which, if true at runtime means that the candidate region can be specialized. Responsive to a determination during compile time that satisfaction of at least one condition will be known only at runtime, the procedure control descriptor is used to specialize the candidate region at compile time to create a first version of the candidate region for execution in a case where the condition is true and a second version of the candidate region for execution in a case where the condition is false, and further generate code to correctly select one of the first region and the second region at runtime.
    • 一种用于促进源代码调试的计算机实现方法。 扫描源代码以识别候选区域。 生成过程控制描述符,其中过程控制描述符对应于候选区域。 程序控制描述符为候选区域识别条件,其在运行时为真,意味着候选区域可以是专门的。 在编译期间响应于在运行时仅满足至少一个条件的确定,过程控制描述符用于在编译时专门化候选区域,以在第一版本的候选区域中创建用于执行的候选区域, 条件为真,并且在条件为假的情况下用于执行的候选区域的第二版本,并且还在生成期间生成正确选择第一区域和第二区域中的一个的代码。