公开(公告)号：US09529534B2

公开(公告)日：2016-12-27

申请号：US14304763

申请日：2014-06-13

Applicant: VMware, Inc.

Inventor： Sachin Manpathak ,  Mustafa Uysal ,  Puneet Zaroo ,  Luis Useche

IPC: G06F12/00 ,  G06F3/06 ,  G06F9/50

CPC classification number: G06F3/0611 ,  G06F3/0631 ,  G06F3/0688 ,  G06F9/5016 ,  G06F2209/5022

Abstract: Exemplary methods, apparatuses, and systems determine a miss-rate at various amounts of memory allocation for each of a plurality of workloads running within a computer. A value representing an estimated change in miss-rate for each of the workloads based upon an increase in a current allocation of memory to the workload is determined. The workload with a value representing a greatest improvement in hit rate is selected. Additional memory is allocated to the selected workload.

Abstract translation: 示例性方法，装置和系统以在计算机内运行的多个工作负载中的每一个为各种量的存储器分配来确定错误率。 确定基于当前对存储器对工作负载的分配的增加而表示每个工作负载的估计错误率变化的值。 选择具有代表命中率最大改善的值的工作负载。 额外的内存被分配给所选择的工作负载。

公开(公告)号：US09262192B2

公开(公告)日：2016-02-16

申请号：US14212348

申请日：2014-03-14

Applicant: VMware, Inc.

Inventor： Ajay Gulati ,  Sachin Manpathak ,  Mustafa Uysal ,  Luis Useche

IPC: G06F9/45 ,  G06F9/455 ,  G06F9/50

CPC classification number: G06F9/45533 ,  G06F3/061 ,  G06F3/0656 ,  G06F3/067 ,  G06F9/50

Abstract: Systems and techniques are described for allocating data store queues to virtual machines. A described technique includes allocating a respective queue to each of a plurality of threads, wherein the queue is configured to queue data requests from the respective thread and for a first data store, determining, for each of a plurality of threads, a respective maximum quantity of pending requests for the thread, wherein a quantity of pending requests sent from the respective queue to the first data store is equal to the maximum quantity of pending requests determined for the thread, determining, for each of the threads, a respective current quantity of operations per second, determining, for each of one or more first threads in the plurality of threads, a respective updated quantity of pending requests, and adjusting, for each first thread, the quantity of pending requests of the first thread sent to the first data store.

Abstract translation: 描述了将数据存储队列分配给虚拟机的系统和技术。 所描述的技术包括将相应的队列分配给多个线程中的每一个，其中队列被配置为对来自相应线程和第一数据存储器的数据请求进行排队，为多个线程中的每一个确定相应的最大数量 其中从所述相应队列发送到所述第一数据存储器的待处理请求的数量等于为所述线程确定的所述待决请求的最大数量，为每个所述线程确定相应的当前数量的 每秒的操作，为多个线程中的一个或多个第一个线程中的每个线程确定相应更新的未决请求数量，并且为每个第一线程调整发送到第一数据的第一线程的未决请求的数量 商店。

公开(公告)号：US09329896B2

公开(公告)日：2016-05-03

申请号：US14304752

申请日：2014-06-13

Applicant: VMware, Inc.

Inventor： Sachin Manpathak ,  Mustafa Uysal ,  Puneet Zaroo ,  Ricardo Koller ,  Luis Useche

IPC: G06F12/08 ,  G06F9/50 ,  G06F12/12 ,  G06F12/02 ,  G06F9/455

CPC classification number: G06F9/5016 ,  G06F9/45558 ,  G06F12/023 ,  G06F12/0871 ,  G06F12/122 ,  G06F2009/4557 ,  G06F2009/45583 ,  G06F2209/5022 ,  G06F2212/1024 ,  G06F2212/1044 ,  G06F2212/7202

Abstract: Exemplary methods, apparatuses, and systems receive a first request for a storage address at a first access time. Entries are added to first and second data structures. Each entry includes the storage address and the first access time. The first data structure is sorted in an order of storage addresses. The second data structure is sorted in an order of access times. A second request for the storage address is received at a second access time. The first access time is determined by looking up the entry in first data structure using the storage address received in the second request. The entry in the second data structure is looked up using the determined first access time. A number of entries in second data structure that were subsequent to the second entry is determined. A hit count for a reuse distance corresponding to the determined number of entries is incremented.

Abstract translation: 示例性方法，装置和系统在第一访问时间接收对存储地址的第一请求。 条目被添加到第一和第二数据结构。 每个条目包括存储地址和第一个访问时间。 第一个数据结构按存储地址的顺序进行排序。 第二个数据结构以访问次数的顺序进行排序。 在第二访问时间接收对存储地址的第二请求。 通过使用在第二请求中接收的存储地址查找第一数据结构中的条目来确定第一访问时间。 使用确定的第一访问时间来查找第二数据结构中的条目。 确定在第二个条目之后的第二数据结构中的许多条目。 与确定的条目数相对应的重用距离的命中计数增加。

公开(公告)号：US20150169341A1

公开(公告)日：2015-06-18

申请号：US14212348

申请日：2014-03-14

Applicant: VMware, Inc.

Inventor： Ajay Gulati ,  Sachin Manpathak ,  Mustafa Uysal ,  Luis Useche

IPC: G06F9/455 ,  G06F9/50

CPC classification number: G06F9/45533 ,  G06F3/061 ,  G06F3/0656 ,  G06F3/067 ,  G06F9/50

Abstract: Systems and techniques are described for allocating data store queues to virtual machines. A described technique includes allocating a respective queue to each of a plurality of threads, wherein the queue is configured to queue data requests from the respective thread and for a first data store, determining, for each of a plurality of threads, a respective maximum quantity of pending requests for the thread, wherein a quantity of pending requests sent from the respective queue to the first data store is equal to the maximum quantity of pending requests determined for the thread, determining, for each of the threads, a respective current quantity of operations per second, determining, for each of one or more first threads in the plurality of threads, a respective updated quantity of pending requests, and adjusting, for each first thread, the quantity of pending requests of the first thread sent to the first data store.

Abstract translation: 描述了将数据存储队列分配给虚拟机的系统和技术。 所描述的技术包括将相应的队列分配给多个线程中的每一个，其中队列被配置为对来自相应线程和第一数据存储器的数据请求进行排队，为多个线程中的每一个确定相应的最大数量 其中从所述相应队列发送到所述第一数据存储器的待处理请求的数量等于为所述线程确定的所述待决请求的最大数量，为每个所述线程确定相应的当前数量的 每秒的操作，为多个线程中的一个或多个第一个线程中的每个线程确定相应更新的未决请求数量，并且为每个第一线程调整发送到第一数据的第一线程的未决请求的数量 商店。