Transactional shared memory system and method of control
    13.
    发明申请
    Transactional shared memory system and method of control 有权
    事务共享内存系统和控制方法

    公开(公告)号:US20070288587A1

    公开(公告)日:2007-12-13

    申请号:US11450987

    申请日:2006-06-12

    IPC分类号: G06F15/167

    摘要: A transactional shared memory system has a plurality of discrete application nodes; a plurality of discrete memory nodes; a network interconnecting the application nodes and the memory nodes, and a controller for directing transactions in a distributed system utilizing the shared memory. The memory nodes collectively provide an address space of shared memory that is provided to the application nodes via the network. The controller has instructions to transfer a batched transaction instruction set from an application node to at least one memory node. This instruction set includes one or more write, compare and read instruction subsets, and/or combinations thereof. At least one subset has a valid non null memory node identifier and memory address range. The memory node identifier may be indicated by the memory address range. The controller controls the memory node responsive to receipt of the batched transaction instruction set, to safeguard the associated memory address range during execution of the transaction instruction set. The batched transaction instruction set is collectively executed atomically. A notification instruction set may also be used to establish a notification, triggered upon a subsequent write event upon at least a portion of a specified address range.

    摘要翻译: 交易共享存储器系统具有多个离散应用节点; 多个离散存储器节点; 互连应用节点和存储器节点的网络,以及用于在利用共享存储器的分布式系统中指导事务的控制器。 存储器节点共同地提供通过网络提供给应用节点的共享存储器的地址空间。 控制器具有将批处理交易指令集从应用节点传送到至少一个存储器节点的指令。 该指令集包括一个或多个写入,比较和读取指令子集,和/或其组合。 至少一个子集具有有效的非空存储器节点标识符和存储器地址范围。 存储器节点标识符可以由存储器地址范围指示。 所述控制器响应于接收到所述批处理指令集来控制所述存储器节点,以在所述事务指令集的执行期间保护所述相关联的存储器地址范围。 批量事务指令集合是以原子方式共同执行的。 也可以使用通知指令集来建立在指定地址范围的至少一部分上的后续写入事件时触发的通知。

    Data management using writeable snapshots in multi-versioned distributed B-trees
    14.
    发明授权
    Data management using writeable snapshots in multi-versioned distributed B-trees 有权
    使用多版本分布式B树中的可写入快照进行数据管理

    公开(公告)号:US08768977B2

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

    申请号:US13562941

    申请日:2012-07-31

    IPC分类号: G06F17/30

    摘要: A method for managing data using writeable snapshots in a multi-versioned, distributed B-tree comprising nodes distributed over a plurality of servers, includes receiving a transaction request specifying a transaction type, the transaction having a transaction snapshot id, and determining the transaction type. If the transaction type is an update transaction, the method includes determining a node to update, which is defined by a node snapshot id, and if the transaction snapshot id is greater that the node snapshot id, the method copies the node and updates the copy to create a writeable snapshot, assigns the transaction snapshot id as a node snapshot id of the copy, and places a pointer from the node to the copy.

    摘要翻译: 一种用于在包含分布在多个服务器上的节点的多版本分布式B树中使用可写入快照来管理数据的方法,包括:接收指定事务类型的事务请求,该事务具有事务快照id,以及确定事务类型 。 如果事务类型是更新事务,则该方法包括确定要由节点快照ID定义的更新节点,并且如果事务快照ID大于节点快照ID,则该方法复制节点并更新副本 创建可写快照,将事务快照ID分配为副本的节点快照ID,并将指针从节点放置到副本。

    Verifying consistency levels
    16.
    发明授权
    Verifying consistency levels 有权
    验证一致性级别

    公开(公告)号:US08589360B2

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

    申请号:US13323577

    申请日:2011-12-12

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30371

    摘要: A method for verifying a consistency level in a key-value store, in which a value is stored in a cloud-based storage system comprising a read/write register identified by a key. At a centralized monitor node, a history of operations including writes and reads performed at the key is created, and a distance between a read of a value at the key and a latest write to the key is determined. It can then be ascertained whether the distance satisfies a relaxed atomicity property.

    摘要翻译: 一种验证密钥值存储中的一致性级别的方法,其中值存储在基于云的存储系统中,该存储系统包括由密钥识别的读/写寄存器。 在集中式监视节点处,创建包括在密钥处执行的写入和读取的操作的历史记录,并且确定在键处的读取和对该键的最新写入之间的距离。 然后可以确定距离是否满足松弛的原子性质。

    ACCESSING A LOCAL STORAGE DEVICE USING AN AUXILIARY PROCESSOR
    17.
    发明申请
    ACCESSING A LOCAL STORAGE DEVICE USING AN AUXILIARY PROCESSOR 审中-公开
    使用辅助处理器访问本地存储设备

    公开(公告)号:US20130111249A1

    公开(公告)日:2013-05-02

    申请号:US13810187

    申请日:2010-07-21

    IPC分类号: G06F1/32

    摘要: The present disclosure includes accessing a local storage device using an auxiliary processor An example computing device (100, 202, 303) includes a local storage device (110, 210, 310), a first processor (112, 212, 312) able to access the local storage device (110, 210, 310), an auxiliary processor (114, 220, 360) able to access the local storage device (110, 210, 310) while the first processor (112, 212, 312) is shut down, wherein the auxiliary processor (114, 220, 360) uses less power than the first processor (112, 212, 312), and a management agent (125, 225, 370) to initiate an accessing of the local storage device (110, 210, 310) by the auxiliary processor (114, 220, 360) if a load associated with the computing device (100, 202, 303) falls below a particular threshold. One of the first processor (112, 212, 312) and the auxiliary processor (114, 220, 360) is able to access the local storage device (110, 210, 310) at a time.

    摘要翻译: 本公开包括使用辅助处理器访问本地存储设备示例性计算设备(100,202,303)包括本地存储设备(110,210,310),能够访问的第一处理器(112,212,312) 本地存储设备(110,210,310),当第一处理器(112,212,312)被关闭时能够访问本地存储设备(110,210,310)的辅助处理器(114,220,360) ,其中所述辅助处理器(114,220,360)使用比所述第一处理器(112,212,312)更少的功率,以及管理代理(125,225,370)来启动所述本地存储设备 如果与计算设备(100,202,303)相关联的负载下降到特定阈值以下,则由辅助处理器(114,220,360)分配。 第一处理器(112,212,312)和辅助处理器(114,220,360)中的一个能够一次访问本地存储设备(110,210,310)。

    Fetching optimization in multi-way pipelined database joins
    20.
    发明授权
    Fetching optimization in multi-way pipelined database joins 有权
    在多路流水线数据库联接中获取优化

    公开(公告)号:US08402016B2

    公开(公告)日:2013-03-19

    申请号:US12473065

    申请日:2009-05-27

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30498

    摘要: A method of performing a multi-way join of a plurality of database relations includes executing a plurality of pipelined two-way joins with the database relations. Each two-way join has two sequential phases. In the first phase, missing attributes of the input relations that are required to evaluate a joining criterion specific to said two-way join are fetched from a non-volatile memory device, and the input relations are joined according to the criterion. In the second phase, any additional missing attributes of the input relations are fetched from the non-volatile memory device as assigned by an optimization process executed prior to commencing the multi-way join.

    摘要翻译: 执行多个数据库关系的多路连接的方法包括执行具有数据库关系的多个流水线的双向连接。 每个双向连接都有两个连续的阶段。 在第一阶段,从非易失性存储器件取出评估特定于所述双向连接的连接标准所需的输入关系的缺失属性,并且根据该标准连接输入关系。 在第二阶段中,通过在开始多路连接之前执行的优化处理所指定的非易失性存储器设备,从输入关系的任何附加的缺失属性获取。