Multi-stream Solid State Drive Address Mapping Method Based on Bitmap and Cuckoo Filter

By introducing mobile translation pages, bitmaps, and address mapping methods of cuckoo filters in multi-stream solid-state drives, the problem of low address mapping hit rate in the prior art is solved, and efficient adaptation to multi-stream solid-state drives and Hot and cold data processing improves the performance and life of SSDs.

CN117331860BActive Publication Date: 2024-11-22CHINA ELECTRONICS STANDARDIZATION INST +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202311336785.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-10-16
Publication Date
2024-11-22
Estimated Expiration
2043-10-16

AI Technical Summary

Technical Problem

The existing address mapping method has low hit rate in multi-stream solid-state drives, which causes the SSD master chip to spend a lot of time reading translation tables on flash memory, and has insufficient adaptation to multi-stream functions, affecting performance and life.

Method used

Using the address mapping method based on DFTL structure, the mobile translation page (FTP) is added, and the bitmap and cuckoo filter are used for searching, combined with the auxiliary cache GHOST-CMT to filter logical page numbers with high continuity, improve query speed, and Save FTP index information in DRAM for quick retrieval.

Benefits of technology

It improves the hit rate of address mapping, adapts to multi-stream solid-state drives, effectively distinguishes hot and cold data, improves the performance and life of solid-state drives, reduces write amplification, and improves the efficiency during garbage collection.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117331860B_ABST
    Figure CN117331860B_ABST
Patent Text Reader

Abstract

The present invention discloses a multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter, which belongs to the field of storage. The mapping method is improved based on the DFTL structure, and the mapping entries eliminated by CMT are saved to the mobile translation page (FTP), and two efficient data structures, bitmap and cuckoo filter, are added to retrieve FTP to improve the query speed. In order to better screen LPNs with high continuity from the eliminated mapping entries, GHOST-CMT is introduced to temporarily store the eliminated mapping entries. At the same time, the method adapts to the properties of multi-stream solid-state hard disks, processes cold and hot data differently, and makes better use of cache space. After experimental testing, the present invention improves the hit rate of CMT and the efficiency of GC under the same space, reduces write amplification, and improves the performance and life of SSD.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the field of storage, and more specifically relates to a multi-stream solid state hard disk address mapping method based on a bitmap and a cuckoo filter. Background Art

[0002] With the rapid development of embedded systems and wireless networks, many consumer electronics products, such as smartphones and tablets, have become closely related to our lives. As portable devices, consumer electronics have high requirements for their storage devices. Due to its small size, low power consumption and high access performance, NAND flash memory has become the mainstream storage medium for consumer electronics.

[0003] In consumer electronics, NAND flash memory is widely used to store files and data. Each NAND flash memory can be simply regarded as consisting of blocks, and each block is designed to consist of pages. Due to the special physical characteristics of NAND flash memory, the written data should be erased before new data is written. However, the basic unit of the erase operation is a block, while the basic unit of the read / write operation is a page. The erase operation consumes more time than the read and write operations. In order to obtain better performance, an off-site update scheme needs to be implemented in NAND flash memory. When the data in a specific page needs to be updated, the new data is written to a free page, and then the old page is marked as invalid.

[0004] In order to smoothly perform read and write operations under the out-of-place update scheme, a software layer called Flash Translation Layer (FTL) is used to emulate the NAND flash chip as a block device. The FTL maintains an address mapping table that contains address mapping information between logical addresses and physical addresses so that the file system can operate the NAND flash chip as a block device. When the NAND flash receives the logical address sent by the file system, the FTL obtains the corresponding physical address by querying the address mapping table and reads the requested data from the physical page. When the data in the page is updated, the FTL marks this page as invalid, writes the new data to a new empty page, and finally updates the corresponding mapping entry in the address mapping table.

