中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

26 records (took 0.016 seconds)

    Mechanism to increase data compression in a cache
    11.
    发明申请
    Mechanism to increase data compression in a cache 审中-公开
    增加缓存中数据压缩的机制

    公开(公告)号：US20050071566A1

    公开(公告)日：2005-03-31

    申请号：US10676478

    申请日：2003-09-30

    Applicant: Ali-Reza Adl-Tabatabai ,  Anwar Ghuloum ,  Eric Sprangle

    Inventor： Ali-Reza Adl-Tabatabai ,  Anwar Ghuloum ,  Eric Sprangle

    IPC: G06F12/08 ,  G06F12/00

    CPC classification number: G06F12/0886 ,  G06F2212/401

    Abstract: According to one embodiment a computer system is disclosed. The computer system includes a central processing unit (CPU) and a cache memory coupled to the CPU. The cache memory includes a main cache having plurality of compressible cache lines to store additional data, and a plurality of storage pools to hold a segment of the additional data for one or more of the plurality of cache lines that are to be compressed.

    Abstract translation: 根据一个实施例，公开了一种计算机系统。 计算机系统包括中央处理单元（CPU）和耦合到CPU的高速缓冲存储器。 高速缓冲存储器包括具有多个可压缩高速缓存行以存储附加数据的主高速缓存，以及多个存储池，用于保存要被压缩的多个高速缓存行中的一个或多个的附加数据的段。

    Mechanism to include hints within compressed data
    16.
    发明申请
    Mechanism to include hints within compressed data 失效
    在压缩数据中包含提示的机制

    公开(公告)号：US20050144387A1

    公开(公告)日：2005-06-30

    申请号：US10747474

    申请日：2003-12-29

    Applicant: Ali-Reza Adl-Tabatabai ,  Anwar Ghuloum

    Inventor： Ali-Reza Adl-Tabatabai ,  Anwar Ghuloum

    IPC: G06F12/08 ,  G06F12/12 ,  G06F12/00

    CPC classification number: G06F12/0862 ,  G06F12/121 ,  G06F2212/401 ,  G06F2212/6028 ,  Y02D10/13

    Abstract: According to one embodiment a computer system is disclosed. The computer system includes a central processing unit (CPU), a cache memory coupled to the CPU and a cache controller coupled to the cache memory. The cache memory includes a plurality of compressible cache lines to store additional data. The cache controller includes compression logic to compress one or more of the plurality of cache lines into compressed cache lines, and hint logic to store hint information in unused space within the compressed cache lines.

    Abstract translation: 根据一个实施例，公开了一种计算机系统。 计算机系统包括中央处理单元（CPU），耦合到CPU的高速缓存存储器和耦合到高速缓冲存储器的高速缓存控制器。 高速缓冲存储器包括多个可压缩的高速缓存线以存储附加数据。 高速缓存控制器包括将多个高速缓存线中的一个或多个压缩成压缩高速缓存线的压缩逻辑，以及提示逻辑，用于将提示信息存储在压缩高速缓存行内的未使用空间中。

    Future scheduling by direct representation of possible dependencies
    18.
    发明授权
    Future scheduling by direct representation of possible dependencies 有权
    通过直接表示可能依赖的未来调度

    公开(公告)号：US08225326B2

    公开(公告)日：2012-07-17

    申请号：US12049914

    申请日：2008-03-17

    Applicant: Leaf Petersen ,  Anwar Ghuloum ,  Mohan Rajagopalan

    Inventor： Leaf Petersen ,  Anwar Ghuloum ,  Mohan Rajagopalan

    IPC: G06F9/46 ,  G06F9/52

    CPC classification number: G06F9/524

    Abstract: A method for evaluating objects in a data structure is provided. The method includes assigning one or more objects to one or more nodes in a data structure having at least a root node, in which the objects are assigned to the nodes in accordance with a first order to maintain pre-existing dependencies between the objects and to allow the objects to be evaluated in a serial manner to avoid deadlock when concurrently executing threads to evaluate the objects, and selecting a first object for evaluation, in response to determining that the current object is unevaluated.

    Abstract translation: 提供了一种用于评估数据结构中的对象的方法。 该方法包括将一个或多个对象分配给具有至少根节点的数据结构中的一个或多个节点，其中根据第一顺序将对象分配给节点，以保持对象之间的预先存在的依赖关系，以及 允许以串行方式评估对象，以在同时执行线程以评估对象时选择第一对象以进行评估，以响应于确定当前对象未被评估而避免死锁。

    Concurrent management of adaptive programs
    19.
    发明授权
    Concurrent management of adaptive programs 有权
    并发管理适应性方案

    公开(公告)号：US08627301B2

    公开(公告)日：2014-01-07

    申请号：US11750441

    申请日：2007-05-18

    Applicant: Matthew Hammer ,  Mohan Rajagopalan ,  Anwar Ghuloum

    Inventor： Matthew Hammer ,  Mohan Rajagopalan ,  Anwar Ghuloum

    IPC: G06F9/44 ,  G06F9/45

    CPC classification number: G06F9/5066

    Abstract: A method for concurrent management of adaptive programs is disclosed wherein changes in a set of modifiable references are initially identified. A list of uses of the changed references is next computed using records made in structures of the references. The list is next inserted into an elimination queue. Comparison is next made of each of the uses to the other uses to determine independence or dependence thereon. Determined dependent uses are eliminated and the preceding steps are repeated for all determined independent uses until all dependencies have been eliminated.

    Abstract translation: 公开了一种用于并行管理自适应程序的方法，其中初始地识别一组可修改参考文献中的改变。 接下来使用在引用的结构中作出的记录来计算更改的引用的使用列表。 列表接下来插入消除队列。 下一步将对其他用途的各种用途进行比较，以确定其独立性或依赖性。 消除确定的依赖用途，并且对于所有确定的独立使用重复前述步骤，直到所有依赖关系被消除。

    FUTURE SCHEDULING BY DIRECT REPRESENTATION OF POSSIBLE DEPENDENCIES
    20.
    发明申请
    FUTURE SCHEDULING BY DIRECT REPRESENTATION OF POSSIBLE DEPENDENCIES 有权
    未来可能直接表示可能的依赖性

    公开(公告)号：US20090235273A1

    公开(公告)日：2009-09-17

    申请号：US12049914

    申请日：2008-03-17

    Applicant: Leaf Petersen ,  Anwar Ghuloum ,  Mohan Rajagopalan

    Inventor： Leaf Petersen ,  Anwar Ghuloum ,  Mohan Rajagopalan

    IPC: G06F9/46

    CPC classification number: G06F9/524

    Abstract: A method for evaluating objects in a data structure is provided. The method comprises assigning one or more objects to one or more nodes in a data structure having at least a root node, wherein the objects are assigned to the nodes in accordance with a first order to maintain pre-existing dependencies between said objects and to allow the objects to be evaluated in a serial manner to avoid deadlock when concurrently executing threads to evaluate the objects; and selecting a first object for evaluation, in response to determining that the current object is unevaluated.

    Abstract translation: 提供了一种用于评估数据结构中的对象的方法。 该方法包括将一个或多个对象分配给具有至少根节点的数据结构中的一个或多个节点，其中根据第一顺序将对象分配给节点，以维持所述对象之间的预先存在的依赖关系并允许 要以串行方式评估的对象，以在同时执行线程来评估对象时避免死锁; 以及响应于确定当前对象未被评估，选择用于评估的第一对象。

Patent Agency Ranking