INVALIDATING ENTRIES IN A NON-COHERENT CACHE
    11.
    发明申请
    INVALIDATING ENTRIES IN A NON-COHERENT CACHE 审中-公开
    在非相干缓存中隐藏入侵

    公开(公告)号:US20140258635A1

    公开(公告)日:2014-09-11

    申请号:US13791847

    申请日:2013-03-08

    CPC classification number: G06F12/0808 G06F12/0891 Y02D10/13

    Abstract: Techniques are provided for performing an invalidate operation in a non-coherent cache. In response to receiving an invalidate instruction, a cache unit only invalidates cache entries that are associated with invalidation data. In this way, a separate invalidate instruction is not required for each cache entry that is to be invalidated. Also, cache entries that are not to be invalidated remain unaffected by the invalidate operation. A cache entry may be associated with invalidation data if an address of the corresponding data item is in a particular set of addresses. The particular set of addresses may have been specified as a result of an invalidation instruction specified in code that is executing on a processor that is coupled to the cache.

    Abstract translation: 提供了用于在非相干高速缓存中执行无效操作的技术。 响应于接收到无效指令,高速缓存单元仅使与无效数据相关联的高速缓存条目失效。 以这种方式,对于要被无效的每个缓存条目,不需要单独的无效指令。 此外,不被无效的缓存条目不会被无效操作影响。 如果对应的数据项的地址在特定的一组地址中,则缓存条目可以与无效数据相关联。 作为在耦合到高速缓存的处理器上执行的代码中指定的无效指令的结果可以指定特定的地址集合。

    Flushing by copying entries in a non-coherent cache to main memory

    公开(公告)号:US10509725B2

    公开(公告)日:2019-12-17

    申请号:US13791863

    申请日:2013-03-08

    Abstract: Techniques are provided for performing a flush operation in a non-coherent cache. In response to determining to perform a flush operation, a cache unit flushes certain data items. The flush operation may be performed in response to a lapse of a particular amount of time, such as a number of cycles, or an explicit flush instruction that does not indicate any cache entry or data item. The cache unit may store change data that indicates which entry stores a data item that has been modified but not yet been flushed. The change data may be used to identify the entries that need to be flushed. In one technique, a dirty cache entry that is associated with one or more relatively recent changes is not flushed during a flush operation.

    Pluggable session context
    15.
    发明授权

    公开(公告)号:US09495394B2

    公开(公告)日:2016-11-15

    申请号:US14014302

    申请日:2013-08-29

    CPC classification number: G06F17/30289 G06F17/3056

    Abstract: A method and apparatus are described for sharing a session to access a database. A database server receives, in a session, a session context identifier and a command. The session context identifier identifies a session context to use for the session. The session context is a set of information or commands that plug into a session state and specify how commands in the session are to be performed for a particular user or privilege level. In response to receiving the identifier, the database server associates the session context with the database session for the connection. The database server uses the session context to process the command. The session context may then be detached from the session, allowing another user to attach to the session via another session context.

    UNIFYING STATIC AND DYNAMIC COMPILER OPTIMIZATIONS IN SOURCE-CODE BASES
    16.
    发明申请
    UNIFYING STATIC AND DYNAMIC COMPILER OPTIMIZATIONS IN SOURCE-CODE BASES 有权
    源代码基础中的统一静态和动态编译器优化

    公开(公告)号:US20150128115A1

    公开(公告)日:2015-05-07

    申请号:US14594954

    申请日:2015-01-12

    Abstract: Techniques are described for unifying static and dynamic compiler optimizations in source code bases. In an embodiment, a first compiler compiles source code of a target function to generate ahead-of-time (AOT) compiled machine code. A second compiler compiles the source code to generate an intermediate representation (IR) of the target function. In response to determining that the target function should be just-in-time (JIT) compiled, the AOT-compiled machine code for the target function is linked to the IR of the target function. During runtime, a physical processor executes AOT-compiled machine code of an executable program. When the target function is encountered for the first time, a JIT compiler is invoked. The JIT compiler generates JIT-compiled machine code for the target function. The physical processor executes the JIT-compiled machine code in place of the AOT-compiled machine code for the target function.

    Abstract translation: 描述了在源代码库中统一静态和动态编译器优化的技术。 在一个实施例中,第一编译器编译目标函数的源代码以生成预先(AOT)编译的机器码。 第二个编译器编译源代码以生成目标函数的中间表示(IR)。 响应于确定目标函数应该是即时编译(JIT),目标函数的AOT编译机器代码链接到目标函数的IR。 在运行时,物理处理器执行AOT编译的可执行程序的机器代码。 当第一次遇到目标函数时,将调用JIT编译器。 JIT编译器为目标函数生成JIT编译的机器代码。 物理处理器执行JIT编译的机器代码,代替目标函数的AOT编译机器代码。

    System for applying transformation to improve graph analysis
    17.
    发明授权
    System for applying transformation to improve graph analysis 有权
    用于转换以改进图形分析的系统

    公开(公告)号:US08910134B2

    公开(公告)日:2014-12-09

    申请号:US13733424

    申请日:2013-01-03

    CPC classification number: G06F8/443

    Abstract: A method for performing a neighbor-flipping transformation is provided. In one embodiment, a graph analysis program for computing a function relating to nodes in a directed graph is obtained and analyzed for neighborhood iterating operations, in which a function is computed over sets of nodes in the graph. For any detected neighborhood iterating operation, the method transforms the iterating operation by reversing the neighbor node relationship between the nodes in the operation. The transformed operation computes the same value for the function as the operation prior to transformation. The method alters the neighbor node relationship automatically, so that a user does not have to recode the graph analysis program. In some cases, the method includes construction of edges in the reverse direction while retaining the original edges in addition to performing the transformation.

    Abstract translation: 提供了一种执行相邻翻转变换的方法。 在一个实施例中,获得用于计算与有向图中的节点有关的功能的图分析程序,并对其进行邻域迭代操作进行分析,其中在图中的节点集合上计算函数。 对于任何检测到的邻域迭代操作,该方法通过在操作中颠倒节点之间的邻居节点关系来转换迭代操作。 转换的操作计算与变换之前的操作相同的函数值。 该方法自动更改邻居节点关系,使用户不必重新编码图形分析程序。 在某些情况下,除了执行变换之外,该方法还包括沿相反方向构造边缘,同时保留原始边缘。

    Efficient pushdown of joins in a heterogeneous database system involving a large-scale low-power cluster
    18.
    发明授权
    Efficient pushdown of joins in a heterogeneous database system involving a large-scale low-power cluster 有权
    在涉及大规模低功率集群的异构数据库系统中有效的下联连接

    公开(公告)号:US08849871B2

    公开(公告)日:2014-09-30

    申请号:US13645030

    申请日:2012-10-04

    CPC classification number: G06F17/30289 G06F17/30498 G06F17/30598

    Abstract: A system and method for allocating join processing between and RDBMS and an assisting cluster. In one embodiment, the method estimates a cost of performing the join completely in the RDBMS and the cost of performing the join with the assistance of a cluster coupled to the RDBMS. The cost of performing the join with the assistance of the cluster includes estimating a cost of a broadcast join or a partition join depending on the sizes of the tables. Additional costs are incurred when there is a blocking operation, which prevents the cluster from being able to process portions of the join. The RDBMS also maintains transactional consistency when the cluster performs some or all of the join processing.

    Abstract translation: 用于在RDBMS和辅助群集之间分配连接处理的系统和方法。 在一个实施例中,该方法估计在RDBMS中完全执行连接的成本以及在耦合到RDBMS的集群的协助下执行连接的成本。 在集群的帮助下执行连接的成本包括根据表的大小来估计广播联接或分区连接的成本。 当有阻塞操作时会产生额外的成本,从而防止集群处理部分连接。 当集群执行部分或全部连接处理时,RDBMS还维护事务一致性。

    FLUSHING ENTRIES IN A NON-COHERENT CACHE
    19.
    发明申请
    FLUSHING ENTRIES IN A NON-COHERENT CACHE 审中-公开
    在非相干缓存中进行冲洗

    公开(公告)号:US20140258637A1

    公开(公告)日:2014-09-11

    申请号:US13791863

    申请日:2013-03-08

    CPC classification number: G06F12/0837 G06F12/0808

    Abstract: Techniques are provided for performing a flush operation in a non-coherent cache. In response to determining to perform a flush operation, a cache unit flushes certain data items. The flush operation may be performed in response to a lapse of a particular amount of time, such as a number of cycles, or an explicit flush instruction that does not indicate any cache entry or data item. The cache unit may store change data that indicates which entry stores a data item that has been modified but not yet been flushed. The change data may be used to identify the entries that need to be flushed. In one technique, a dirty cache entry that is associated with one or more relatively recent changes is not flushed during a flush operation.

    Abstract translation: 提供了用于在非相干高速缓存中执行刷新操作的技术。 响应于确定执行刷新操作,高速缓存单元刷新某些数据项。 刷新操作可以响应于经过特定时间量(例如周期数)或不指示任何高速缓存条目或数据项的显式刷新指令来执行。 高速缓存单元可以存储指示哪个条目存储已被修改但尚未刷新的数据项的更改数据。 更改数据可用于标识需要刷新的条目。 在一种技术中,与一个或多个相对较新的变化相关联的脏缓存条目在刷新操作期间不被刷新。

    ISOLATION FOR APPLICATIONS WORKING ON SHARED XML DATA
    20.
    发明申请
    ISOLATION FOR APPLICATIONS WORKING ON SHARED XML DATA 审中-公开
    应用于分享XML数据的分离

    公开(公告)号:US20130318109A1

    公开(公告)日:2013-11-28

    申请号:US13953582

    申请日:2013-07-29

    CPC classification number: G06F17/30011 G06F17/2229 G06F17/2247 G06F17/30908

    Abstract: A mechanism is provided for detecting and disregarding application specific nodes contained in shared XML documents. The techniques described involve determining one or more application specific nodes within XML documents and performing path expression evaluations of the XML documents as if the nodes are not present. In one embodiment, a mechanism is provided by which a user may specify the criterion that determine which subset of node in XML documents are to be ignored from path expression evaluations and evaluating a query that specifies a path operation based on a path and ignoring said identified nodes when evaluating said path operation.

    Abstract translation: 提供了一种用于检测和忽略包含在共享XML文档中的应用程序特定节点的机制。 所描述的技术涉及确定XML文档内的一个或多个应用特定节点,并且如同节点不存在一样执行XML文档的路径表达式评估。 在一个实施例中,提供了一种机制,用户可以通过该机制指定确定XML文档中的节点的哪个子集将被从路径表达式评估中忽略的标准,并且基于路径评估指定路径操作的查询,并忽略所述标识的 节点在评估所述路径操作时。

Patent Agency Ranking