[0005] Page-level FTLs (PLFTLs) exhibit high access efficiency. However, the address mapping table maintained by PLFTLs is huge. Storing the entire address mapping table in DRAM (dynamic random access memory) may reduce the I / O (input / output) performance of consumer electronics. In order to improve the utilization of the storage space of flash chips and accelerate the conversion of LPN to PPN, DFTL borrows the idea of ​​​​caching and introduces CMT to selectively cache some active page-level mapping entries in DRAM. It saves the entire mapping table on the flash page. Due to temporal locality, DFTL outperforms previous methods. In order to quickly find entries on the flash chip, DFTL saves all LPN mappings into the translation page continuously, but this will cause a mixture of cold and hot entries in the same translation page, resulting in a low CMT hit rate. The low CMT hit rate slows down the conversion from LPN to PPN and reduces the performance of large-capacity SSDs.

[0006] Disadvantages of existing technology:

[0007] Although the existing address mapping method reduces the space occupied by the address cache in DRAM, the elimination mechanism of the CMT cache table is too simple, resulting in a low hit rate. This will cause the main control chip of the solid-state drive to spend a lot of time reading the translation table stored in the flash memory.

[0008] Existing address mapping methods are not optimized and adapted enough for SSDs with multi-stream functions. After adapting the multi-stream function, the SSD can write data with the same or similar life cycle to the same erase unit according to the Stream ID provided by the host, such as processing cold and hot data separately. Multi-stream greatly improves the efficiency of GC and reduces write amplification, which greatly improves the performance and life of the SSD. Summary of the invention

[0009] In view of the problem of low hit rate of current page-level mapping schemes, the present invention provides a solid-state hard disk address mapping method, which can improve the hit rate of address mapping in the same cache space, and at the same time adapt to multi-stream solid-state hard disks, so that the solid-state hard disk can better distinguish between cold and hot data and store them.

[0010] In order to achieve the above object, the present invention is implemented by adopting the following technical scheme: the mapping method is based on the DFTL structure, the mapping method is improved on the basis of the translation page of the DFTL structure, and another mobile translation page FTP is added, and the mapping method saves the mapping entries eliminated by the cache mapping table CMT to the mobile translation page FTP;

[0011] Added two efficient data structures, bitmap and cuckoo filter, to search the mobile translation page FTP to improve the query speed;

[0012] Add an auxiliary cache GHOST-CMT to temporarily store and eliminate mapping entries, which is used to filter logical page numbers LPN with high continuity.

[0013] Furthermore, the data types stored in the translation pages of the FTP and DFTL are consistent and are both stored in the flash memory, but the stored mapping addresses are not necessarily continuous and may be added or deleted according to different situations.

[0014] Furthermore, the mapping method stores the index information of FTP in the dynamic random access memory DRAM, which is defined as FTPI (float translation page index), and is based on the bitmap BIT-FTPI or the cuckoo filter CF-FTPI for fast retrieval of FTP.

[0015] Furthermore, the FTPI includes five fields, namely, MPPN, flag, bitmap or Cuckoo Filter, max_lpn and min_lpn;

[0016] MPPN is the physical page number PPN of FTP, and flag is used to identify FTPI as CF-FTPI and BIT-FTPI;

[0017] max_lpn and min_lpn are the maximum and minimum LPNs of the mapping entries stored in FTP.

[0018] Cuckoo Filter is created by using the fingerprint generated by the hash function of the LPN of the mapping entry stored in FTP;

[0019] BIT-FTPI can directly determine whether LPN is in FTP. If LPN exists in FTP, the (LPN-min_lpn)th bit of BIT-FTPI will be 1, otherwise it will be 0.

[0020] Further, the auxiliary cache GHOST-CMT resides in DRAM and caches newly evicted mapping entries in CMT;

[0021] When Ghost-CMT is fully loaded, the mapping entries with the smallest difference between the maximum LPN and the minimum LPN are aggregated into FTP. When the difference is greater than a certain threshold, CF-FTPI is used, otherwise BIT-FTPI is used, which can minimize the false positive rate.

[0022] Furthermore, the CMT is set to a stream sharing mode. In the same CMT table, one bit needs to be added to the high bit based on the LPN address to distinguish two different data streams stream_0 and stream_1.

[0023] Furthermore, the specific steps of the address mapping method are as follows: first, when accessing a mapping entry, if it is not in the cache CMT or Ghost CMT and is the data stream stream_1, the physical address where its translation page is located is directly retrieved through GTD, and only the required mapping entry is cached into CMT;

[0024] If it is data stream stream_0, it is searched in FTP first, and FTPIs are retrieved one by one to test whether the mapping entry exists in the corresponding FTP;

