中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

371 records (took 0.05 seconds)

    FACILITATION OF SEARCH, LIST, AND RETRIEVAL OPERATIONS ON PERSISTENT DATA SET USING DISTRIBUTED SHARED MEMORY
    251.
    发明申请
    FACILITATION OF SEARCH, LIST, AND RETRIEVAL OPERATIONS ON PERSISTENT DATA SET USING DISTRIBUTED SHARED MEMORY 有权
    使用分布式共享存储器对搜索，列表和检索数据进行搜索，恢复操作

    公开(公告)号：US20120131038A1

    公开(公告)日：2012-05-24

    申请号：US12950869

    申请日：2010-11-19

    Applicant: Lior ARONOVICH ,  Asaf LEVY ,  Liran LOYA

    Inventor： Lior ARONOVICH ,  Asaf LEVY ,  Liran LOYA

    IPC: G06F17/30

    CPC classification number: G06F11/2007 ,  G06F3/121 ,  G06F9/3863 ,  G06F9/526 ,  G06F11/1435 ,  G06F11/1471 ,  G06F11/1658 ,  G06F11/1666 ,  G06F11/2023 ,  G06F11/2043 ,  G06F11/2094 ,  G06F12/0813 ,  G06F17/30076 ,  G06F17/30312 ,  G06F2201/82 ,  G06F2201/825 ,  G06F2201/84 ,  G06F2209/523 ,  H04L67/1097

    Abstract: Various embodiments for facilitating search, list and retrieval operations on a persistent data set using a distributed shared memory (DSM) by a processor device are provided. In one exemplary embodiment, a DSM is used to store the data structures in a cluster shared memory, such that updates, deletions and insertions are applied to both the persistent data set and the DSM, and search, list and retrieval operations are processed directly from the DSM. A data structure in the persistent data set is stored in two separate DSM pages: a first page includes an identifying search key of the data structure, the search key also pointing to a location of the data structure in the storage. A second page includes the updatable properties of the data structure. A DSM storing the data structures' pages is organized as a two-row matrix.

    Abstract translation: 提供了用于利用由处理器设备使用分布式共享存储器（DSM）的持久数据集的搜索，列表和检索操作的各种实施例。 在一个示例性实施例中，DSM用于将数据结构存储在群集共享存储器中，使得更新，删除和插入被应用于持久数据集和DSM两者，并且搜索，列表和检索操作直接从 帝斯曼 持久数据集中的数据结构存储在两个单独的DSM页面中：第一页包括数据结构的识别搜索关键字，搜索关键字还指向存储器中的数据结构的位置。 第二页包括数据结构的可更新属性。 存储数据结构页面的DSM被组织为两行矩阵。

    Improving data availability during failure detection and recovery processing in a shared resource system
    252.
    发明授权
    Improving data availability during failure detection and recovery processing in a shared resource system 有权
    在共享资源系统中的故障检测和恢复处理期间提高数据可用性

    公开(公告)号：US08046633B2

    公开(公告)日：2011-10-25

    申请号：US12635599

    申请日：2009-12-10

    Applicant: Matthew A. Huras ,  Roger L. Zheng ,  Aamer Sachedina ,  James L. Finnie ,  Keriley K. Romanufa ,  Xun Xue ,  Andrew D. Buckler ,  Stewart L. Palmer

    Inventor： Matthew A. Huras ,  Roger L. Zheng ,  Aamer Sachedina ,  James L. Finnie ,  Keriley K. Romanufa ,  Xun Xue ,  Andrew D. Buckler ,  Stewart L. Palmer

    IPC: G06F11/00

    CPC classification number: G06F9/526 ,  G06F11/2028 ,  G06F11/2038 ,  G06F11/2046 ,  G06F2201/825

    Abstract: A system and method for managing shared resources is disclosed. The system includes a primary coherency processing unit which processes lock requests from a plurality of data processing hosts, the primary coherency processing unit also storing a first current lock state information for the plurality of data processing hosts, the first current lock state information including a plurality of locks held by the plurality of data processing hosts. The system further includes a standby coherency processing unit storing fewer locks than the primary coherency processing unit, the locks stored by the standby coherency processing unit being a subset of locks included in the first current lock state information, the standby coherency unit configured to perform a plurality of activities of the primary coherency processing unit using the subset of locks in response to a failure of the primary coherency processing unit.

    Abstract translation: 公开了一种用于管理共享资源的系统和方法。 该系统包括处理来自多个数据处理主机的锁定请求的主相关处理单元，该主相关处理单元还存储多个数据处理主机的第一当前锁定状态信息，第一当前锁定状态信息包括多个 由多个数据处理主机持有的锁。 所述系统还包括备用一致性处理单元，其存储比所述主相关处理单元更少的锁，由所述备用一致性处理单元存储的所述锁是包括在所述第一当前锁定状态信息中的锁的子集，所述备用一致性单元被配置为执行 响应于主要一致性处理单元的故障，主要一致性处理单元的多个活动使用锁定子集。

    Method and system for low overhead spin lock instrumentation
    256.
    发明授权
    Method and system for low overhead spin lock instrumentation 有权
    低开销旋转锁定仪的方法和系统

    公开(公告)号：US06622189B2

    公开(公告)日：2003-09-16

    申请号：US09726274

    申请日：2000-11-30

    Applicant: Raymond Morris Bryant ,  William Henry Hartner

    Inventor： Raymond Morris Bryant ,  William Henry Hartner

    IPC: G06F946

    CPC classification number: G06F9/52 ,  G06F11/3466 ,  G06F12/0806 ,  G06F2201/825 ,  G06F2201/885

    Abstract: A method and apparatus is presented for controlling spin lock instrumentation for a spin lock in a system with a cache. A lock flag represents a busy state for the spin lock; a first instrumentation flag is a global variable representing an enablement state for the spin lock instrumentation. A second instrumentation flag, stored within the same cache line as the lock flag, is also maintained as an updateable indication of the first instrumentation flag. Prior to each acquirement of the spin lock, the second instrumentation flag is checked for an indication that spin lock instrumentation is enabled. Although a reading of the lock flag may generate a cache miss, the lock flag is necessarily checked upon attempting to acquire the lock; the check of the second instrumentation flag cannot generate a superfluous cache miss because the second instrumentation flag is in the same cache line as the lock flag.

    Abstract translation: 提出了一种用于控制具有高速缓存的系统中的自旋锁的自旋锁定装置的方法和装置。 锁定标志表示自旋锁的忙状态; 第一个仪器标志是表示旋转锁定仪表的启用状态的全局变量。 存储在与锁定标志相同的高速缓存行中的第二仪器标志也被保持为第一仪器标志的可更新指示。 在每次获得自旋锁之前，检查第二个仪器标志是否启用自动锁定仪器的指示。 虽然锁定标志的读取可能产生高速缓存未命中，但是在尝试获取锁定时必须检查锁定标志; 第二个仪器标志的检查不能产生多余的高速缓存未命中，因为第二个仪器标志位于与锁定标志相同的高速缓存行中。

    Serverless distributed file system
    257.
    发明申请
    Serverless distributed file system 有权
    无服务器分布式文件系统

    公开(公告)号：US20020188605A1

    公开(公告)日：2002-12-12

    申请号：US10005629

    申请日：2001-12-05

    Inventor： Atul Adya ,  William J. Bolosky ,  Gerald Cermak ,  John R. Douceur ,  Marvin M. Theimer ,  Roger P. Wattnhofer

    IPC: G06F007/00

    CPC classification number: G06F17/30094 ,  G06F17/30171 ,  G06F17/30899 ,  G06F2201/825 ,  H04L63/0823 ,  H04L63/123 ,  Y10S707/956 ,  Y10S707/99931 ,  Y10S707/99938

    Abstract: A serverless distributed file system manages the storage of files and directories using one or more directory groups. The directories may be managed using Byzantine-fault-tolerant groups, whereas files are managed without using Byzantine-fault-tolerant groups. Additionally, the file system may employ a hierarchical namespace to store files. Furthermore, the directory group may employ a plurality of locks to control access to objects (e.g., files and directories) in each directory.

    Abstract translation: 无服务器分布式文件系统使用一个或多个目录组来管理文件和目录的存储。 可以使用拜占庭容错组来管理目录，而不使用拜占庭容错组来管理文件。 此外，文件系统可以使用分层命名空间来存储文件。 此外，目录组可以使用多个锁来控制对每个目录中的对象（例如，文件和目录）的访问。

    Method and apparatus for reducing data locking time by removing a lock when journal data is written into a main memory journal queue
    259.
    发明授权
    Method and apparatus for reducing data locking time by removing a lock when journal data is written into a main memory journal queue 失效
    当日志数据写入主存储日志队列时，通过删除锁来减少数据锁定时间的方法和装置

    公开(公告)号：US5386554A

    公开(公告)日：1995-01-31

    申请号：US700862

    申请日：1991-05-16

    Applicant: Masaharu Nozaki

    Inventor： Masaharu Nozaki

    IPC: G06F11/34 ,  G06F9/46 ,  G06F11/00 ,  G06F11/14 ,  G06F12/00 ,  G06F15/40

    CPC classification number: G06F9/466 ,  G06F11/1471 ,  G06F2201/82 ,  G06F2201/825 ,  Y10S707/99953

    Abstract: A data management system, which is equipped with a data file and a journal file and adapted to reserve the exclusive occupation for data and then update the data, is characterized by releasing the exclusive occupation of data prior to writing of a journal to the journal file and of corresponding updated data to the data file. When data on a data base is updated, the exclusive occupation states of data to be updated are reserved first and then updating of the data is executed on a data buffer placed on a main memory and journals on the updating of the data are collected. The collected journals are entered into a first-in first-out journal queue in units of transactions. The exclusive occupation states of data on a corresponding transaction is released after corresponding journals have been stored in the journal queue. The journals stored in the journal queue are written to the journal file in units of transactions in the order in which they are entered into the queue. Subsequently updated data is written to the data file. The data in the data file is restored using the journal file when a system failure occurs in the data base.

    Abstract translation: 一种数据管理系统，其配备有数据文件和日志文件，并且适于保留数据的专属占用，然后更新数据，其特征在于在将日志写入日志文件之前释放数据的排它占用 并将相应的更新数据提供给数据文件。 当更新数据库上的数据时，首先保留要更新的数据的排他占用状态，然后在放置在主存储器上的数据缓冲器上执行数据的更新，并收集关于更新数据的日志。 收集的期刊以事务单位输入先入先出的日志队列。 在对应的日志已经存储在日志队列中之后，释放相应事务上的数据的排他职业状态。 存储在日志队列中的日志按照进入队列的顺序以事务为单位写入日志文件。 随后更新的数据被写入数据文件。 当数据库中发生系统故障时，使用日志文件恢复数据文件中的数据。

    Transaction processing system and method with reduced locking
    260.
    发明授权
    Transaction processing system and method with reduced locking 失效
    交易处理系统和减少锁定的方法

    公开(公告)号：US5247672A

    公开(公告)日：1993-09-21

    申请号：US480700

    申请日：1990-02-15

    Applicant: Chandrasekaran Mohan

    Inventor： Chandrasekaran Mohan

    IPC: G06F9/46 ,  G06F9/52 ,  G06F12/00 ,  G06F15/00 ,  G06F17/30

    CPC classification number: G06F9/466 ,  G06F9/526 ,  G06F2201/825 ,  G06F2201/87 ,  Y10S707/99938

    Abstract: Apparatus and method for reading data pages in a transaction processing system without locking the pages are disclosed. The system maintains a Global.sub.-- Committed.sub.-- LSN identifying the oldest uncommitted transaction accessing any of the data, and Object.sub.-- Committed.sub.-- LSNs identifying the oldest uncommitted transactions accessing particular files, tables and indexes. Each data page includes a Page.sub.-- LSN identifying the last transaction to have updated the page. To read a page, a transaction first latches the pages, and compares the page's Page.sub.-- LSN with the Global.sub.-- Committed.sub.-- LSN, or with the page's respective Object.sub.-- Committed.sub.-- LSN. If the Page.sub.-- LSN is older than the Committed.sub.-- LSN with which it was compared, then the transaction reads the page without locking it, since there can be no uncommitted transaction in process which might have updated the page's data. However if the Page.sub.-- LSN is younger than the Committed.sub.-- LSN, the page is locked before being read.

Patent Agency Ranking