会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Interrupt vectoring for optionally architected facilities in computer
systems
    • 用于计算机系统中可选设计的设施的中断向量
    • US5758168A
    • 1998-05-26
    • US634468
    • 1996-04-18
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • G06F9/48G06F11/34G06F9/46
    • G06F9/4812G06F11/3466
    • An exception handler for a computer system, particularly for performance monitoring facilities, employs implementation-dependent steps executed from a kernel extension which is more application-level than kernel level. The implementation-independent kernel is involved only at very minimum level for a prologue to the exception handling routine. First a kernel extension registers an exception with the processor by storing the address of a pointer to a first-level interrupt handler; this address is stored in a location in kernel data storage, in non-paged memory. When an exception condition is reached, state is saved and the address location is checked to see if an exception has been registered. If so, the address is used to go to the first-level interrupt handler, which is at the kernel extension level. The first-level interrupt handler may access a second-level interrupt handler. Only the code which is used to save state and check to see if an exception is registered is in the kernel, and this part of the exception handling code is implementation-independent. i.e., the same for all implementations of this processor architecture.
    • 计算机系统的异常处理程序,特别是性能监视工具的异常处理程序,采用从内核扩展执行的实现相关步骤,该内核扩展程序的应用程序级别高于内核级别。 独立于实现的内核仅在非常低的级别涉及异常处理例程的序言。 首先,内核扩展通过将指针的地址存储到第一级中断处理程序来向处理器注册异常; 该地址存储在内核数据存储中的位置,在非分页存储器中。 当达到异常条件时,保存状态并检查地址位置以查看是否已经注册了异常。 如果是这样,那么这个地址就被用来到内核扩展级的第一级中断处理程序。 第一级中断处理程序可以访问第二级中断处理程序。 只有用于保存状态并检查异常是否被注册的代码在内核中,而这部分异常处理代码是独立于实现的。 即对于该处理器架构的所有实现都是相同的。
    • 3. 发明授权
    • Method for improving the performance of database loggers using agent coordination
    • 使用代理协调来提高数据库记录器性能的方法
    • US07620661B2
    • 2009-11-17
    • US11260623
    • 2005-10-27
    • David William MehaffyJames William Van Fleet
    • David William MehaffyJames William Van Fleet
    • G08F12/00G06F17/30
    • G06F17/30368Y10S707/99953
    • A method for substantially reducing the latency of the database (DB) logging process by removing the agent notification requirement from the DB logger and allowing the DB logger to proceed to the next commit process without the latency of providing each waiting agent a notification that the agent continue their respective processes. When an agent commits a change to persistent storage of the database, the request is received by the logger, which performs the update to the persistent storage. A list of agents waiting on the completion of the commit process is compiled by the logger. The list of agents is provided to and provided to the next committing agent. The next committing agent then notifies the waiting agents that they are able to proceed with their respective processing. The logger may immediately perform the next update to persistent memory without utilizing a substantial amount of time notifying the waiting agents.
    • 一种通过从DB记录器中删除代理通知要求并允许DB记录器继续进行下一个提交进程而大大减少数据库(DB)日志记录进程的延迟的方法,而不会为每个等待代理提供通知代理 继续各自的进程。 当代理人对数据库的持久存储进行更改时,该记录器将接收该请求,该记录器将执行对持久存储的更新。 在完成提交进程时等待的代理程序列表由记录器编译。 代理列表提供给并提供给下一个提交代理。 然后下一个提交代理通知等待代理人他们能够进行各自的处理。 记录器可以立即对持久存储器执行下一次更新,而不用大量时间通知等待代理。
    • 4. 发明授权
    • System and method for measuring latch contention
    • 用于测量闩锁争用的系统和方法
    • US07318220B2
    • 2008-01-08
    • US10798905
    • 2004-03-11
    • David William MehaffyJames William Van Fleet
    • David William MehaffyJames William Van Fleet
    • G06F9/44
    • G06F9/526Y10S707/99938
    • A system and method is provided for measuring lock usage in a non-intrusive manner. Measurements are performed only when a lock is contended. When a lock is requested and the lock is available (i.e., is not contended), the only data gathered is a counter that is incremented to keep track of the number of times the particular lock was requested. When a lock is contended, an operating system trace hook is requested. The trace hook records data such as the timestamp that the requestor requested the lock, the request count, a stack traceback to identify the function corresponding to the requestor, and the address of the lock that was requested. Post-operative processing analyzes the recorded trace hook data to identify contended locks and processes that may not be efficiently using locks.
    • 提供了一种用于以非侵入方式测量锁使用的系统和方法。 仅当锁定时才进行测量。 当请求锁并且锁可用时(即不竞争),所收集的唯一数据是递增的计数器以跟踪特定锁被请求的次数。 当有争议时,需要一个操作系统跟踪钩。 跟踪钩子记录诸如请求者请求锁定的时间戳,请求计数,用于标识与请求者相对应的功能的堆栈追溯以及所请求的锁的地址的数据。 手术后处理分析记录的跟踪钩数据,以识别可能无法有效使用锁的竞争锁和进程。
    • 6. 发明授权
    • Interrupt vectoring for instruction address breakpoint facility in