[0025] If the BITMAP or Cuckoo Filter shows that the LPN exists in a certain FTP, the corresponding FTP will be read to obtain the requested entry;

[0026] If mapping items are found in FTP, all mapping items in FTP will be loaded into CMT;

[0027] If the mapping entry is in STP instead of FTP, then like the DFTL read global mapping table process, it consults GTD to obtain the corresponding STP address containing this mapping entry;

[0028] After reading the STP, only the requested mapping entries are loaded into the CMT and the rest of the entries are discarded;

[0029] When the CMT is full, an entry is evicted to the Ghost-CMT through the least recently used LRU mechanism;

[0030] When Ghost-CMT is full, a fixed number of entries with the smallest difference between the maximum LPN and the minimum LPN are screened out to form FTP and stored in the flash memory.

[0031] Beneficial effects of the present invention:

[0032] 1. The present invention improves the previous address mapping scheme, and saves the mapping entries eliminated by CMT in FTP. When a mapping entry in FTP is read, all the mapping entries of FTP will be cached in CMT again. It combines the characteristics of time and space and improves the hit rate of CMT;

[0033] 2. The present invention designs the FTP index FTPI based on the bitmap and cuckoo filter, uses GHOST_CMT to temporarily CMT, screens the appropriate elimination mapping entries to form FTP, uses BIT-FTPI for FTP with good continuity, and uses CF-FTPI for FTP with slightly poor continuity. The bitmap improves the FTP search efficiency, and the cuckoo filter optimizes the space utilization.

[0034] 3. The present invention is adapted to multi-stream SSD. The solid-state drive processes cold and hot data separately according to the Stream ID provided by the host, makes better use of the cache space, improves the efficiency during GC, reduces write amplification, and improves the performance and life of the SSD. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 It is the overall flow chart of the present invention;

[0036] Figure 2 It is the management flow chart of CMT, GHOST_CMT, FTPI and FTP of the present invention;

[0037] Figure 3 This is a structural diagram of the flash memory area of ​​the present invention;

[0038] Figure 4 This is a structural diagram of the buffer area of ​​the present invention;

[0039] Figure 5 It is a structural diagram of FTP, CF-FTPI and BIT-FTPI of the present invention. DETAILED DESCRIPTION

[0040] In order to facilitate the understanding of the present invention, the present invention will be described more fully below with reference to the relevant drawings. Typical embodiments of the present invention are given in the drawings. However, the present invention can be implemented in many different forms and is not limited to the embodiments described in the present invention. On the contrary, the purpose of providing these embodiments is to make the disclosure of the present invention more thorough and comprehensive.

[0041] Unless otherwise defined, all technical and scientific terms used in the present invention have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention.

[0042] The address mapping method of the present invention is based on the DFTL system framework and has been improved. DFTL stores the entire mapping table on the flash memory chip and only retains some active mapping entries in the CMT (cache mapping table) residing in the DRAM. The DFTL architecture uses segmented LRU to manage the CMT. When the cache is full, it will evict a mapping entry from the cache. DFTL packs the evicted mapping entries into the translation page. All mapping entries in the same translation page are logically continuous. The translation pages on the flash memory chip are tracked using GTD (Global Translation Directory). If an evicted entry has been updated, all mapping entries in the translation page where it resides should be read, updated, and then rewritten to a free physical page. When the mapping entry cannot be found in the cache, DFTL reads the corresponding translation page, but only loads the requested mapping entry into the cache, ignoring and discarding the remaining mapping entries in the page.

[0043] The present invention improves on the translation page of DFTL and defines its name as MS-BCFTL. Another address mapping table FTP (float translation page) is added, as shown in the attached figure. Figure 4 As shown. It is used to save the mapping addresses eliminated from CMT, so that hot mapping entries are likely to be aggregated into the same translation page. The data types stored in the translation pages of FTP and DFTL are consistent and are both stored in flash memory, but the stored mapping addresses are not necessarily continuous and may be added or deleted according to different situations. In the present invention, the translation page of DFTL is defined as STP (steady translation page).

