Adaptive time-based journal bundling
    1.
    发明授权
    Adaptive time-based journal bundling 失效
    自适应基于时间的日志捆绑

    公开(公告)号:US6052696A

    公开(公告)日:2000-04-18

    申请号:US67536

    申请日:1998-04-27

    IPC分类号: G06F11/14 G06F17/30

    摘要: A method and system of journal bundling that provides improved performance. In the preferred embodiment, a journal controller starts a timer to expire at a predetermined maximum time-to-wait. The journal controller then accumulates journal records in a bundle and transmits the bundle to the journal. The journal controller determines the number-of-journal-records accumulated in the bundle based on an adjustable preferred-bundle-size, which it calculates from an average-bundle-size over a history interval. If the timer expires, the journal controller writes the bundle to the journal even if the preferred-bundle-size has not been reached. By basing the preferred-bundle-size on an average-bundle-size over a history interval, the journal controller prevents rapid changes in the journal traffic-rate, which increases journal performance.

    摘要翻译: 日记捆绑的方法和系统,提供改进的性能。 在优选实施例中,日志控制器启动定时器以预定的最大等待时间到期。 日记控制器然后将日记记录累积到捆包中,并将捆绑包传送到日志。 日记控制器基于可调整的优选束大小来确定在捆绑中累积的日志记录数,其根据历史间隔中的平均束大小计算。 如果定时器超时,即使尚未达到首选的bundle大小,日志控制器也会将该包写入日志。 通过基于历史间隔的平均捆绑包大小,首选捆绑包大小,日志控制器可以防止日志流量速率的快速更改,从而增加日志性能。

    Database journal mechanism and method that supports multiple simultaneous deposits
    2.
    发明授权
    Database journal mechanism and method that supports multiple simultaneous deposits 失效
    数据库日志机制和方法,支持多个同时存款

    公开(公告)号:US06298345B1

    公开(公告)日:2001-10-02

    申请号:US09113641

    申请日:1998-07-10

    IPC分类号: G06F1730

    摘要: A journal mechanism for a database allows simultaneous deposits on multiple journal arms. According to a first embodiment, a journaling system maintains the time-order of interdependent deposits on the journal, but does not necessarily maintain the time-order of deposits that are independent of each other, thereby providing multiple simultaneous deposit points on the journal. The first embodiment provides excellent scaling of journal functions as processors are added to a database computer system. According to a second embodiment, a journaling system maintains the time-order of deposits on the journal, but allows a group of deposits known as a “bundle” to span multiple journal arms, thereby providing multiple simultaneous deposit points on the journal. The second embodiment provides good scaling while providing compatibility with known database systems. The present invention thus relieves contention for the journal that exists as the number of processors increases in a database system.

    摘要翻译: 一个数据库的期刊机制允许同时存放在多个日记本武器上。 根据第一实施例,日志系统将相互依赖的存款的时间顺序保持在期刊上,但不一定保持彼此独立的存款的时间顺序,从而在期刊上提供多个同时存款点。 当处理器被添加到数据库计算机系统时,第一实施例提供了日记功能的优异缩放。 根据第二实施例,日志系统保持期刊上的存款的时间顺序,但允许称为“捆”的一组存款跨越多个日记手臂,从而在期刊上提供多个同时存款点。 第二实施例提供良好的缩放,同时提供与已知数据库系统的兼容性。 因此,本发明减轻了在数据库系统中随着处理器数量的增加而存在的日志的争用。

    Method and Apparatus for Reducing Contention for Computer System Resources Using Soft Locks
    3.
    发明申请
    Method and Apparatus for Reducing Contention for Computer System Resources Using Soft Locks 失效
    使用软锁减少计算机系统资源争用的方法和装置

    公开(公告)号:US20080172670A1

    公开(公告)日:2008-07-17

    申请号:US11622021

    申请日:2007-01-11

    IPC分类号: G06F9/46

    CPC分类号: G06F9/526

    摘要: A soft lock mechanism controls access by multiple processes to a shared resource to make simultaneous access an unlikely event, while not necessarily preventing simultaneous access. Preferably, the soft lock contains a next_free_time field, specifying when the soft lock will next be available, and a lock_duration, specifying a sufficiently long interval for most accesses to the resource to complete. The lock is obtained by comparing the current time to next_free_time. If the current time is later than next_free_time, then the lock is obtained immediately, and next_free_time is updated to the current time plus lock_duration. If the current time is before next_free_time, then next_free_time is incremented by lock_duration, and the requesting process waits until the old next_free_time to obtain the lock. No action is required to release the lock.

    摘要翻译: 软锁定机制控制多个进程对共享资源的访问,以同时访问不太可能的事件,而不一定阻止同时访问。 优选地,软锁包含next_free_time字段,指定软锁将何时可用,以及lock_duration,指定大部分访问资源以完成的足够长的间隔。 通过将当前时间与next_free_time进行比较来获得锁定。 如果当前时间晚于next_free_time,则立即获取锁定,并将next_free_time更新为当前时间加上lock_duration。 如果当前时间在next_free_time之前,则next_free_time将被加上lock_duration,并且请求进程等待到旧的next_free_time来获取锁。 不需要采取任何行动来释放锁。

    Task synchronization mechanism and method
    4.
    发明授权
    Task synchronization mechanism and method 有权
    任务同步机制和方法

    公开(公告)号:US06990560B2

    公开(公告)日:2006-01-24

    申请号:US10346010

    申请日:2003-01-16

    IPC分类号: G06F12/02

    CPC分类号: G06F9/526 G06F9/544

    摘要: A task synchronization mechanism operates on a global lock that is shared between processors an on local locks that are not shared between processors. The local locks are processor-specific locks. Each processor-specific lock is dedicated to a particular processor in the system. When shared access to a resource is required, a processor updates its processor-specific lock to indicate the processor is sharing the resource. Because each processor-specific lock is dedicated to a particular processor, this eliminates a significant portion of the memory bus traffic associated with all processors reading and updating the same lock. When exclusive access to a resource is required, the requesting processor waits until the count of all processor-specific locks indicate that none of these processors have a lock on the resource. Once no processor has a lock on the resource, exclusive access to the resource may be granted.

    摘要翻译: 任务同步机制对在处理器之间共享的全局锁进行操作,本地锁在处理器之间未共享。 本地锁是处理器特定的锁。 每个处理器特定的锁专用于系统中的特定处理器。 当需要对资源的共享访问时,处理器更新其处理器特定的锁,以指示处理器正在共享资源。 因为每个特定于处理器的锁专用于特定的处理器,所以这消除了与所有处理器相关联的存储器总线流量的相当大部分读取和更新相同的锁。 当需要对资源的独占访问时,请求处理器等待直到所有特定于处理器的锁的计数指示这些处理器中没有一个对资源有锁定。 一旦没有处理器对资源进行锁定,就可以授予资源的独占访问权限。

    Method and apparatus for reducing contention for computer system resources using soft locks
    5.
    发明授权
    Method and apparatus for reducing contention for computer system resources using soft locks 失效
    使用软锁减少计算机系统资源争用的方法和装置

    公开(公告)号:US08141089B2

    公开(公告)日:2012-03-20

    申请号:US11622021

    申请日:2007-01-11

    IPC分类号: G06F9/46

    CPC分类号: G06F9/526

    摘要: A soft lock mechanism controls access by multiple processes to a shared resource to make simultaneous access an unlikely event, while not necessarily preventing simultaneous access. Preferably, the soft lock contains a next_free_time field, specifying when the soft lock will next be available, and a lock_duration, specifying a sufficiently long interval for most accesses to the resource to complete. The lock is obtained by comparing the current time to next_free_time. If the current time is later than next_free_time, then the lock is obtained immediately, and next_free_time is updated to the current time plus lock_duration. If the current time is before next_free_time, then next_free_time is incremented by lock_duration, and the requesting process waits until the old next_free_time to obtain the lock. No action is required to release the lock.

    摘要翻译: 软锁定机制控制多个进程对共享资源的访问,以同时访问不太可能的事件,而不一定阻止同时访问。 优选地,软锁包含next_free_time字段,指定软锁将何时可用,以及lock_duration,指定大部分访问资源以完成的足够长的间隔。 通过将当前时间与next_free_time进行比较来获得锁定。 如果当前时间晚于next_free_time,则立即获取锁定,并将next_free_time更新为当前时间加上lock_duration。 如果当前时间在next_free_time之前,则next_free_time将被加上lock_duration,并且请求进程等待到旧的next_free_time来获取锁。 不需要采取任何行动来释放锁。

    Mechanism that provides efficient multi-word load atomicity
    6.
    发明授权
    Mechanism that provides efficient multi-word load atomicity 失效
    提供有效的多字负载原子性的机制

    公开(公告)号:US07873794B2

    公开(公告)日:2011-01-18

    申请号:US11842335

    申请日:2007-08-21

    IPC分类号: G06F13/00

    摘要: Disclosed is an apparatus, method, and program product that provides atomic, multi-word load support without incurring additional memory utilization. A double-word is atomically loaded without the use of one or more additional fields and without a lock. An invalidity marker is used in connection with a cache miss time to ascertain whether a loaded double-word has been stored and loaded atomically, and is thus, valid.

    摘要翻译: 公开了一种在不引起额外的存储器利用的情况下提供原子,多字负载支持的装置,方法和程序产品。 双字是原子加载的,而不使用一个或多个附加字段而不使用锁。 结合高速缓存未命中时使用无效标记来确定加载的双字是否已被原子地存储和加载,因此是有效的。

    Process assignment by nodal affinity in a myultiprocessor system having
