Patents by Inventor Longxiao Li

Longxiao Li has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 12282655
    Abstract: A method for adaptive mapping for data compression includes determining an input/output (I/O) request pattern, dynamically switching between a segment mapping mode and a flat hash table mapping mode based on the determined I/O request pattern, updating a shared mapping table for the segment mapping mode and the flat hash table mapping mode, and adjusting an entry of the mapping table based on the determined I/O request pattern and a status of the entry.
    Type: Grant
    Filed: February 2, 2023
    Date of Patent: April 22, 2025
    Assignee: Lemon Inc.
    Inventors: Ping Zhou, Longxiao Li, Peng Xu, Kan Frankie Fan, Chaohong Hu, Fei Liu, Hui Zhang, Di Xu
  • Patent number: 12204750
    Abstract: The present disclosure describes techniques of metadata management for transparent block level compression. A first area may be created in a backend solid state drive. The first area may comprise a plurality of entries. The plurality of entries may be indexed by addresses of a plurality of blocks of uncompressed data. Each of the plurality of entries comprises a first part configured to store metadata and a second part configured to store compressed data. Each of the plurality blocks of uncompressed data may be compressed individually to generate a plurality of compressed blocks. Metadata and at least a portion of compressed data associated with each of the plurality of compressed blocks may be stored in one of the plurality of entries based on an address of a corresponding block of uncompressed data. A second area may be created in the backend solid state drive for storing the rest of the compressed data.
    Type: Grant
    Filed: September 26, 2022
    Date of Patent: January 21, 2025
    Assignee: Lemon Inc.
    Inventors: Ping Zhou, Chaohong Hu, Kan Frankie Fan, Fei Liu, Longxiao Li, Hui Zhang
  • Patent number: 12204777
    Abstract: Systems and methods for space allocation for block device compression are provided. In particular, a computing device may receive an allocation request to write the compressed data, select a range list adequate for serving the allocation request from a plurality of range list, dequeue a range entry from the selected range list to allocate free space for the compressed data, and allocate the free space corresponding to the range entry to the compressed data to serve the allocation request.
    Type: Grant
    Filed: March 21, 2023
    Date of Patent: January 21, 2025
    Assignee: Lemon Inc.
    Inventors: Ping Zhou, Kan Frankie Fan, Chaohong Hu, Longxiao Li, Hui Zhang, Fei Liu
  • Patent number: 12189969
    Abstract: A system and method are described to efficiently allocate memory space with low latency overhead by allocating blocks of non-volatile memory on a storage device according to a tree data structure comprising a plurality of counter sets, each counter set including one or a plurality of counters indicating numbers of unallocated blocks of memory space within the non-volatile memory.
    Type: Grant
    Filed: December 15, 2022
    Date of Patent: January 7, 2025
    Assignee: LEMON INC.
    Inventors: Ping Zhou, Kan Frankie Fan, Chaohong Hu, Longxiao Li, Peng Xu, Fei Liu, Hui Zhang
  • Publication number: 20240248625
    Abstract: Systems and methods for accessing block storage devices are provided. In particular, a computing device may receive a write request including an uncompressed data and an uncompressed block address associated with the uncompressed data, generate compressed data by compressing the uncompressed data, determine a plurality of mapping candidates of compressed data blocks in the block storage devices based on the uncompressed block address, select a compressed data block from the plurality of mapping candidates that has sufficient capacity to store the compressed data, write the compressed data to the selected compressed data block, update metadata of the selected compressed data block to link the uncompressed block address to a compressed block address of the selected compressed data block, and write the selected compressed data block back to a respective block storage device of the block storage devices.
    Type: Application
    Filed: January 20, 2023
    Publication date: July 25, 2024
    Inventors: Ping Zhou, Chaohong HU, Kan Frankie Fan, Fei Liu, Longxiao Li, Hui Zhang
  • Publication number: 20240168630
    Abstract: A flat hash table includes a plurality of entries, and each entry includes a hash function index and a usage bitmap. A method for block device level compression mapping using the flat hash table includes compressing uncompressed data to compressed data, retrieving an entry of the flat hash table using an uncompressed block address of the uncompressed data, determining a compressed block address of the compressed data by executing at least one hash function and by determining a hash function in the at least one hash function for mapping the uncompressed block address to the compressed block address that corresponds to a space in a block storage device, storing the compressed data to the space that corresponds to the compressed block address, and updating the hash function index of the entry of the flat hash table with an index indicative of the hash function.
    Type: Application
    Filed: November 18, 2022
    Publication date: May 23, 2024
    Inventors: Ping Zhou, Longxiao Li, Chaohong HU, Fei Liu, Kan Frankie Fan, Hui Zhang
  • Publication number: 20240103722
    Abstract: The present disclosure describes techniques of metadata management for transparent block level compression. A first area may be created in a backend solid state drive. The first area may comprise a plurality of entries. The plurality of entries may be indexed by addresses of a plurality of blocks of uncompressed data. Each of the plurality of entries comprises a first part configured to store metadata and a second part configured to store compressed data. Each of the plurality blocks of uncompressed data may be compressed individually to generate a plurality of compressed blocks. Metadata and at least a portion of compressed data associated with each of the plurality of compressed blocks may be stored in one of the plurality of entries based on an address of a corresponding block of uncompressed data. A second area may be created in the backend solid state drive for storing the rest of the compressed data.
    Type: Application
    Filed: September 26, 2022
    Publication date: March 28, 2024
    Inventors: Ping Zhou, Chaohong Hu, Kan Frankie Fan, Fei Liu, Longxiao Li, Hui Zhang
  • Publication number: 20230229324
    Abstract: Systems and methods for space allocation for block device compression are provided. In particular, a computing device may receive an allocation request to write the compressed data, select a range list adequate for serving the allocation request from a plurality of range list, dequeue a range entry from the selected range list to allocate free space for the compressed data, and allocate the free space corresponding to the range entry to the compressed data to serve the allocation request.
    Type: Application
    Filed: March 21, 2023
    Publication date: July 20, 2023
    Inventors: Ping ZHOU, Kan Frankie FAN, Chaohong HU, Longxiao LI, Hui ZHANG, Fei LIU
  • Publication number: 20230176734
    Abstract: A method for adaptive mapping for data compression includes determining an input/output (I/O) request pattern, dynamically switching between a segment mapping mode and a flat hash table mapping mode based on the determined I/O request pattern, updating a shared mapping table for the segment mapping mode and the flat hash table mapping mode, and adjusting an entry of the mapping table based on the determined I/O request pattern and a status of the entry.
    Type: Application
    Filed: February 2, 2023
    Publication date: June 8, 2023
    Inventors: Ping ZHOU, Longxiao LI, Peng XU, Kan Frankie FAN, Chaohong HU, Fei LIU, Hui ZHANG, Di XU
  • Publication number: 20230122533
    Abstract: A system and method are described to efficiently allocate memory space with low latency overhead by allocating blocks of non-volatile memory on a storage device according to a tree data structure comprising a plurality of counter sets, each counter set including one or a plurality of counters indicating numbers of unallocated blocks of memory space within the non-volatile memory.
    Type: Application
    Filed: December 15, 2022
    Publication date: April 20, 2023
    Inventors: Ping ZHOU, Kan Frankie FAN, Chaohong HU, Longxiao LI, Peng XU, Fei LIU, Hui ZHANG
  • Publication number: 20180357287
    Abstract: A hybrid approach for performing edit distance searching used for fuzzy string searches. A system is disclosed that includes an FPGA (field programmable gate array) appliance, having: a data input manager that receives an m-byte input pattern and loads an n-byte substring of the m-byte input pattern into a first set of registers, and streams input strings of searchable data through a second set of registers; an edit distance calculation engine having an array of processing elements (PEs) implemented using FPGAs coupled to the first and second set of registers, wherein the array of PEs calculate an edit distance for each input string of searchable data relative to n-byte substring; and an output manager that identifies matching input strings having an edit distance less than a threshold, and forwards matching input strings to a CPU for software-based edit distance processing relative to the m-byte input pattern.
    Type: Application
    Filed: June 8, 2018
    Publication date: December 13, 2018
    Inventors: Yang Liu, Longxiao Li, Tong Zhang, Fei Sun, Hao Zhong