[0044] Since the LPNs of mapping entries in the same FTP are not continuous, and the LPN intervals of mapping entries in different FTPs may overlap, the complexity of finding the target mapping entry in FTP will be very high. In order to quickly find and access the FTP address where the LPN is located, the index information of FTP is saved in DRAM, which is defined as FTPI (float translation page index). FTPI is mainly based on bitmap (BIT-FTPI) or cuckoo filter (CF-FTPI).

[0045] As attached Figure 5As shown. FTPI mainly contains five fields, namely MPPN, flag, bitmap or Cuckoo Filter, max_lpn and min_lpn, where MPPN is the PPN of FTP, flag is used to identify FTPI as CF-FTPI and BIT-FTPI, max_lpn and min_lpn are the maximum and minimum LPN of the mapping entries stored in FTP, and Cuckoo Filter is created by the fingerprint generated by the hash function of the LPN of the mapping entry stored in FTP. BIT-FTPI can directly determine whether LPN is in FTP. If LPN exists in FTP, the (LPN-min_lpn)th bit of BIT-FTPI will be 1, otherwise it will be 0.

[0046] Since the cuckoo filter has a certain false positive probability, which will cause the processor to read the flash memory multiple times to obtain mapping information, when the continuity is good, a bitmap is used to record whether LPN exists, and when the continuity is slightly worse, a cuckoo filter is used. In order to better filter the continuous mapping entries from the eliminated CMT entries, an auxiliary cache Ghost-CMT is added, as shown in the attached Figure 3 As shown in Figure 2. Ghost-CMT resides in DRAM and caches newly evicted mapping entries in CMT. When Ghost-CMT is fully loaded, we aggregate the mapping entries with the smallest difference between the maximum LPN and the minimum LPN into FTP. When the difference is greater than a certain threshold, CF-FTPI is used, otherwise BIT-FTPI is used, which can minimize the false positive rate.

[0047] When receiving the host request, the stream_id specified by the host for the request will be received. The stream_id range of the present invention is 0-1. When the stream_id is 0, it represents hot data or warm data, and when the stream_id is 1, it represents cold data. According to different stream_ids, the solid state drive will perform different address mapping methods.

[0048] CMT is set to stream sharing mode, that is, stream0 and stream1 will share a CMT. Different streams are divided in the physical area, but the logical addresses all start from 0, so there will be conflicts. Therefore, in the same CMT table, one bit needs to be added to the highest bit based on the LPN address to distinguish stream_0 and stream_1.

[0049] For the hot-warm data of stream_0, the address mapping method based on bitmap and cuckoo filter will be used, and for the cold data of stream_1, the traditional method of DFTL will be adopted.

[0050] The address mapping method proposed in the present invention can efficiently process hot and warm data while ensuring low-cost access to cold data, greatly improving the performance and service life of the SSD.

[0051] A solid-state drive address mapping method is constructed. This method is an extension and improvement of the DFTL-type page address mapping scheme. It is adapted to multi-stream solid-state drives and uses bitmap and cuckoo filter algorithms at the same time. It can improve the hit rate of address mapping in the same cache space.

[0052] The overall process of MS-BCFTL of the present invention is shown in the attached Figure 1 As shown, when accessing a mapping entry, if it is not in the cache (CMT or Ghost CMT), if it is stream_1, the physical address where its translation page is located is directly retrieved through GTD, and only the required mapping entries are cached into CMT. If it is stream_0, it is first searched in FTP, and FTPI is checked one by one to test whether the mapping entry is in the corresponding FTP. If BITMAP or Cuckoo Filter shows that LPN exists in a certain FTP, the corresponding FTP will be read to obtain the requested entry. If we find the mapping entry in FTP, we will load all the mapping entries in FTP into CMT. If the mapping entry is in STP instead of FTP, then like the DFTL's read global mapping table process, GTD is consulted to obtain the corresponding STP address containing this mapping entry. After reading STP, we only load the requested mapping entry into CMT and discard the rest of the entries in it. When CMT is full, we evict an entry to Ghost-CMT through the LRU (least recently used) mechanism. When Ghost-CMT is full, we filter out a fixed number of entries with the smallest difference between the maximum LPN and the minimum LPN to form FTP and store them in the flash memory.

