会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 41. 发明授权
    • Transparent recovery from hardware memory errors
    • 从硬件内存错误中恢复透明
    • US08443261B2
    • 2013-05-14
    • US12636010
    • 2009-12-11
    • Carl A. WaldspurgerDilpreet BindraGregory HarmPatrick Tullmann
    • Carl A. WaldspurgerDilpreet BindraGregory HarmPatrick Tullmann
    • G06F11/00
    • G06F11/08G06F11/141
    • A method is provided for recovering from an uncorrected memory error located at a memory address as identified by a memory device. A stored hash value for a memory page corresponding to the identified memory address is used to determine the correct data. Because the memory device specifies the location of the corrupted data, and the size of the window where the corruption occurred, the stored hash can be used to verify memory page reconstruction. With the known good part of the data in hand, the hashes of the pages using possible values in place of the corrupted data are calculated. It is expected that there will be a match between the previously stored hash and one of the computed hashes. As long as there is one and only one match, then that value, used in the place of the corrupted data, is the correct value. The corrupt data, once replaced, allows operation of the memory device to continue without needing to interrupt or otherwise affect a system's operation.
    • 提供一种用于从由存储器件识别的存储器地址处的未校正的存储器错误中恢复的方法。 用于与所识别的存储器地址相对应的存储器页的存储的散列值用于确定正确的数据。 由于内存设备指定损坏的数据的位置以及发生损坏的窗口的大小,因此可以使用存储的散列来验证内存页重建。 利用手头已知的很好的部分数据,可以计算使用可能值代替已损坏数据的页面散列。 预期在先前存储的散列和所计算的散列之一将存在匹配。 只要有一个只有一个匹配,那么在损坏的数据的位置使用的值是正确的值。 损坏的数据一旦被更换,就允许存储设备的操作继续进行,而不需要中断或以其他方式影响系统的操作。
    • 42. 发明申请
    • RESOURCE ALLOCATION IN COMPUTERS
    • 资源分配在计算机
    • US20120221732A1
    • 2012-08-30
    • US13460746
    • 2012-04-30
    • Carl A. Waldspurger
    • Carl A. Waldspurger
    • G06F15/16
    • G06F3/0631G06F3/0604G06F3/0653G06F3/0683G06F9/4881G06F9/5016H04L41/5054H04L43/04H04L43/08H04L47/76
    • A method and tangible medium embodying code for allocating resource units of an allocatable resource among a plurality of clients in a computer is described. In the method, resource units are initially distributed among the clients by assigning to each of the clients a nominal share of the allocatable resource. For each client, a current allocation of resource units is determined. A metric is evaluated for each client, the metric being a function both of the nominal share and a usage-based factor, the usage-based factor being a function of a measure of resource units that the client is actively using and a measure of resource units that the client is not actively using. A resource unit can be reclaimed from a client when the metric for that client meets a predetermined criterion.
    • 描述了一种体现用于在计算机中的多个客户端中分配可分配资源的资源单元的代码的方法和有形介质。 在该方法中,通过向每个客户端分配可分配资源的标称份额,资源单元最初分布在客户端之间。 对于每个客户端,确定资源单元的当前分配。 针对每个客户端评估度量,度量是名义份额和基于使用的因素的函数,基于使用的因素是客户端正在使用的资源单位的度量的度量和资源的度量 客户端没有积极使用的单位。 当客户端的度量符合预定标准时,可以从客户端回收资源单元。
    • 43. 发明授权
    • Quality of service management
    • 服务质量管理
    • US08127014B2
    • 2012-02-28
    • US13009978
    • 2011-01-20
    • Ajay GulatiIrfan AhmadCarl A. Waldspurger
    • Ajay GulatiIrfan AhmadCarl A. Waldspurger
    • G06F15/173G06F15/16G06F5/00G06F9/46
    • G06F9/52
    • A method and system for providing quality of service to a plurality of hosts accessing a common resource is described. According to one embodiment, a plurality of IO requests is received from clients executing as software entities on one of the hosts. An IO request queue for each client is separately managed, and an issue queue is populated based on contents of the IO request queues. When a host issue queue is not full, a new IO request is entered into the host issue queue and is issued to the common resource. A current average latency observed at the host is calculated, and an adjusted window size is calculated at least in part based on the current average latency. The window size of the issue queue is adjusted according to the calculated window size.
    • 描述了一种用于向接入公共资源的多个主机提供服务质量的方法和系统。 根据一个实施例,从作为主机之一上的软件实体执行的客户端接收到多个IO请求。 每个客户端的IO请求队列被单独管理,并且基于IO请求队列的内容填充问题队列。 当主机发出队列未满时,将向主机发出队列中输入新的IO请求,并发布给公共资源。 计算在主机处观察到的当前平均延迟,并且基于当前平均延迟至少部分地计算调整的窗口大小。 根据计算的窗口大小调整问题队列的窗口大小。
    • 44. 发明申请
    • Online Computation of Cache Occupancy and Performance
    • 缓存占用率和性能的在线计算
    • US20100095300A1
    • 2010-04-15
    • US12251108
    • 2008-10-14
    • Richard WestPuneet ZarooCarl A. WaldspurgerXiao ZhangHaoqiang Zheng
    • Richard WestPuneet ZarooCarl A. WaldspurgerXiao ZhangHaoqiang Zheng
    • G06F9/50G06F9/46
    • G06F9/50G06F9/5005G06F9/5011G06F9/5016G06F9/5022G06F9/5027G06F9/5033G06F9/5044G06F9/505G06F9/5055G06F11/3409G06F11/3442G06F11/3452G06F11/3466G06F12/08G06F12/0802G06F12/0804G06F12/0806G06F12/0815G06F12/084G06F2201/88
    • Methods, computer programs, and systems for managing thread performance in a computing environment based on cache occupancy are provided. In one embodiment, a computer implemented method assigns a thread performance counter to threads being created to measure the number of cache misses for the threads. The thread performance counter is deduced in one embodiment based on performance counters associated with each core in a processor. The method further calculates a self-thread value as the change in the thread performance counter of a given thread during a predetermined period, and an other-thread value as the sum of all the changes in the thread performance counters for all threads except for the given thread. Further, the method estimates a cache occupancy for the given thread based on a previous occupancy for the given thread, and the calculated shelf-thread and other-thread values. The estimated cache occupancy is used to assign computing environment resources to the given thread. In another embodiment, cache miss-rate curves are constructed for a thread to help analyze performance tradeoffs when changing cache allocations of the threads in the system.
    • 提供了基于缓存占用的用于在计算环境中管理线程性能的方法,计算机程序和系统。 在一个实施例中,计算机实现的方法为正在创建的线程分配线程性能计数器以测量线程的高速缓存未命中的数量。 基于与处理器中的每个核心相关联的性能计数器,在一个实施例中推导出线程性能计数器。 该方法进一步计算自线程值作为在预定时段期间给定线程的线程性能计数器的变化,而另一线程值作为所有线程的线程性能计数器的所有变化之和除外 给线程 此外,该方法基于给定线程的先前占用以及所计算的架线和其他线程值来估计给定线程的高速缓存占用。 估计的高速缓存占用率用于将计算环境资源分配给给定的线程。 在另一个实施例中,为线程构建高速缓存未命中率曲线,以帮助在改变系统中的线程的高速缓存分配时分析性能权衡。
    • 45. 发明授权
    • Transparent sharing of memory pages using content comparison
    • 使用内容比较透明共享内存页面
    • US07620766B1
    • 2009-11-17
    • US10881817
    • 2004-06-30
    • Carl A. Waldspurger
    • Carl A. Waldspurger
    • G06F12/02
    • G06F12/1018G06F12/1036G06F12/109G06F2212/151
    • A computer system has one or more software contexts that share use of a memory that is divided into units such as pages. In the preferred embodiment of the invention, the contexts are, or include, virtual machines running on a common hardware platform. The contents, as opposed to merely the addresses or page numbers, of virtual memory pages that are accessible to one or more contexts are examined. If two or more context pages are identical, then their memory mappings are changed to point to a single, shared copy of the page in the hardware memory, thereby freeing the memory space taken up by the redundant copies. The shared copy is then preferably marked copy-on-write. Sharing is preferably dynamic, whereby the presence of redundant copies of pages is preferably determined by hashing page contents and performing full content comparisons only when two or more pages hash to the same key.
    • 计算机系统具有共享使用被划分为诸如页面的单元的存储器的一个或多个软件上下文。 在本发明的优选实施例中,上下文是或包括在通用硬件平台上运行的虚拟机。 检查与一个或多个上下文可访问的虚拟存储器页面的内容(而不仅仅是地址或页码)。 如果两个或多个上下文页面相同,则将其内存映射更改为指向硬件存储器中页面的单个共享副本,从而释放由冗余副本占用的内存空间。 共享副本然后优选地被标记为写时复制。 共享优选是动态的,由此,仅当两个或更多个页面散列到相同的密钥时,优选地通过散列页面内容并执行全部内容比较来确定页面的冗余副本。
    • 49. 发明授权
    • Quality of service management
    • 服务质量管理
    • US07912951B2
    • 2011-03-22
    • US12260054
    • 2008-10-28
    • Ajay GulatiIrfan AhmadCarl A. Waldspurger
    • Ajay GulatiIrfan AhmadCarl A. Waldspurger
    • G06F15/173G06F13/28G06F9/46
    • G06F9/52
    • A method and system for providing quality of service to a plurality of hosts accessing a common resource is described. According to one embodiment, a plurality of IO requests is received from clients executing as software entities on one of the hosts. An IO request queue for each client is separately managed, and an issue queue is populated based on contents of the IO request queues. When a host issue queue is not full, a new IO request is entered into the host issue queue and is issued to the common resource. A current average latency observed at the host is calculated, and an adjusted window size is calculated at least in part based on the current average latency. The window size of the issue queue is adjusted according to the calculated window size.
    • 描述了一种用于向接入公共资源的多个主机提供服务质量的方法和系统。 根据一个实施例,从作为主机之一上的软件实体执行的客户端接收到多个IO请求。 每个客户端的IO请求队列被单独管理,并且基于IO请求队列的内容填充问题队列。 当主机发出队列未满时,将向主机发出队列中输入新的IO请求,并发布给公共资源。 计算在主机处观察到的当前平均延迟,并且基于当前平均延迟至少部分地计算经调整的窗口大小。 根据计算的窗口大小调整问题队列的窗口大小。