中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

13 records (took 0.023 seconds)

    Compressed pages having data and compression metadata
    1.
    发明授权
    Compressed pages having data and compression metadata 有权

    公开(公告)号：US10963377B2

    公开(公告)日：2021-03-30

    申请号：US16096582

    申请日：2016-04-29

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Shankar Iyer ,  Srinivasa D Murthy ,  Siamak Nazari ,  Gilad Sade

    IPC: G06F12/08 ,  G06F12/0802 ,  G06F12/0886 ,  G06F12/1009 ,  G06F12/0897

    Abstract: Examples include compressed pages having data and compression metadata. Some examples include receiving a write request containing write data, storing the write data in data cache, and applying a page fit process to the write data. In some such examples, a virtual page table entry in a virtual page table may be generated for the processed write data. The virtual page table entry may include a compression index and a page address. An inline compression of the processed write data may be performed to compress and store the processed write data in a compressed page at a location associated with the compression index. In some examples, the compressed page may include a compression metadata having a reference count, a compressed page offset, and a virtual page address.

    COMPRESSED PAGES HAVING DATA AND COMPRESSION METADATA
    2.
    发明申请
    COMPRESSED PAGES HAVING DATA AND COMPRESSION METADATA 审中-公开

    公开(公告)号：US20190138446A1

    公开(公告)日：2019-05-09

    申请号：US16096582

    申请日：2016-04-29

    Applicant: Hewlett Packard Enterprise Development LP

    Inventor： Shankar Iyer ,  Srinivasa D Murthy ,  Siamak Nazari ,  Gilad Sade

    IPC: G06F12/0802

    Abstract: Examples include compressed pages having data and compression metadata. Some examples include receiving a write request containing write data, storing the write data in data cache, and applying a page fit process to the write data. In some such examples, a virtual page table entry in a virtual page table may be generated for the processed write data. The virtual page table entry may include a compression index and a page address. An inline compression of the processed write data may be performed to compress and store the processed write data in a compressed page at a location associated with the compression index. In some examples, the compressed page may include a compression metadata having a reference count, a compressed page offset, and a virtual page address.

    Memory space management
    5.
    发明授权
    Memory space management 有权

    公开(公告)号：US09946660B2

    公开(公告)日：2018-04-17

    申请号：US15223754

    申请日：2016-07-29

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Shankar Iyer ,  Siamak Nazari ,  Srinivasa D Murthy ,  Jin Wang

    IPC: G06F12/10 ,  G06F12/1009 ,  G06F12/1027 ,  G06F12/02

    CPC classification number: G06F12/1009 ,  G06F12/023 ,  G06F12/0246 ,  G06F12/1027 ,  G06F2212/1044 ,  G06F2212/65 ,  G06F2212/68

    Abstract: Examples include a device for memory space management. Some examples include receiving, from a host, a space management request that identifies a virtual page address. The virtual page address may be associated with a compressed page that includes a compression metadata having a reference count that indicates a number of virtual pages of data in the compressed page. The virtual page table entry associated with the virtual page address in a virtual page table may be looked up. The virtual page table entry may identify the compressed page. In such examples, the virtual page table entry may be marked as invalid without updating the reference count in the compressed page. A determination may be made as to whether each virtual page table entry that identifies the compressed page is marked invalid. Based on the determination that each virtual page table entry that identifies the compressed page is invalid, a free space bitmap entry for the compressed page may be updated to indicate that the compressed page is free.

    DETERMINING LENGTHS OF ACKNOWLEDGMENT DELAYS FOR I/O COMMANDS
    7.
    发明申请
    DETERMINING LENGTHS OF ACKNOWLEDGMENT DELAYS FOR I/O COMMANDS 审中-公开
    确定I / O命令的确认延迟的长度

    公开(公告)号：US20170038972A1

    公开(公告)日：2017-02-09

    申请号：US15305156

    申请日：2014-04-30

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Siamak Nazari ,  Srinivasa D Murthy ,  Jin Wang ,  Ming Ma

    IPC: G06F3/06 ,  G06F12/0875

    Abstract: Example implementations relate to determining lengths of acknowledgment delays for input/output (I/O) commands. In example implementations, a length of an acknowledgment delay for a respective I/O command may be based on cache availability, and activity level of a drive at which the respective I/O command is directed, after the respective I/O command has been executed. Acknowledgments for respective I/O commands may be transmitted after respective periods of time equal to respective lengths of acknowledgment delays have elapsed.

    Abstract translation: 示例实现涉及确定用于输入/输出（I / O）命令的确认延迟的长度。 在示例实现中，相应I / O命令的确认延迟的长度可以基于各个I / O命令之后的高速缓存可用性和相应的I / O命令所针对的驱动器的活动级别 执行。 各个I / O命令的确认可以在等于相应的确认延迟的长度已经过去的各个时间段之后被发送。

    Storage of a data chunk with a colliding fingerprint
    10.
    发明授权
    Storage of a data chunk with a colliding fingerprint 有权

    公开(公告)号：US10241708B2

    公开(公告)日：2019-03-26

    申请号：US15514075

    申请日：2014-09-25

    Applicant: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP

    Inventor： Jin Wang ,  Siamak Nazari ,  Roopesh Kumar Tamma ,  Srinivasa D Murthy

    IPC: G06F12/00 ,  G06F3/06 ,  G06F16/23 ,  G06F11/08 ,  G06F11/14 ,  G06F16/174

    Abstract: Example implementations relate to data chunk storage. For example, an implementation includes an apparatus that includes a processor. The processor is to receive a first data chunk from a source device and to generate a first fingerprint of the first data chunk. In response to a determination that the first fingerprint matches a second fingerprint of a second data chunk, the processor is to select a storage pool from a plurality of storage pools at a storage device to store the first data chunk based on the first data chunk and based on the second data chunk. The plurality of storage pools includes a first storage pool associated with first particular data chunks with non-colliding fingerprints and a second storage pool associated with second particular data chunks with colliding fingerprints.

Patent Agency Ranking