[0053] Specifically, when a request comes to the SSD, it first searches whether the LPN is cached in the CMT or GHOST-CMT. Due to the nature of multi-stream sharing of the CMT, the CMT stores LPNs of different streams, which need to be converted into a unique key value first. In this example, the LPN is a 56-bit binary number, so the conversion formula is key = (((stream_id)<<56)|LPN). According to the key value, it can be retrieved in the CMT. If the LPN is already cached in the CMT or GHOST-CMT, the normal data reading process of DFTL is followed, that is, the physical address corresponding to the LPN is read from the CMT. If the request is a write, the old physical address needs to be marked as invalid for garbage collection. At the same time, in the CMT, the position of the mapping entry in the LRU table will be adjusted to the head (last elimination).

[0054] As attached Figure 2 As shown in Figure 1, if the requested LPN is not in the CMT or GHOST-CMT, the FTPIs are checked one by one to find whether the mapping entry is in the corresponding FTP. Although FTPI improves the lookup of mapping entries, it also brings some management challenges. In order to find the latest version of the mapping entry in the FTP, we organize all FTPIs in a list and always add a new FTPI at its tail. Because the recently added FTP has newer data than the previously written FTP, the FTPIs are checked from the tail to the head of the list when searching for mapping entries. In addition, due to the spatial and temporal locality, the recently written FTP may have a higher probability of being requested than the previously written FTP. When the requested LPN exists in the FTP, all its entries are loaded into the CMT and its FTPI is deleted from the list because all the mapping entries in the FTP are already in the cache and its FTPI is no longer needed. Deleting invalid FTPI will free up some DRAM space and improve the utilization of DRAM space. Therefore, after deleting the FTPI, we invalidate the FTP, and then the garbage collection (GC) process of the SSD can reclaim this page.

[0055] When checking the FTPI to find the mapping entry, follow the following process to reduce the complexity of the search. Start the search from the end of the FTPI. First, determine whether the LPN is within the range of min_lpn and max_lpn of the FTPI. If it does not exist, search for the next FTPI. If it does exist, calculate the existence of the LPN through BITMAP or Cuckoo Filter.

[0056] For BITMAP, we can determine whether LPN exists in the FTP by checking whether the (LPN-min_lpn)th bit is 1. For Cuckoo Filter, we can hash the corresponding fingerprint through LPN and then determine whether it exists in Cuckoo Filter.

[0057] After confirming the existence of the LPN mapping entry by reading the FTP in the flash memory, all the mapping entries of the FTP are loaded into the CMT, and the FTP page is marked invalid and the FTPI is deleted.

[0058] If the LPN requested by stream_0 does not exist in CMT, GHOST-CMT, or FTP, the same DFTL reading process as stream_1 is used. Unlike DFTL, when CMT is full and the mapping entry to be evicted belongs to stream_0, it is evicted to GHOST_CMT. If the mapping entry to be evicted is a request from stream_1, it is directly evicted. If the mapping entry is marked as dirty, all dirty mapping entries in the global mapping table where the LPN is located are updated.

[0059] Since the cuckoo filter has a certain amount of false positives, the mapping entry may not be in the FTP even if the cuckoo filter reports that it is in the FTP. If a false positive occurs, it will result in an invalid read operation on the flash memory, which adds additional search latency, especially when there are many FTPs. The false positive rate of the cuckoo filter is negatively correlated with the number of bits of its hash fingerprint. However, increasing the size of the cuckoo filter will compete for more DRAM space with other data structures, such as CMT. Therefore, for CF-FTPI, the difference between the maximum and minimum LPN in FTP will not be too large, so the number of bits of the cuckoo filter hash fingerprint will not be large. On the other hand, if the difference between the maximum and minimum LPN in FTP is small enough, the efficient BIT-FTPI can be used.

[0060] Considering the above factors, Ghost_CMT needs to output a set of mapping entries with small LPN differences as much as possible to form an FTP. For example, assume that Ghost-CMT can only cache 6 mapping entries, and an FTP contains only 4 mapping entries. When Ghost-CMT is full and the LPNs of these 6 mapping entries are 12, 22, 34, 35, 36, and 38, 4 of them will be selected to form an FTP. Because the mapping entries in Ghost_CMT are sorted according to their LPNs, it is easy to get several minimum values, such as LPN4-LPN1=22, LPN5-LPN2=15, LPN6-LPN3=4. Because 4<15<22, the mapping entries containing LPN34, 35, 36, and 38 are expelled from Ghost-CMT to form an FTP.