non-uniform memory access storage architecture
    7.
    发明授权
    Process assignment by nodal affinity in a myultiprocessor system having non-uniform memory access storage architecture 失效
    在具有非均匀内存访问存储架构的多处理器系统中通过节点亲和度进行过程分配

    公开(公告)号:US5784697A

    公开(公告)日:1998-07-21

    申请号:US622230

    申请日:1996-03-27

    CPC分类号: G06F9/5016

    摘要: According to the present invention, pool allocation and process assignment mechanisms create process nodal affinity in a NUMA multiprocessor system for enhanced performance. The multiprocessor system includes multiple interconnected multiprocessing nodes that each contain one or more processors and a local main memory, the system main storage being distributed among the local main memories of the multiprocessing nodes in a NUMA architecture. A pool reservation mechanism reserves pools of memory space within the logical main storage, and the pool allocation mechanism allocates those pools to real pages in the local main-memory of multiprocessing nodes. Processes to be created on the multiprocessor are given an attribute that indicates an associated pool. Upon creation, the process assignment mechanism will only assign a process to a multiprocessing node that has been allocated the pool indicated by the process' attribute. This process nodal affinity increases accesses by the assigned process to local main storage of that node, thereby enhancing system performance.

    摘要翻译: 根据本发明,池分配和过程分配机制在NUMA多处理器系统中创建过程节点亲和度以提高性能。 多处理器系统包括多个互连的多处理节点,每个节点包含一个或多个处理器和本地主存储器,该系统主存储器分布在NUMA架构中的多处理节点的本地主存储器之间。 池预留机制在逻辑主存储中保留存储空间池,池分配机制将这些池分配给多处理节点的本地主存中的实际页面。 在多处理器上创建的进程被赋予一个指示关联的池的属性。 创建后,进程分配机制将仅将一个进程分配给已分配由进程'属性指定的池的多处理节点。 此过程节点亲和性增加了分配过程对该节点的本地主存储的访问,从而提高系统性能。

    Mechanism that provides efficient multi-word load atomicity
    9.
    发明授权
    Mechanism that provides efficient multi-word load atomicity 失效
    提供有效的多字负载原子性的机制

    公开(公告)号:US07296120B2

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

    申请号:US10992436

    申请日:2004-11-18

    IPC分类号: G06F12/00

    摘要: Disclosed is an apparatus, method, and program product that provides atomic, multi-word load support without incurring additional memory utilization. A double-word is atomically loaded without the use of one or more additional fields and without a lock. An invalidity marker is used in connection with a cache miss time to ascertain whether a loaded double-word has been stored and loaded atomically, and is thus, valid.

    摘要翻译: 公开了一种在不引起额外的存储器利用的情况下提供原子,多字负载支持的装置,方法和程序产品。 双字是原子加载的,而不使用一个或多个附加字段而不使用锁。 结合高速缓存未命中时使用无效标记来确定加载的双字是否已被原子地存储和加载,因此是有效的。