公开(公告)号：US09910893B2

公开(公告)日：2018-03-06

申请号：US13309300

申请日：2011-12-01

申请人： Fulu Li ,  Atsushi Morimura ,  Michael Zoll ,  Vineet Marwah ,  Amit Ganesh

发明人： Fulu Li ,  Atsushi Morimura ,  Michael Zoll ,  Vineet Marwah ,  Amit Ganesh

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/3048

摘要： An approach is disclosed for implementing failover and resume when using ordered sequences in a multi-instance database environment. The approach commences by instantiating a first database instance initially to serve as an active instance, then instantiating a second database instance to serve as an instance of one or more passive instances. The active database establishes mastership over a sequence and then processes requests for the ‘next’ symbol by accessing a shared sequence cache only after accessing a first instance semaphore. The active instance and the passive instance perform a protocol such that upon passive database detection of a failure of the active database, one of the passive database instances takes over mastership of the sequence cache, and then proceeds to satisfy sequence value requests. The particular order is observed in spite of the failure.

公开(公告)号：US09027025B2

公开(公告)日：2015-05-05

申请号：US11736132

申请日：2007-04-17

申请人： Michael Zoll ,  Wilson Wai Shun Chan ,  Angelo Pruscino ,  Tak Fung Wang

发明人： Michael Zoll ,  Wilson Wai Shun Chan ,  Angelo Pruscino ,  Tak Fung Wang

IPC分类号： G06F9/46 ,  G06F11/34

CPC分类号： G06F11/3409 ,  G06F2201/81 ,  G06F2201/86

摘要： Techniques for monitoring resources of a computer system are provided. A monitoring process collects and reports utilization data for one or more resources of a computer system, such as CPU, memory, disk I/O, and network I/O. Instead of reporting just an average of the collected data over a period of time (e.g., 10 seconds), the monitoring process at least reports individually collected resource utilization values. If one or more of the utilization values exceed specified thresholds for the respective resources, then an alert may be generated. In one approach, the monitoring process is made a real-time priority process in the computer system to ensure that the memory used by the monitoring process is not swapped out of memory. Also, being a real-time priority process ensures that the monitoring process obtains a CPU in order collect resource utilization data even when the computer system is in a starvation mode.

摘要翻译： 提供了一种监控计算机系统资源的技术。 监视过程收集并报告计算机系统的一个或多个资源（例如CPU，存储器，磁盘I / O和网络I / O）的利用率数据。 监视过程至少报告单独收集的资源利用价值，而不是仅在一段时间（例如10秒）内报告所收集的数据的平均值。 如果一个或多个利用率值超过相应资源的指定阈值，则可以生成警报。 在一种方法中，监控过程在计算机系统中被实现为一个实时优先级过程，以确保监视进程使用的内存不会被交换出内存。 而且，作为实时优先级过程，即使计算机系统处于饥饿模式，也可以确保监视进程获得CPU以便收集资源利用率数据。

公开(公告)号：US07917596B2

公开(公告)日：2011-03-29

申请号：US12350182

申请日：2009-01-07

申请人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

发明人： Wilson Chan ,  Angelo Pruscino ,  Michael Zoll

IPC分类号： G06F15/16 ,  G06F12/00

CPC分类号： G06F17/30362

摘要： Described herein are techniques for using super masters to coordinate accesses by nodes in a database server cluster to data stored in a database. In many cases, the number of inter-nodal messages is reduced, thereby saving the overheads attendant to coordinating accesses in such a system.

摘要翻译： 这里描述的是使用超级主人来协调数据库服务器集群中的节点到存储在数据库中的数据的访问的技术。 在许多情况下，减少节点间消息的数量，从而节省了在这种系统中协调访问的开销。

公开(公告)号：US20090034537A1

公开(公告)日：2009-02-05

申请号：US11868317

申请日：2007-10-05

申请人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

发明人： Carol Colrain ,  Michael Zoll ,  Rajkumar Irudayaraj

IPC分类号： H04L12/56

CPC分类号： H04L67/322 ,  H04L45/121 ,  H04L45/306 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/327

摘要： Techniques for routing client requests among a group of nodes offering a service are described. A coordinator determines that performance could be improved by using affinity-based routing. In one embodiment, the coordinator calculates a Time-to-Live (TTL) metric whereby clients benefit by returning to the same cache and posts this hint to subscribers. Client's start preserving locality data in an affinity context, such that later requests for a connection can be routed to the location last visited. The coordinator measures the system over subsequent intervals. If the gradient of the goodness (viz service quality and capacity) is stable or improving, then the coordinator continues to advise subscribers to use the affinity-based technique. Alternatively, if the gradient of the goodness is deteriorating, then the coordinator posts advice to the subscribers to stop using the affinity-based technique for any instance during the next intervals.

