会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Using a checkpoint to manage data that is shared by a plurality of nodes
    • 使用检查点来管理由多个节点共享的数据
    • US06567827B2
    • 2003-05-20
    • US09894640
    • 2001-06-27
    • Roger J. BamfordBoris Klots
    • Roger J. BamfordBoris Klots
    • G06F1730
    • G06F11/1471G06F2201/80Y10S707/915Y10S707/99938Y10S707/99952Y10S707/99953Y10S707/99954
    • A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.
    • 提供了一种方法和装置,用于将资源从一个数据库服务器的高速缓存传送到另一个数据库服务器的高速缓存,而无需首先将资源写入磁盘。 当数据库服务器(请求者)希望修改资源时,请求者要求资源的当前版本。 具有当前版本(Holder)的数据库服务器将当前版本直接发送到请求者。 运送版本后,持有人将失去修改资源的权限,但继续将资源保留在内存中。 当将资源的保留版本或其更新版本写入磁盘时,持有者可以丢弃资源的保留版本。 否则,持有人不会丢弃保留的版本。 使用此技术,恢复单服务器故障,而无需合并可访问资源的各种数据库服务器的恢复日志。
    • 12. 发明授权
    • I/O forwarding in a cache coherent shared disk computer system
    • I / O转发在缓存一致的共享磁盘计算机系统中
    • US6112281A
    • 2000-08-29
    • US946084
    • 1997-10-07
    • Roger J. BamfordBoris Klots
    • Roger J. BamfordBoris Klots
    • G06F3/06G06F9/46G06F12/00G06F12/08
    • G06F9/52G06F12/0813G06F12/0815G06F12/0866G06F2212/311
    • A method and apparatus for I/O forwarding in a cache coherent shared disk computer system is provided. According to the method, a requesting node transmits a request for requested data to a managing node. The managing node receives the read request from the requesting node and grants a lock on the requested data. The managing node then forwards data that identifies the requested data to a disk controller. The disk controller receives the data that identifies the requested data from the managing node and reads a data item, based on the data that identifies the requested data, from a shared disk. After reading the data item from the shared disk, the disk controller transmits the data item to the requesting node. In one embodiment, an I/O destination handle is generated that identifies a read request and a buffer cache address to which the data item should be copied. The I/O destination handle is transmitted to the disk controller to facilitate transmission and processing of the data item from the disk controller to the requesting node. As a result of forwarding data that identifies the requested data directly from the managing node to the disk controller ("I/O forwarding"), the duration of a stall is reduced, contention on resources of the system is reduced and a context switch is eliminated.
    • 提供了一种用于缓存一致共享磁盘计算机系统中的I / O转发的方法和装置。 根据该方法,请求节点向管理节点发送请求数据的请求。 管理节点从请求节点接收读请求,并对所请求的数据进行锁定。 管理节点然后将识别所请求数据的数据转发到磁盘控制器。 磁盘控制器从管理节点接收标识所请求数据的数据,并从共享磁盘读取数据项,基于标识所请求数据的数据。 从共享磁盘读取数据项后,磁盘控制器将数据项发送到请求节点。 在一个实施例中,生成识别读取请求的I / O目的地句柄和应该复制数据项的缓冲器高速缓存地址。 将I / O目的地句柄发送到磁盘控制器,以便于将数据项从磁盘控制器发送到处理请求节点。 作为将从管理节点直接识别请求的数据的数据转发到磁盘控制器(“I / O转发”)的结果,减少停顿的持续时间,减少对系统的资源的争用,并且上下文切换是 消除了
    • 13. 发明授权
    • Transferring a resource between caches of different nodes
    • 在不同节点的缓存之间传输资源
    • US06564230B2
    • 2003-05-13
    • US09894636
    • 2001-06-27
    • Roger J. BamfordBoris Klots
    • Roger J. BamfordBoris Klots
    • G06F1730
    • G06F11/1471G06F2201/80Y10S707/915Y10S707/99938Y10S707/99952Y10S707/99953Y10S707/99954
    • A method and apparatus are provided for transferring a resource from the cache of one database server to the cache of another database server without first writing the resource to disk. When a database server (Requestor) desires to modify a resource, the Requestor asks for the current version of the resource. The database server that has the current version (Holder) directly ships the current version to the Requestor. Upon shipping the version, the Holder loses permission to modify the resource, but continues to retain the resource in memory. When the retained version of the resource, or a later version thereof, is written to disk, the Holder can discard the retained version of the resource. Otherwise, the Holder does not discard the retained version. Using this technique, single-server failures are recovered without having to merge the recovery logs of the various database servers that had access to the resource.
    • 提供了一种方法和装置,用于将资源从一个数据库服务器的高速缓存传送到另一个数据库服务器的高速缓存,而无需首先将资源写入磁盘。 当数据库服务器(请求者)希望修改资源时,请求者要求资源的当前版本。 具有当前版本(Holder)的数据库服务器将当前版本直接发送到请求者。 运送版本后,持有人将失去修改资源的权限,但继续将资源保留在内存中。 当资源的保留版本或其更新版本写入磁盘时,持有者可以丢弃资源的保留版本。 否则,持有人不会丢弃保留的版本。 使用此技术,恢复单服务器故障,而无需合并可访问资源的各种数据库服务器的恢复日志。
    • 15. 发明授权
    • Object hashing with incremental changes
    • 对象散列增量更改
    • US06363396B1
    • 2002-03-26
    • US09218864
    • 1998-12-21
    • Boris KlotsRoger J. BamfordJeffrey FischerRavi Mirchandaney
    • Boris KlotsRoger J. BamfordJeffrey FischerRavi Mirchandaney
    • G06F1700
    • G06F17/30949G06F9/52Y10S707/99943Y10S707/99944Y10S707/99945
    • A method and system are provided for reconfiguring a multiple node system after an epoch change in a manner that reduces the overhead and system unavailability typically incurred during reconfiguration. A resource-to-master mapping is established using the combination of a resource-to-bucket hash function and a bucket-to-node hash function. The resource-to-bucket hash function is not changed in response to an epoch change. The bucket-to-node hash function does change in response to epoch changes. Techniques are disclosed for adjusting the dynamic bucket-to-node hash function after an epoch change in a manner that load balances among the new number of nodes in the system. Further, the changes to the bucket-to-node assignments are performed in a way that reduces the number of resources that have to be remastered. In one embodiment, only those resources that lose their masters during an epoch change are assigned new masters during an initial reconfiguration. Load balancing is then gradually achieved by migrating resources after the system has been made available. The old masters of resources forward access requests to new masters of resources once they have transferred the master resource objects for the requested resources. In addition, techniques are disclosed for migrating resources from a node in anticipation of a planned shutdown of the node.
    • 提供了一种方法和系统,用于在减少在重新配置期间通常引起的开销和系统不可用性的方式在重新构造时代改变之后重新配置多节点系统。 使用资源到桶哈希函数和桶到节点哈希函数的组合来建立资源对主映射。 资源到桶哈希函数不响应时代变化而改变。 桶到节点哈希函数根据时代变化而改变。 公开了用于在以系统中的新数量的节点之间的负载平衡的方式在调整历史变化之后的动态桶到节点散列函数的技术。 此外,以对减少必须重新分配的资源数量的方式来执行对桶到节点分配的改变。 在一个实施例中,在初始重新配置期间,仅分配在时代变化期间失去其主人的资源被分配新的主人。 然后在系统可用后通过资源迁移逐步实现负载平衡。 一旦资源转移了所需资源的主资源对象,资源的老主人就会向新的资源主管理请求。 此外,在预期节点的计划关闭的情况下,公开了用于从节点迁移资源的技术。
    • 18. 发明授权
    • Evaluating performance of binary classification systems
    • 评估二进制分类系统的性能
    • US08554622B2
    • 2013-10-08
    • US11612004
    • 2006-12-18
    • Richard Tao-Hwa ChowPavel BerkhinElena EnevaBoris KlotsNicolas Eddy MayorazRajesh Girish Parekh
    • Richard Tao-Hwa ChowPavel BerkhinElena EnevaBoris KlotsNicolas Eddy MayorazRajesh Girish Parekh
    • G06Q30/00
    • G06Q30/0248G06Q10/0635G06Q30/0185G06Q30/02
    • Methods and apparatus are described for evaluating a binary classification system operable to classify each of a plurality of events as a first event type or a second event type. At least some of the events of the first event type are independently verifiable with reference to verification data. The binary classification system is susceptible to a first error type in which events of the first event type are classified as the second event type, and a second error type in which events of the second event type are classified as the first event type. Operation of a first configuration of the binary classification system is evaluated with reference to an objective function. The objective function is derived by expressing a number of errors of the second error type in terms of a number of errors of the first error type with reference to the verification data, and by assuming relative proportions of the first and second event types within the plurality of events.
    • 描述了用于评估用于将多个事件中的每一个分类为第一事件类型或第二事件类型的二进制分类系统的方法和装置。 参考验证数据,可以独立地验证第一事件类型的至少一些事件。 二进制分类系统易于将第一事件类型的事件分类为第二事件类型的第一错误类型和将第二事件类型的事件分类为第一事件类型的第二错误类型。 参照目标函数对二进制分类系统的第一配置的操作进行评估。 目标函数是通过参照验证数据表示第一错误类型的错误数量的第二错误类型的错误数,并且假设多个中的第一和第二事件类型的相对比例 的事件。
    • 20. 发明授权
    • Sharing snapshots for consistent reads
    • 共享快照以进行一致的读取
    • US5956731A
    • 1999-09-21
    • US842169
    • 1997-04-23
    • Roger BamfordBoris KlotsGarret Swart
    • Roger BamfordBoris KlotsGarret Swart
    • G06F9/46G06F17/30
    • G06F17/30356G06F9/466Y10S707/99931Y10S707/99938Y10S707/99952Y10S707/99953
    • A method and apparatus for supplying data from a database to a group of transactions is provided. A value is maintained for the group of transactions. The value indicates a target snapshot of the database. When a transaction within the group of transactions accesses a data item, it is determined whether the transaction can use the target snapshot. If the transaction can use the target snapshot, then the transaction is supplied a version of the data item that belongs to the target snapshot. If the transaction cannot use the target snapshot, then the transaction is supplied a version of the data item other than the version of the data item that belongs to the target snapshot. Trying to supply data from the same snapshot to all of the transactions in the group increases the likelihood that the transactions will be able to use the same version of any given data item. Consequently, fewer reconstruction operations will have to be performed, and dynamic memory is less likely to become filled with different versions of the same data items.
    • 提供了一种从数据库向一组交易提供数据的方法和装置。 为该组交易维护一个值。 该值表示数据库的目标快照。 当事务组内的事务访问数据项时,确定事务是否可以使用目标快照。 如果事务可以使用目标快照,那么事务将被提供属于目标快照的数据项的版本。 如果事务不能使用目标快照,那么事务将被提供除了属于目标快照的数据项的版本之外的数据项的版本。 尝试将同一快照中的数据提供给组中的所有事务增加了事务将能够使用相同版本的任何给定数据项的可能性。 因此,必须执行更少的重建操作,并且动态内存不太可能充满相同数据项的不同版本。