会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Method and system for maintaining checkpoint values
    • 维护检查点值的方法和系统
    • US06253212B1
    • 2001-06-26
    • US09103627
    • 1998-06-23
    • Juan R. LoaizaWilliam H. Bridge, Jr.Ashok Joshi
    • Juan R. LoaizaWilliam H. Bridge, Jr.Ashok Joshi
    • G06F1730
    • G06F11/1402Y10S707/99938Y10S707/99953
    • A method and system are provided for maintaining a checkpoint value that indicates which records of a plurality of records associated with updates made before a failure have to be processed after the failure. According to one aspect of the invention, an ordered list of buffers is maintained in volatile memory. The ordered list of buffers has a head and a tail. The ordered list of buffers is maintained by writing a record that indicates the update to nonvolatile memory and adding the buffer to the tail of the ordered list whenever an update is made to a data item within a buffer in volatile memory. When a data item contained in a buffer within the ordered list is stored in nonvolatile memory, the buffer can be removed from the ordered list. A checkpoint value that identifies a record associated with a buffer located at the head of the ordered list is written to nonvolatile memory. According to another aspect, after a failure, the record associated with the checkpoint value is identified. If a particular record was stored to nonvolatile memory before the record associated with the checkpoint value, the particular record is not processed. If the particular record was not stored to nonvolatile memory before the record associated with the checkpoint value, the particular record is processed.
    • 提供了一种方法和系统,用于维护检查点值,该检查点值指示在故障之后必须处理故障之前所做出的与更新相关联的多个记录的哪些记录。 根据本发明的一个方面,缓存器的有序列表被保存在易失性存储器中。 缓冲区的有序列表有一个头和尾。 通过写入一个指示更新到非易失性存储器的记录来维护缓冲区的有序列表,并且每当对易失性存储器中的缓冲器内的数据项进行更新时,将该缓冲区添加到有序列表的尾部。 当包含在有序列表中的缓冲器中的数据项存储在非易失性存储器中时,可以从有序列表中移除缓冲区。 标识与位于有序列表头部的缓冲区关联的记录的检查点值被写入非易失性存储器。 根据另一方面,在故障之后,识别与检查点值相关联的记录。 如果在与检查点值相关联的记录之前将特定记录存储到非易失性存储器中,则不处理特定记录。 如果在与检查点值相关联的记录之前没有将特定记录存储到非易失性存储器中,则处理特定记录。
    • 14. 发明授权
    • Method and system for controlling recovery downtime
    • 控制恢复停机时间的方法和系统
    • US06351754B1
    • 2002-02-26
    • US09103630
    • 1998-06-23
    • William H. Bridge, Jr.Boris KlotsJuan R. LoaizaAshok Joshi
    • William H. Bridge, Jr.Boris KlotsJuan R. LoaizaAshok Joshi
    • G06F1730
    • G06F11/1461G06F11/1471G06F2201/80Y10S707/99938Y10S707/99953
    • A method and system for reducing overhead associated with recovering after a failure. According to the method, a checkpoint value is maintained that indicates which records of a plurality of records have to be processed after the failure. The plurality of records contain change information that corresponds to a plurality of data blocks. A target checkpoint value is determined based on a desired number of data block reads that will be required during a redo phase of recovery. Changes contained in volatile memory are then written to nonvolatile memory to advance the checkpoint value to at least the target checkpoint value. According to another aspect of the invention, the target checkpoint value is determined using a circular queue of offset buckets. The offset buckets are used to store index values that are associated with buffers in the ordered list. The target checkpoint value is periodically set equal to an index value that is contained in an offset bucket. According to another aspect of the invention, the target checkpoint value is determined by calculating a maximum number of records that should be processed after the failure. The maximum number of records is based on the desired number of data block reads that will be required during the redo phase of the recovery. The target checkpoint value is updated based on the maximum number of records.
    • 一种降低与故障恢复相关的开销的方法和系统。 根据该方法,维护检查点值,其指示在故障之后必须处理多个记录的哪些记录。 多个记录包含对应于多个数据块的改变信息。 基于在恢复的重做阶段将需要的数据块读取的期望数目来确定目标检查点值。 随后将易失性存储器中的变更写入非易失性存储器,将检查点值提升至至少目标检查点值。 根据本发明的另一方面,使用偏移桶的圆形队列来确定目标检查点值。 偏移量桶用于存储与排序列表中的缓冲区相关联的索引值。 目标检查点值周期性设置为等于包含在偏移量桶中的索引值。 根据本发明的另一方面,通过计算在故障之后应该处理的最大记录数来确定目标检查点值。 记录的最大数量是基于恢复重做阶段所需要的数据块读取所需的数量。 基于记录的最大数量更新目标检查点值。
    • 16. 发明授权
    • Multi-node fault-tolerant timestamp generation
    • 多节点容错时间戳生成
    • US6078930A
    • 2000-06-20
    • US961798
    • 1997-10-31
    • J. William LeeWilliam H. Bridge, Jr.
    • J. William LeeWilliam H. Bridge, Jr.
    • G06F11/14G06F17/00G06F11/00
    • G06F11/1415G06F2201/835Y10S707/99952Y10S707/99953
    • Techniques for determining a safe recovery time value after a failure of a first node in a computer system are described. According to the techniques, every node in a multi-node parallel database system maintains a logical clock for generating timestamps. The logical clocks are synchronized by attaching a current timestamp to every message that is sent by a node. When a node receives an incoming timestamp that is greater than the value indicated by the associated logical clock, it sets the associated logical clock forward to at least the value of the timestamp. When a node fails, a recovery node calculates a "safe" logical clock value to use in recovering the crashed node. In calculating the "safe" logical clock value, the recovery node searches specific areas of the database to locate and recover a most recent timestamp value associated with the crashed node. The recovery node then compares its current logical clock time value with the most recent crash node timestamp value to determine which timestamp is most recent. If the most recent crash node timestamp value is more recent than the recovery node's current logical clock time value, the recovery node's logical clock is updated to be at least as recent as the most recent crash node timestamp value. The recovery node then recovers the crashed node as its logical clock is guaranteed to be at least as recent as any timestamp value that was previously written to the database by the crashed node prior to failure.
    • 描述用于在计算机系统中的第一节点故障之后确定安全恢复时间值的技术。 根据这些技术,多节点并行数据库系统中的每个节点维护用于生成时间戳的逻辑时钟。 通过将当前时间戳附加到由节点发送的每个消息来同步逻辑时钟。 当节点接收到大于由相关逻辑时钟指示的值的输入时间戳时,它将关联的逻辑时钟向前设置为至少时间戳的值。 当节点出现故障时,恢复节点将计算一个“安全”的逻辑时钟值,用于恢复崩溃的节点。 在计算“安全”逻辑时钟值时,恢复节点搜索数据库的特定区域以查找和恢复与崩溃的节点相关联的最新时间戳值。 然后,恢复节点将其当前逻辑时钟时间值与最近的崩溃节点时间戳值进行比较,以确定哪个时间戳是最近的。 如果最近的崩溃节点时间戳值比恢复节点当前的逻辑时钟时间值更新,则恢复节点的逻辑时钟被更新为至少与最近的崩溃节点时间戳值一样近。 然后,恢复节点恢复崩溃的节点,因为其逻辑时钟保证至少与故障之前由崩溃的节点写入数据库的任何时间戳值一样最近。
    • 17. 发明授权
    • Latch-free sequence generation for high concurrency systems
    • 高并发系统的无锁定序列生成
    • US5983015A
    • 1999-11-09
    • US962534
    • 1997-10-31
    • J. William LeeWilliam H. Bridge, Jr.
    • J. William LeeWilliam H. Bridge, Jr.
    • G06F9/46
    • G06F9/52
    • A method and apparatus for reading a software counter in a computer system that contains a plurality of processes each having access to the software counter is provided. The software counter includes a wrap portion and a base portion that cannot both be accessed in an atomic operation. The method includes the steps of reading a first value. The first value being one of the wrap or base portions. Reading a second value. The second value being the other of the wrap or base portion. Determining whether the first value might be changed during a time period that elapsed between reading the first value and reading the second value. If the first value might be changed during the time period, then obtaining a latch that covers at least the wrap portion. After obtaining the latch, reading the wrap and base portion and releasing the latch.
    • 提供了一种用于读取计算机系统中的软件计数器的方法和装置,该计算机系统包含多个具有访问软件计数器的进程。 软件计数器包括在原子操作中不能同时访问的包裹部分和基部部分。 该方法包括读取第一值的步骤。 第一个值是包装或基部之一。 读第二个值。 第二个值是包装或基部中的另一个。 确定在读取第一个值和读取第二个值之间经过的时间段内是否可以更改第一个值。 如果在该时间段期间可以改变第一个值,则获得至少覆盖包裹部分的闩锁。 在获得闩锁之后,读取包裹和基部并释放闩锁。