computer systems
    • 计算机系统中指令地址断点设备的中断向量
    • US5790846A
    • 1998-08-04
    • US634712
    • 1996-04-18
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • G06F9/48G06F11/34G06F9/46
    • G06F9/4812G06F11/3466
    • An exception handler for a computer system, particularly for performance monitoring facilities, employs implementation-dependent steps executed from a kernel extension which is more application-level than kernel level. The implementation-independent kernel is involved only at very minimum level for a prologue to the exception handling routine. First, a kernel extension registers an exception with the processor by storing the address of a pointer to a first-level interrupt handler; this address is stored in a location in kernel data storage, in non-paged memory. When an exception condition is reached, state is saved and the address location is checked to see if an exception has been registered. If so, the address is used to go to the first-level interrupt handler, which is at the kernel extension level. The first-level interrupt handler may access a second-level interrupt handler. Only the code which is used to save state and check to see if an exception is registered is in the kernel, and this part of the exception handling code is implementation-independent. i.e., the same for all implementations of this processor architecture.
    • 计算机系统的异常处理程序,特别是性能监视工具的异常处理程序,采用从内核扩展执行的实现相关步骤,该内核扩展程序的应用程序级别高于内核级别。 独立于实现的内核仅在非常低的级别涉及异常处理例程的序言。 首先,内核扩展通过将指针的地址存储到第一级中断处理程序来向处理器注册异常; 该地址存储在内核数据存储中的位置,在非分页存储器中。 当达到异常条件时,保存状态并检查地址位置以查看是否已经注册了异常。 如果是这样,那么这个地址就被用来到内核扩展级的第一级中断处理程序。 第一级中断处理程序可以访问第二级中断处理程序。 只有用于保存状态并检查异常是否被注册的代码在内核中,而这部分异常处理代码是独立于实现的。 即对于该处理器架构的所有实现都是相同的。
    • 7. 发明授权
    • Method and apparatus for controlling access to data structures without
