会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 45. 发明授权
    • Memory management system in a computer system with shared memory mappings
    • 具有共享内存映射的计算机系统中的内存管理系统
    • US08166253B2
    • 2012-04-24
    • US13209261
    • 2011-08-12
    • Anil RaoCarl A. WaldspurgerXiaoxin Chen
    • Anil RaoCarl A. WaldspurgerXiaoxin Chen
    • G06F12/00G06F13/00G06F13/28
    • G06F12/121G06F12/109G06F2212/656
    • A memory management sub-system includes code executable by a processor fir performing selecting a plurality of contexts, and selecting a sample of the separately allocable portions of an address space for each of the contexts. For each of the selected allocable portions, a corresponding portion of the host memory to which the selected allocable portion is mapped is determined, and a count corresponding to a number of separately allocable portions of any context that are commonly mapped to the corresponding portion of the host memory. For each context, a metric is computed that is a function of the counts for that context. Host memory is allocated among the contexts at least in part based on their respective metrics.
    • 存储器管理子系统包括可由执行选择多个上下文的处理器执行的代码,以及为每个上下文选择地址空间的可单独分配的部分的样本。 对于每个所选择的可分配部分,确定所选择的可分配部分映射到的主机存储器的相应部分,并且对应于通常映射到所述可分配部分的相应部分的任何上下文的可分配部分的数量的计数 主机内存 对于每个上下文,计算度量是该上下文计数的函数。 主机内存至少部分地基于它们各自的度量被分配在上下文之中。
    • 46. 发明授权
    • 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请求,并发布给公共资源。 计算在主机处观察到的当前平均延迟,并且基于当前平均延迟至少部分地计算经调整的窗口大小。 根据计算的窗口大小调整问题队列的窗口大小。
    • 49. 发明授权
    • Content-based, transparent sharing of memory units
    • 基于内容,透明共享内存单元
    • US06789156B1
    • 2004-09-07
    • US09915045
    • 2001-07-25
    • Carl A. Waldspurger
    • Carl A. Waldspurger
    • G06F1202
    • G06F12/1018G06F12/1036G06F12/109G06F2212/151
    • A computer system has one or more software context that share use of a memory that is divided into units such as pages. In the preferred embodiment of the invention, the context are, or include, virtual machines running on a common hardware platform. The context, as opposed to merely the addresses or page numbers, of virtual memory pages that 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 ten preferable 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.
    • 计算机系统具有共享使用被划分为诸如页面的单元的存储器的一个或多个软件上下文。 在本发明的优选实施例中,上下文是或包括在公共硬件平台上运行的虚拟机。 检查一个或多个上下文可访问的虚拟存储器页面的上下文(而不仅仅是地址或页码)。 如果两个或多个上下文页面相同,则将其内存映射更改为指向硬件存储器中页面的单个共享副本,从而释放由冗余副本占用的内存空间。 共享副本是十个优选的标记的写时复制。 共享优选是动态的,由此,仅当两个或更多个页面散列到相同的密钥时,优选地通过散列页面内容并执行全部内容比较来确定页面的冗余副本。
    • 50. 发明授权
    • Transparent address remapping for high-speed I/O
    • 透明地址重映射用于高速I / O
    • US06725289B1
    • 2004-04-20
    • US10124783
    • 2002-04-17
    • Carl A. WaldspurgerMichael NelsonKinshuk Govil
    • Carl A. WaldspurgerMichael NelsonKinshuk Govil
    • G06F1200
    • G06F12/1081
    • A subsystem that is able to address a second memory region initiates I/O requests directed to a device that is able to address a first memory region that is different from the second memory region. Requests for memory are mapped at least once, for example from virtual to physical page numbers. The I/O requests are conditionally remapped to pages in the first region as a function of how often they are involved in the I/O operations and would normally otherwise need to be copied. Remapping may also be made conditional on a function of availability of memory in the first region. In a preferred embodiment of the invention, the I/O requests are initiated by a subsystem within a virtual machine, which runs via an intermediate software layer such as a virtual machine monitor on an underlying hardware and software platform. A typical application of the invention is DMA.
    • 能够寻址第二存储器区域的子系统启动针对能够寻址不同于第二存储器区域的第一存储器区域的设备的I / O请求。 至少要对存储器的请求进行映射,例如从虚拟到实际的页码。 I / O请求有条件地重新映射到第一个区域中的页面,作为它们参与I / O操作的频率的函数,通常还需要复制。 还可以根据第一区域中的存储器的可用性的功能来进行重新映射。 在本发明的优选实施例中,I / O请求由虚拟机内的子系统发起,虚拟机通过诸如虚拟机监视器的中间软件层在底层硬件和软件平台上运行。 本发明的典型应用是DMA。