中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

87 records (took 0.019 seconds)

    Method for improving processing of relatively aligned memory references for increased reuse opportunities
    62.
    发明申请
    Method for improving processing of relatively aligned memory references for increased reuse opportunities 审中-公开
    用于改善相对一致的存储器引用的处理以增加再利用机会的方法

    公开(公告)号：US20070226453A1

    公开(公告)日：2007-09-27

    申请号：US11387218

    申请日：2006-03-23

    Applicant: Alexandre Eichenberger ,  Rohini Nair ,  Kai-Ting Wang ,  Peng Wu ,  Peng Zhao

    Inventor： Alexandre Eichenberger ,  Rohini Nair ,  Kai-Ting Wang ,  Peng Wu ,  Peng Zhao

    IPC: G06F15/00

    CPC classification number: G06F9/3885 ,  G06F9/30036 ,  G06F9/345 ,  G06F9/383

    Abstract: 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.

    Abstract translation: 计算机实现的方法，系统和计算机程序产品，用于对齐由SIMD代码处理的向量。 识别在运行时对准并且在编译时具有已知的相对对准的一对向量。 通过将第二存储器引用的地址修改为与第一存储器引用相同的一致类来生成修改的第二存储器引用，其中，同余类是mod V，并且其中V是SIMD字节宽度。 位于修改的第二存储器基准的第一SIMD负载和位于与修改的第二存储器参考地址加V相对应的第三存储器引用的下一相邻SIMD负载被加载，并且第一SIMD负载和下一相邻SIMD负载被级联到 产生长度为2V的合成矢量。 将所得到的矢量移位一个与第一存储器参考和第二存储器参考模V的地址之间的差相对应的量，并且保留所得到的矢量的最左侧的V字节以对齐第一和第二矢量。

    Method to analyze and reduce number of data reordering operations in SIMD code
    63.
    发明申请
    Method to analyze and reduce number of data reordering operations in SIMD code 有权
    在SIMD代码中分析和减少数据重排序操作的方法

    公开(公告)号：US20070192762A1

    公开(公告)日：2007-08-16

    申请号：US11340452

    申请日：2006-01-26

    Applicant: Alexandre Eichenberger ,  Kai-Ting Wang ,  Peng Wu ,  Peng Zhao

    Inventor： Alexandre Eichenberger ,  Kai-Ting Wang ,  Peng Wu ,  Peng Zhao

    IPC: G06F9/45

    CPC classification number: G06F8/443

    Abstract: 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.

    Abstract translation: 提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。 收到输入。 识别输入中的一个或多个数据重排序操作，并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作，使得每个虚拟随机播放操作形成表达式树的一部分。 通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树，其中每个虚拟随机播放树是仅包含表达式树的子树 虚拟随机操作。 然后为一个或多个组合的虚拟随机操作生成代码。

    LATCH MECHANISM
    64.
    发明申请
    LATCH MECHANISM 失效
    锁定机构

    公开(公告)号：US20070188988A1

    公开(公告)日：2007-08-16

    申请号：US11309797

    申请日：2006-09-28

    Applicant: Peng Zhao ,  Chun-Chi Liang ,  Chien-Li Tsai ,  Ke-Cheng Lin ,  Hsuan-Chen Chen

    Inventor： Peng Zhao ,  Chun-Chi Liang ,  Chien-Li Tsai ,  Ke-Cheng Lin ,  Hsuan-Chen Chen

    IPC: G06F1/16

    CPC classification number: G06F1/1679 ,  G06F1/1616 ,  Y10T292/0848

    Abstract: A latch mechanism includes a latching member, a button, and an elastic member for restoring the latching member. The latching member is rotatably installed in a cover unit. The latching member includes a latching portion for engaging with a base unit. The button is movably fixed to the cover unit. The button includes a slanted pushing portion for driving the latching member to rotate for disengaging the latching portion from the base unit.

    Abstract translation: 闩锁机构包括闩锁构件，按钮和用于恢复闩锁构件的弹性构件。 闩锁构件可旋转地安装在盖单元中。 闩锁构件包括用于与基座单元接合的闩锁部分。 按钮可移动地固定到盖单元。 按钮包括用于驱动闩锁构件旋转的倾斜推动部分，用于使闩锁部分与基部单元脱离接合。

    Method and system for versioning codes based on relative alignment for single instruction multiple data units
    65.
    发明申请
    Method and system for versioning codes based on relative alignment for single instruction multiple data units 失效
    基于单指令多数据单元相对对齐的版本编码方法和系统

    公开(公告)号：US20070169058A1

    公开(公告)日：2007-07-19

    申请号：US11333614

    申请日：2006-01-17

    Applicant: Alexandre Eichenberger ,  Amy Wang ,  Peng Wu ,  Peng Zhao

    Inventor： Alexandre Eichenberger ,  Amy Wang ,  Peng Wu ,  Peng Zhao

    IPC: G06F9/45

    CPC classification number: G06F8/49

    Abstract: 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.

    Abstract translation: 一种用于为存储器系统具有对准约束的单指令多数据单元生成有效版本代码的方法和系统。 该系统基于计算中涉及的数据流的相对对齐来创建多个版本的代码。 该系统还分析相对比对的特征（例如编译时或运行时间），以确定代码版本化是否基于成本模型是有益的。

    Non-stale incremental planning
    67.
    发明申请
    Non-stale incremental planning 审中-公开
    非陈旧增量计划

    公开(公告)号：US20060010020A1

    公开(公告)日：2006-01-12

    申请号：US10887468

    申请日：2004-07-08

    Applicant: Ranjit Notani ,  Peng Zhao ,  Mark Whipple ,  Ken McAloon

    Inventor： Ranjit Notani ,  Peng Zhao ,  Mark Whipple ,  Ken McAloon

    IPC: G06Q99/00

    CPC classification number: G06Q10/087 ,  G06Q10/0631

    Abstract: 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.

    Abstract translation: 本发明的示例性方法和系统包括使用最新的最新数据来重新计划价值链的价值链管理程序。 本发明的价值链管理程序是事件驱动的解决方案，每当发生价值链的状态变化或发生异常时，更新价值链中的数据，导致最近使用的数据。 此外，价值链管理程序只能识别和处理受状态变化影响的价值链部分，或者异常而不是整个价值链，从而大大减少处理时间。 然后，价值链管理程序使用最新的价值链数据来确定是否需要对价值链计划的受影响部分进行任何更改。

Patent Agency Ranking