the use of locks
    • 用于在不使用锁的情况下控制对数据结构的访问的方法和装置
    • US5873116A
    • 1999-02-16
    • US754352
    • 1996-11-22
    • James William Van Fleet
    • James William Van Fleet
    • G06F9/46G06F12/00G06F7/00
    • G06F9/52Y10S707/99938
    • A method and system for altering data contained in a structure without requiring a lock to the structure itself. The method and apparatus retrieve a pointer to the structure from a location responsible for maintaining a pointer to the structure. The structure has a reference count for indicating processes that are currently using the data residing within the structure itself. The reference count is then atomically incremented and a new structure is obtained. The data contained in the structure, to be altered, is then copied to the new structure. The new structure also has a reference count for indicating processes that are currently using the data residing in the new structure. The reference count of the new structure is then set to indicate that a single process is accessing the new structure. Thereafter, the pointer in the responsible location for the structure, to be altered, is atomically replaced with a pointer to the new structure. The reference count of the new structure is then set to indicate that the single process is no longer accessing the new structure.
    • 用于改变包含在结构中的数据而不需要对结构本身的锁定的方法和系统。 该方法和装置从负责维护指向结构的指针的位置检索到结构的指针。 该结构具有用于指示正​​在使用驻留在结构本身内的数据的进程的引用计数。 引用计数然后被原子地递增,并获得一个新的结构。 然后将要更改的结构中包含的数据复制到新结构中。 新结构还具有用于指示正​​在使用驻留在新结构中的数据的进程的引用计数。 然后将新结构的引用计数设置为指示单个进程正在访问新结构。 此后,要更改的结构的负责位置中的指针将被替换为指向新结构的指针。 然后将新结构的引用计数设置为指示单个进程不再访问新结构。
    • 9. 发明授权
    • System and method for measuring latch contention
    • 用于测量闩锁争用的系统和方法
    • US08010948B2
    • 2011-08-30
    • US11935371
    • 2007-11-05
    • David William MehaffyJames William Van Fleet
    • David William MehaffyJames William Van Fleet
    • G06F9/44
    • G06F9/526Y10S707/99938
    • A system and method is provided for measuring lock usage in a non-intrusive manner. Measurements are performed only when a lock is contended. When a lock is requested and the lock is available (i.e., is not contended), the only data gathered is a counter that is incremented to keep track of the number of times the particular lock was requested. When a lock is contended, an operating system trace hook is requested. The trace hook records data such as the timestamp that the requester requested the lock, the request count, a stack traceback to identify the function corresponding to the requester, and the address of the lock that was requested. Post-operative processing analyzes the recorded trace hook data to identify contended locks and processes that may not be efficiently using locks.
    • 提供了一种用于以非侵入方式测量锁使用的系统和方法。 仅当锁定时才进行测量。 当请求锁并且锁可用时(即不竞争),所收集的唯一数据是递增的计数器以跟踪特定锁被请求的次数。 当有争议时,需要一个操作系统跟踪钩。 跟踪钩子记录数据,例如请求者请求锁定的时间戳,请求计数,用于标识与请求者相对应的功能的堆栈追溯以及所请求的锁的地址。 手术后处理分析记录的跟踪钩数据,以识别可能无法有效使用锁的竞争锁和进程。
    • 10. 发明授权
    • Interupt vectoring for trace exception facility in computer systems
    • 计算机系统中的跟踪异常设备的中断向量
    • US5963737A
    • 1999-10-05
    • US634467
    • 1996-04-18
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • Bruce Gerard MealeyJames William Van FleetMichael Stephen Williams
    • G06F9/32G06F11/34G06F9/00
    • G06F9/32G06F11/3466
    • An exception handler for a computer system, particularly for performance monitoring facilities, employs implementation-dependent steps executed from a kernel extension which is more application level than kernel level. The implementation-independent kernel is involved only at very minimum level for a prologue to the exception handling routine. First a kernel extension registers an exception with the processor by storing the address of a pointer to a first-level interrupt handler; this address is stored in a location in kernel data storage, in non-paged memory. When an exception condition is reached, state is saved and the address location is checked to see if an exception has been registered. If so, the address is used to go to the first-level interrupt handler, which is at the kernel extension level. The first-level interrupt handler may access a second-level interrupt handler. Only the code which is used to save state and check to see if an exception is registered is in the kernel, and this part of the exception handling code is implementation-independent. i.e., the same for all implementations of this processor architecture.
    • 计算机系统的异常处理程序,特别是性能监视工具的异常处理程序,采用从内核扩展执行的实现相关步骤,该内核扩展程序的应用级别高于内核级别。 独立于实现的内核仅在非常低的级别涉及异常处理例程的序言。 首先,内核扩展通过将指针的地址存储到第一级中断处理程序来向处理器注册异常; 该地址存储在内核数据存储中的位置,在非分页存储器中。 当达到异常条件时,保存状态并检查地址位置以查看是否已经注册了异常。 如果是这样,那么这个地址就被用来到内核扩展级的第一级中断处理程序。 第一级中断处理程序可以访问第二级中断处理程序。 只有用于保存状态并检查异常是否被注册的代码在内核中,而这部分异常处理代码是独立于实现的。 即对于该处理器架构的所有实现都是相同的。