利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

10 条记录 (耗时 0.023 秒)

    I/O BANDWIDTH REDUCTION USING STORAGE-LEVEL COMMON PAGE INFORMATION
    2.
    发明申请
    I/O BANDWIDTH REDUCTION USING STORAGE-LEVEL COMMON PAGE INFORMATION 有权
    使用存储级别的通用页面信息进行I / O带宽减少

    公开(公告)号：US20110271010A1

    公开(公告)日：2011-11-03

    申请号：US12771934

    申请日：2010-04-30

    申请人： Deepak Kenchammana ,  Michael R. Eisler ,  Arthur F. Lent ,  Rahul Iyer ,  Shravan Gaonkar

    发明人： Deepak Kenchammana ,  Michael R. Eisler ,  Arthur F. Lent ,  Rahul Iyer ,  Shravan Gaonkar

    IPC分类号： G06F15/173

    CPC分类号： H04L67/42 ,  G06F3/06 ,  G06F12/0284 ,  G06F12/0866 ,  G06F12/10 ,  G06F2212/656 ,  H04L67/1097

    摘要： I/O bandwidth reduction using storage-level common page information is implemented by a storage server, in response to receiving a request from a client for a page stored at a first virtual address, determining that the first virtual address maps to a page that is a duplicate of a page stored at a second virtual address or that the first and second virtual addresses map to a deduplicated page within a storage system, and transmitting metadata to the client mapping the first virtual address to a second virtual address that also maps to the deduplicated page. For one embodiment, the metadata is transmitted in anticipation of a request for the redundant/deduplicated page via the second virtual address. For an alternate embodiment, the metadata is sent in response to a determination that a page that maps to the second virtual address was previously sent to the client.

    摘要翻译： 响应于从客户端接收针对存储在第一虚拟地址处的页面的请求，由存储服务器实现使用存储级公用页面信息的I / O带宽减少，确定第一虚拟地址映射到 存储在第二虚拟地址处的页面的副本，或者所述第一和第二虚拟地址映射到存储系统内的重复数据删除的页面，以及向所述客户端发送元数据，所述客户端将所述第一虚拟地址映射到也映射到所述第二虚拟地址的第二虚拟地址 重复数据删除的页面。 对于一个实施例，在预期通过第二虚拟地址对冗余/重复数据删除页面的请求的情况下发送元数据。 对于替代实施例，响应于将映射到第二虚拟地址的页面先前发送到客户端的确定来发送元数据。

    Method and system for securely capturing workloads at a live network for replaying at a test network
    3.
    发明授权
    Method and system for securely capturing workloads at a live network for replaying at a test network 有权
    用于在实时网络中安全捕获工作负载以在测试网络重播的方法和系统

    公开(公告)号：US08751450B1

    公开(公告)日：2014-06-10

    申请号：US13095740

    申请日：2011-04-27

    申请人： Shravan Gaonkar ,  Shankar Pasupathy ,  Kiran Srinivasan ,  Prashanth Radhakrishnan ,  Garth Goodson ,  Scott Dawkins

    发明人： Shravan Gaonkar ,  Shankar Pasupathy ,  Kiran Srinivasan ,  Prashanth Radhakrishnan ,  Garth Goodson ,  Scott Dawkins

    IPC分类号： G06F17/30

    CPC分类号： H04L43/10 ,  G06F11/30 ,  G06F11/3414 ,  G06F11/3495 ,  G06F17/30575 ,  G06F21/00 ,  H04L43/08 ,  H04L43/50

    摘要： Methods and system for securely capturing workloads at a live network for replaying at a test network. The disclosed system captures file system states and workloads of a live server at the live network. In one embodiment the captured data is anonymized to protect confidentiality of the data. A file system of a test server at the test network is mirrored from a captured state of the live server. An anonymized version of the captured workloads is replayed as a request to the test server. A lost or incomplete command is recreated from the states of the live server. An order of the commands during replay can be based on an order in the captured workload, or based on a causal relationship. Performance characteristics of the live network are determined based on the response to the replayed command.

    摘要翻译： 用于在实时网络中安全捕获工作负载以在测试网络重播的方法和系统。 所公开的系统捕获实时网络上的实时服务器的文件系统状态和工作负载。 在一个实施例中，捕获的数据被匿名化以保护数据的机密性。 测试网络上的测试服务器的文件系统从实时服务器的捕获状态进行镜像。 捕获的工作负载的匿名版本作为对测试服务器的请求被重播。 从实时服务器的状态重新创建丢失或不完整的命令。 重放期间命令的顺序可以基于捕获的工作负载中的顺序，或者基于因果关系。 基于对重播命令的响应确定实时网络的性能特征。

    Mapping of logical start addresses to physical start addresses in a system having misalignment between logical and physical data blocks
    4.
    发明授权
    Mapping of logical start addresses to physical start addresses in a system having misalignment between logical and physical data blocks 有权
    将逻辑起始地址映射到具有逻辑和物理数据块之间的对准的系统中的物理起始地址

    公开(公告)号：US08578126B1

    公开(公告)日：2013-11-05

    申请号：US12608901

    申请日：2009-10-29

    申请人： Shravan Gaonkar ,  Rahul Iyer ,  Deepak Kenchammana

    发明人： Shravan Gaonkar ,  Rahul Iyer ,  Deepak Kenchammana

    IPC分类号： G06F12/10

    CPC分类号： G06F3/0665 ,  G06F3/0607 ,  G06F3/061 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0689

    摘要： An alignment data structure is used to map a logical data block start address to a physical data block start address dynamically, to service a client data access request. A separate alignment data structure can be provided for each data object managed by the storage system. Each such alignment data structure can be stored in, or referenced by a pointer in, the inode of the corresponding data object. A consequence of the mapping is that certain physical storage medium regions are not mapped to any logical data blocks. These unmapped regions may be visible only to the file system layer and layers that reside between the file system layer and the mass storage subsystem. They can be used, if desired, to store system information, i.e., information that is not visible to any storage client.

    摘要翻译： 对齐数据结构用于动态地将逻辑数据块起始地址映射到物理数据块起始地址，以服务客户端数据访问请求。 可以为由存储系统管理的每个数据对象提供单独的对齐数据结构。 每个这样的对齐数据结构可以存储在相应数据对象的inode中或由指针引用。 映射的结果是某些物理存储介质区域未映射到任何逻辑数据块。 这些未映射的区域可能只对文件系统层和位于文件系统层和大容量存储子系统之间的层可见。 如果需要，可以使用它们来存储系统信息，即对于任何存储客户端都不可见的信息。

    Virtual machine dependency
    5.
    发明授权
    Virtual machine dependency 有权
    虚拟机依赖

    公开(公告)号：US08910156B1

    公开(公告)日：2014-12-09

    申请号：US13097813

    申请日：2011-04-29

    申请人： Deepak Kenchammana-Hosekote ,  Eric Paul Forgette ,  Shravan Gaonkar

    发明人： Deepak Kenchammana-Hosekote ,  Eric Paul Forgette ,  Shravan Gaonkar

    IPC分类号： G06F9/455

    CPC分类号： G06F9/45533 ,  G06F9/455 ,  G06F9/45558 ,  G06F17/30233 ,  G06F2009/45566

    摘要： One or more techniques and/or systems are provided for describing virtual machine dependencies. In particular, data objects, such as virtual hard drives, associated with virtual machines may be identified and/or examined to identify data structures, such as configuration files, comprising configuration data. The configuration data may be analyzed to determine dependency relationships between virtual machines to describe virtual machine dependencies. Identifying virtual machine dependencies, among other things, allows virtual machines that are no longer used to be repurposed, deleted, reset, etc. with little to no adverse effect on other virtual machines.

    摘要翻译： 提供一个或多个技术和/或系统来描述虚拟机依赖性。 特别地，可以识别和/或检查与虚拟机相关联的数据对象，例如虚拟硬盘驱动器，以识别包括配置数据的数据结构，例如配置文件。 可以分析配置数据以确定虚拟机之间的依赖关系以描述虚拟机依赖性。 识别虚拟机相关性，除其他外，允许不再使用的虚拟机被重新利用，删除，重置等，对其他虚拟机几乎没有任何不利影响。

    Methods and Apparatus for Incrementally Computing Similarity of Data Sources
    6.
    发明申请
    Methods and Apparatus for Incrementally Computing Similarity of Data Sources 有权
    用于增量计算数据源相似性的方法和装置

    公开(公告)号：US20120158709A1

    公开(公告)日：2012-06-21

    申请号：US12972266

    申请日：2010-12-17

    申请人： Shravan Gaonkar ,  Sagar Dixit

    发明人： Shravan Gaonkar ,  Sagar Dixit

    IPC分类号： G06F17/30

    CPC分类号： G06F17/303 ,  G06F17/30156

    摘要： Methods and systems for efficiently determining a similarity between two or more datasets. In one embodiment, the similarity is determined based on comparing a subset of sorted frequency-weighted blocks from one dataset to a subset of sorted frequency-weighed blocks from another dataset. Data blocks of a dataset are converted into hash values that are frequency-weighted. These frequency-weighted hash values can be compared to frequency-weighted hash values of another dataset to determine a similarity of the two datasets. In another embodiment, upon a change of a block in a subset of the dataset, the similarity value is re-determined without resorting or hashing the blocks of a dataset other than the blocks of the subset, resulting in an increased performance of a similarity comparison. In another embodiment, blocks of a dataset are excluded based on a block-filtering rule to increase the accuracy of the similarity comparison.

    摘要翻译： 用于有效确定两个或多个数据集之间相似度的方法和系统。 在一个实施例中，基于将来自一个数据集的排序的频率加权块的子集与来自另一数据集的排序的频率加权块的子集进行比较来确定相似性。 数据集的数据块被转换为频率加权的哈希值。 这些频率加权散列值可以与另一数据集的频率加权散列值进行比较，以确定两个数据集的相似性。 在另一个实施例中，在数据集的子集中的块的改变之后，重新确定相似性值，而不必借助或散列数据集的不同于子集的块的块，导致相似性比较的性能增加 。 在另一个实施例中，基于块过滤规则排除数据集的块以增加相似性比较的准确性。

    Methods and apparatus for incrementally computing similarity of data sources
    9.
    发明授权
    Methods and apparatus for incrementally computing similarity of data sources 有权
    用于逐步计算数据源相似度的方法和装置

    公开(公告)号：US08364716B2

    公开(公告)日：2013-01-29

    申请号：US12972266

    申请日：2010-12-17

    申请人： Shravan Gaonkar ,  Sagar Dixit

    发明人： Shravan Gaonkar ,  Sagar Dixit

    IPC分类号： G06F17/00

    CPC分类号： G06F17/303 ,  G06F17/30156

    摘要： Methods and systems for efficiently determining a similarity between two or more datasets. In one embodiment, the similarity is determined based on comparing a subset of sorted frequency-weighted blocks from one dataset to a subset of sorted frequency-weighed blocks from another dataset. Data blocks of a dataset are converted into hash values that are frequency-weighted. These frequency-weighted hash values can be compared to frequency-weighted hash values of another dataset to determine a similarity of the two datasets. In another embodiment, upon a change of a block in a subset of the dataset, the similarity value is re-determined without resorting or hashing the blocks of a dataset other than the blocks of the subset, resulting in an increased performance of a similarity comparison. In another embodiment, blocks of a dataset are excluded based on a block-filtering rule to increase the accuracy of the similarity comparison.

    摘要翻译： 用于有效确定两个或多个数据集之间相似度的方法和系统。 在一个实施例中，基于将来自一个数据集的排序的频率加权块的子集与来自另一数据集的排序的频率加权块的子集进行比较来确定相似性。 数据集的数据块被转换为频率加权的哈希值。 这些频率加权散列值可以与另一数据集的频率加权散列值进行比较，以确定两个数据集的相似性。 在另一个实施例中，在数据集的子集中的块的改变之后，重新确定相似性值，而不必借助或散列数据集的不同于子集的块的块，导致相似性比较的性能增加 。 在另一个实施例中，基于块过滤规则排除数据集的块以增加相似性比较的准确性。