[0061] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiments can be implemented by instructing the relevant hardware through a computer program, and the program can be stored in a computer-readable storage medium, and when the program is executed, it can include the processes of the embodiments of the above-mentioned methods. The storage medium can be a disk, an optical disk, a read-only memory (ROM) or a random access memory (RAM).

[0062] It should be understood that the detailed description of the technical solutions of the present invention by means of the preferred embodiments is illustrative rather than restrictive. A person skilled in the art may modify the technical solutions described in the embodiments, or replace some of the technical features by equivalents, based on reading the specification of the present invention; and these modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter, wherein the address mapping method is based on DFTL structure, Features: The mapping method adds a mobile translation page FTP on the basis of the translation page of the DFTL structure; The mapping method saves the mapping entries eliminated from the cache mapping table CMT to the mobile translation page FTP; Added bitmap and cuckoo filters to retrieve mobile translation page FTP; Add auxiliary cache GHOST-CMT to temporarily store and eliminate mapping entries, and filter logical page numbers LPN with high continuity; The auxiliary cache GHOST-CMT resides in DRAM and caches newly evicted mapping entries in CMT; When Ghost-CMT is fully loaded, the mapping entries with the smallest difference between the maximum LPN and the minimum LPN are aggregated into FTP. When the difference is greater than a certain threshold, CF-FTPI is used, otherwise BIT-FTPI is used; The specific address mapping steps of the address mapping method are as follows: First, when accessing a mapping entry, if it is not in the cache CMT or Ghost CMT, if it is data stream_1, the physical address of its static translation page STP is directly retrieved through the global translation directory GTD, the required mapping entry address is obtained through STP, and only the required mapping entry is cached into CMT; If it is data stream stream_0, it is searched in FTP first, and FTPIs are retrieved one by one to test whether the mapping entry exists in the corresponding FTP; If the BITMAP or Cuckoo Filter shows that the LPN exists in a certain FTP, the corresponding FTP will be read to obtain the requested entry; If mapping items are found in FTP, all mapping items in FTP will be loaded into CMT; If the mapping entry is in STP instead of FTP, the DFTL reads the global mapping table process and consults the GTD to obtain the corresponding STP address containing this mapping entry; After reading the STP, only the requested mapping entries are loaded into the CMT and the rest of the entries are discarded; When the CMT is full, an entry is evicted to the Ghost-CMT through the least recently used LRU mechanism; When Ghost-CMT is full, a fixed number of entries with the smallest difference between the maximum LPN and the minimum LPN are screened out to form FTP and stored in the flash memory.

2. The multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter according to claim 1, Features: The data types stored in the translation pages of the FTP and DFTL are consistent and are both stored in the flash memory, but the stored mapping addresses are not necessarily continuous and may be added or deleted according to different situations.

3. The multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter according to claim 1, Features: The mapping method stores the index information of FTP in the dynamic random access memory DRAM, which is defined as FTPI, and is based on the bitmap BIT-FTPI or the cuckoo filter CF-FTPI.

4. The multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter according to claim 3, Features: The FTPI includes five fields, namely MPPN, flag, bitmap or Cuckoo Filter, max_lpn and min_lpn; MPPN is the physical page number PPN of FTP, and flag is used to identify FTPI as CF-FTPI and BIT-FTPI; max_lpn and min_lpn are the maximum and minimum LPN of the mapping entries stored in FTP. Cuckoo Filter is created by the fingerprint generated by the hash function of the LPN of the mapping entry stored in FTP. BIT-FTPI directly determines whether LPN is in FTP. If LPN exists in FTP, the LPN-min_lpn bit of BIT-FTPI will be 1, otherwise it will be 0.

5. The multi-stream solid-state hard disk address mapping method based on bitmap and cuckoo filter according to claim 1, Features: The CMT is set to stream sharing mode. In the same CMT table, one bit needs to be added to the highest bit based on the LPN address to distinguish two different data streams stream_0 and stream_1.