会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 11. 发明授权
    • Dynamic prioritization of cache access
    • 高速缓存访​​问的动态优先级
    • US08782346B2
    • 2014-07-15
    • US13586518
    • 2012-08-15
    • Robert H. Bell, Jr.Hong L. HuaWilliam A. MaronMysore S. Srinivas
    • Robert H. Bell, Jr.Hong L. HuaWilliam A. MaronMysore S. Srinivas
    • G06F12/08
    • G06F12/0815
    • Some embodiments of the inventive subject matter are directed to determining that a memory access request results in a cache miss and determining an amount of cache resources used to service cache misses within a past period in response to determining that the memory access request results in the cache miss. Some embodiments are further directed to determining that servicing the memory access request would increase the amount of cache resources used to service cache misses within the past period to exceed a threshold. In some embodiments, the threshold corresponds to reservation of a given amount of cache resources for potential cache hits. Some embodiments are further directed to rejecting the memory access request in response to the determining that servicing the memory access request would increase the amount of cache resources used to service cache misses within the past period to exceed the threshold.
    • 本发明的一些实施例涉及确定存储器访问请求导致高速缓存未命中,并且响应于确定存储器访问请求导致高速缓存而确定用于在过去时段内服务高速缓存未命中的高速缓存资源量 小姐。 一些实施例进一步涉及确定对存储器访问请求的服务将增加用于在过去时间段内服务高速缓存未命中的高速缓存资源的数量超过阈值。 在一些实施例中,阈值对应于用于潜在高速缓存命中的给定量的高速缓存资源的预留。 响应于确定对存储器访问请求的服务会增加在过去时间段内用于服务高速缓存未命中的高速缓存资源的数量超过阈值,一些实施例进一步涉及拒绝存储器访问请求。
    • 12. 发明申请
    • DYNAMIC PRIORITIZATION OF CACHE ACCESS
    • 缓存访问动态优先
    • US20130151788A1
    • 2013-06-13
    • US13323076
    • 2011-12-12
    • Robert H. Bell, JR.Hong L. HuaWilliam A. MaronMysore S. Srinivas
    • Robert H. Bell, JR.Hong L. HuaWilliam A. MaronMysore S. Srinivas
    • G06F12/08
    • G06F12/0815
    • Some embodiments of the inventive subject matter are directed to a cache comprising a tracking unit and cache state machines. In some embodiments, the tracking unit is configured to track an amount of cache resources used to service cache misses within a past period. In some embodiments, each of the cache state machines is configured to, determine whether a memory access request results in a cache miss or cache hit, and in response to a cache miss for a memory access request, query the tracking unit for the amount of cache resources used to service cache misses within the past period. In some embodiments, the each of the cache state machines is configured to service the memory access request based, at least in part, on the amount of cache resources used to service the cache misses within the past period according to the tracking unit.
    • 本发明主题的一些实施例涉及包括跟踪单元和高速缓存状态机的高速缓存。 在一些实施例中,跟踪单元被配置为跟踪用于在过去时间段内服务高速缓存未命中的高速缓存资源的量。 在一些实施例中,每个高速缓存状态机被配置为,确定存储器访问请求是否导致高速缓存未命中或高速缓存命中,并且响应于存储器访问请求的高速缓存未命中,查询跟踪单元的数量 用于在过去一段时间内缓存未命中服务的缓存资源。 在一些实施例中,每个高速缓存状态机被配置为至少部分地基于用于根据跟踪单元在过去时段内服务高速缓存未命中的高速缓存资源的量来服务存储器访问请求。
    • 18. 发明授权
    • Method and system for managing lock contention in a computer system
    • 在计算机系统中管理锁争用的方法和系统
    • US06845504B2
    • 2005-01-18
    • US09779369
    • 2001-02-08
    • Hong L. HuaBret R. OlszewskiMysore S. SrinivasNasr-Eddine Walehiane
    • Hong L. HuaBret R. OlszewskiMysore S. SrinivasNasr-Eddine Walehiane
    • G06F7/00G06F9/46G06F12/00
    • G06F9/526
    • A system and method for efficiently managing lock contention for a central processing unit (CPU) of a computer system. The present invention uses both spinning and blocking (or undispatching) to manage threads when they are waiting to acquire a lock. In addition, the present invention intelligently determines when the program thread should spin and when the program thread should become undispatched. If it is determined that the program thread should become undispatched, the present invention provides efficient undispatching of program threads that improves throughput by reducing wait time to acquire the lock. A lock contention management system includes a dispatcher for managing the execution of threads on CPUs as well as threads that are currently ready to run but not executing because they are waiting for an available CPU, a dispatch management module that determines when a program thread should become undispatched to wait on a lock and when the program thread should spin, and low-priority execution module for undispatching the program thread. The present invention also includes a lock contention management method using the above system.
    • 一种用于有效地管理计算机系统的中央处理单元(CPU)的锁争用的系统和方法。 本发明使用旋转和阻塞(或未分配)来管理线程在等待获取锁定时。 此外,本发明智能地确定程序线程何时旋转以及程序线程何时变为未分配。 如果确定程序线程应该不分配,则本发明提供了通过减少获取锁定的等待时间来提高吞吐量的程序线程的有效的未分配。 锁争用管理系统包括调度器,用于管理CPU上的线程的执行以及当前准备运行但未执行的线程,因为它们正在等待可用的CPU,调度管理模块确定程序线程何时应该成为 未分配等待锁和程序线程应该旋转,而低优先级的执行模块用于对程序线程进行分配。 本发明还包括使用上述系统的锁争用管理方法。