摘要翻译： 描述了在提供服务的一组节点之间路由客户端请求的技术。 协调者决定通过使用基于亲和性的路由可以提高性能。 在一个实施例中，协调器计算生存时间（TTL）度量，由此客户端通过返回到相同的高速缓存并且向用户发布该提示而受益。 客户端启动在亲和性上下文中保留位置数据，以便稍后的连接请求可以路由到上次访问的位置。 协调员在随后的时间间隔内测量系统。 如果善意的梯度（服务质量和容量）稳定或改善，协调员将继续建议用户使用基于亲和力的技术。 或者，如果善意的渐变正在恶化，则协调器向订阅者发布建议以在下一间隔期间停止对任何实例使用基于亲和力的技术。

公开(公告)号：US07392335B2

公开(公告)日：2008-06-24

申请号：US11351675

申请日：2006-02-10

申请人： Wilson Wai Shun Chan ,  Angelo Pruscino ,  Michael Zoll ,  Tak Fung Wang

发明人： Wilson Wai Shun Chan ,  Angelo Pruscino ,  Michael Zoll ,  Tak Fung Wang

IPC分类号： G06F12/14

CPC分类号： G06F9/526

摘要： A method and system are provided for performing anticipatory changes to a resource governed by a locking mechanism. Entities (such as transactions in a database system) that want to modify a resource request permission to modify the resource. However, prior to receiving permission, they make anticipatory changes to a private version of the resource. The entities are prevented from making the anticipatory changes permanent until they receive permission to make the changes. Because they can make the changes, and proceed to other operations, before receiving permission, any delay in receiving permission has less adverse effect on their performance.

摘要翻译： 提供了一种方法和系统，用于对由锁定机构控制的资源执行预期的改变。 要修改资源请求修改资源的权限的实体（如数据库系统中的事务）。 但是，在获得许可之前，他们会对资源的私有版本做出预期的更改。 这些实体被阻止使预期变化持续，直到他们获得进行更改的许可。 由于可以进行变更，进行其他操作，在获得许可之前，任何延迟的接收许可对其性能的影响较小。

公开(公告)号：US07315910B2

公开(公告)日：2008-01-01

申请号：US11156318

申请日：2005-06-16

申请人： Wilson Wai Shun Chan ,  Angelo Pruscino ,  Stefan Roesch ,  Michael Zoll ,  Tolga Yurek ,  Eugene Ho

发明人： Wilson Wai Shun Chan ,  Angelo Pruscino ,  Stefan Roesch ,  Michael Zoll ,  Tolga Yurek ,  Eugene Ho

IPC分类号： G06F12/14 ,  G06F7/00 ,  G06F11/00 ,  G06F9/46

CPC分类号： G06F9/526 ,  G06F2209/522 ,  Y10S707/99938

摘要： Techniques are described herein for handling lock-related inconsistencies. As mentioned above, such inconsistencies occur when two or more sets of lock information, relating to the same resource, convey inconsistent information about locks requested and/or granted on that resource. In general, the techniques involve causing the locally-stored lock information about a resource to be sent to the master node of the resource. The master node of the resource compares the lock information thus received against the lock information maintained by the master node. Based on the comparison, the master node determines how to resolve the lock-related inconsistency, and sends messages to those nodes that need to change their local lock information for the resource. Once all of the lock information has been made consistent, the resource made available for access.

摘要翻译： 本文描述了处理与锁相关的不一致性的技术。 如上所述，当与相同资源相关的两组或多组锁定信息传达关于在该资源上请求和/或授予的锁定的不一致的信息时，会发生这种不一致。 一般来说，这些技术涉及将关于资源的本地存储的锁定信息发送到资源的主节点。 资源的主节点将由此接收的锁定信息与由主节点维护的锁定信息进行比较。 基于比较，主节点确定如何解决与锁相关的不一致，并向需要更改其资源的本地锁信息的那些节点发送消息。 一旦所有的锁信息一致，该资源就可用于访问。

公开(公告)号：US20070288463A1

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

申请号：US11450179

申请日：2006-06-09

申请人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

发明人： Eugene Ho ,  Kotaro Ono ,  Neil Macnaughton ,  Michael Zoll ,  Herbert van den Bergh

IPC分类号： G06F17/30

CPC分类号： G06F17/30362

摘要： Methods and apparatuses for providing access to data in a cluster database are described. Embodiments of the invention include identifying situations in which many nodes require relatively equal access to a data block, and taking appropriate measures to improve the performance of the system in these situations. For example, a node may automatically downgrade its lock from an X lock to an S lock as soon as it has finished a modification of the data. S locks are sent to other nodes in the system as soon as a modification is complete. Modifications to the data are also sent to other nodes in the system as soon as a modification is complete. Depending on the size of the data modification, the entire data block may be sent, or only the modifications to the data may be sent.

摘要翻译： 描述了用于提供对群集数据库中的数据的访问的方法和装置。 本发明的实施例包括识别许多节点需要对数据块相对相等的访问的情况，并且在这些情况下采取适当的措施来提高系统的性能。 例如，一旦节点完成数据的修改，节点就可以自动将其锁定从X锁降级到S锁。 一旦修改完成，S锁将被发送到系统中的其他节点。 一旦修改完成，对数据的修改也将发送到系统中的其他节点。 根据数据修改的大小，可以发送整个数据块，或者仅可以发送对数据的修改。

公开(公告)号：US07209990B2

公开(公告)日：2007-04-24

申请号：US11099771

申请日：2005-04-05

申请人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

发明人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

IPC分类号： G06F13/36 ,  G06F13/362 ,  G06F9/46 ,  G06F12/00

CPC分类号： G06F9/526 ,  Y10S707/99938

摘要： Locks are placed in a convert queue in a way that compensates for queue bias. Rather than always placing a remote lock in a queue at the tail, a remote lock can be placed further up in the queue, and possibly be interleaved with local locks. As a result, remote processes are granted locks more frequently and swiftly. Locks are placed in a convert queue according based on queue placement factors, which are factors accounted for when placing a lock in a queue.

摘要翻译： 锁定以一种补偿队列偏差的方式放置在转换队列中。 而不是总是将远程锁放置在尾部的队列中，远程锁可以进一步放置在队列中，并且可能与本地锁交错。 因此，远程进程被更频繁和迅速地被授予锁定。 根据队列放置因子将锁放置在转换队列中，这些因素是将锁放置在队列中时考虑的因素。

公开(公告)号：US20070043726A1

公开(公告)日：2007-02-22

申请号：US11205529

申请日：2005-08-16

申请人： Wilson Chan ,  Angelo Pruscino ,  Stefan Roesch ,  Michael Zoll ,  Tolga Yurek

发明人： Wilson Chan ,  Angelo Pruscino ,  Stefan Roesch ,  Michael Zoll ,  Tolga Yurek

IPC分类号： G06F17/30

CPC分类号： G06F11/2046 ,  G06F11/203 ,  G06F11/2033 ,  G06F11/2035 ,  G06F11/30 ,  G06F2201/825 ,  Y10S707/99939 ,  Y10S707/99942 ,  Y10S707/99953

摘要： Techniques are provided for responding to the termination of a node by selecting another node, and assigning to the selected node the affinity relationships that existed between the terminated node and one or more objects. The resources that belong to the objects involved in the affinity relationships are remastered to the selected node. The selected node then performs recovery of the resources that had been opened by the terminated node and/or serves as a failover node to execute the transactions that had been executing on the terminated node.

摘要翻译： 提供了通过选择另一个节点来响应终止节点的技术，并且向所选节点分配存在于终止的节点与一个或多个对象之间的亲和度关系。 属于与亲和力关系相关的对象的资源将重新分配给所选节点。 所选择的节点然后执行已被终止的节点打开的资源的恢复和/或用作故障切换节点来执行在终止的节点上执行的事务。

公开(公告)号：US20060224805A1

公开(公告)日：2006-10-05

申请号：US11099771

申请日：2005-04-05

申请人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

发明人： Angelo Pruscino ,  Michael Zoll ,  Wilson Chan

IPC分类号： G06F12/14

CPC分类号： G06F9/526 ,  Y10S707/99938

摘要： Locks are placed in a convert queue in a way that compensates for queue bias. Rather than always placing a remote lock in a queue at the tail, a remote lock can be placed further up in the queue, and possibly be interleaved with local locks. As a result, remote processes are granted locks more frequently and swiftly. Locks are placed in a convert queue according based on queue placement factors, which are factors accounted for when placing a lock in a queue.

摘要翻译： 锁定以一种补偿队列偏差的方式放置在转换队列中。 而不是总是将远程锁放置在尾部的队列中，远程锁可以进一步放置在队列中，并且可能与本地锁交错。 因此，远程进程被更频繁和迅速地被授予锁定。 根据队列放置因子将锁放置在转换队列中，这些因素是将锁放置在队列中时考虑的因素。