Solid state disk read-write request parallel processing method

A technology for reading and writing requests and parallel processing, which is applied in the fields of electrical digital data processing, instruments, memory systems, etc. It can solve problems such as not supporting in-place updates, limited service life, and overall performance degradation of NAND flash memory, so as to improve read and write performance , reduce impact, and reduce the effect of request execution time

Active Publication Date: 2019-11-29
HANGZHOU DIANZI UNIV
View PDF10 Cites 12 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

4) It must be erased before writing data, and does not support in-place update
5) The erasing times are limited, beyond a certain number of erasing times, the overall performance of NAND flash memory will be greatly reduced, and the service life is limited

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Solid state disk read-write request parallel processing method
  • Solid state disk read-write request parallel processing method
  • Solid state disk read-write request parallel processing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0068] Embodiment 1: pretreatment operation.

[0069] The preprocessing operations in the queue are as Figure 4 shown. Requests R1, W1, and R2 arrive in chronological order, where R represents a read request, W represents a write request, and the numbers represent the order of arrival. Its processing is as follows:

[0070] C1, the queue to be processed is not full, and the request preprocessing operation is started, and the read request R1(78,2) is started. Here 78 represents the start logical page number of the access operation, and 2 represents access to two pages (the same below). according to Figure 4 From the address mapping table shown, it can be obtained that the actual physical page numbers to be accessed are 66 and 301, and C2 is executed.

[0071] C2, physical pages 66 and 301 are in channels 1 and 3 respectively. The channel allocation module inserts them into the read queues of channel 1 and channel 3 respectively, and executes C3.

[0072] C3, the queue ...

Embodiment 2

[0077] Embodiment 2: flash memory access operation.

[0078] The read request processing in the queue is as follows Figure 5 As shown, its processing is as follows:

[0079] C1, the queue to be processed is not empty, the leader of the queue is the read request R1, and R1 has not been executed, so read the first page number of the read queue of the four channels, that is, read the physical pages 66, 210, and 301 from the four channels respectively , 407 to the data buffer. Remove the head requests of the 4 channel read queues. At this time, the execution of R1 is completed, and R1 is removed from the pending queue. The physical pages 66 and 301 of R1 in the buffer are merged and uploaded, and C2 is executed.

[0080] C2, the queue to be processed is not empty, the head of the queue is the read request W1, and W1 has not been executed, so write to the head of the 4-channel write queue, and write data to 103,247,331,500 physical pages under the 4 channels. Remove the head re...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a solid state disk read-write request parallel processing method. The system is composed of an address mapping module, a channel allocation module, a channel queue module, a to-be-processed queue module, a data buffer area and a garbage collection module. In the preprocessing process, for a read-write request, calculating a corresponding read-write channel, and then sendingthe read-write channel to a read-write queue corresponding to the channel; in the flash memory access process, parallel scheduling is carried out from the read-write queues of all the channels according to the request arrival sequence; for garbage collection, an active and passive combined mode is adopted, so that the influence of garbage collection on the read-write performance of the solid state disk is reduced. According to the method, a channel-level parallel structure in the solid state disk is utilized, pages are taken as units, and maximum parallel of data writing and reading is realized through reasonable scheduling, so that the average response time of requests is reduced to a great extent, and the overall performance of a system is improved.

Description

technical field [0001] The invention belongs to the field of firmware optimization design of solid-state hard disks, and in particular relates to a parallel processing method for reading and writing requests of solid-state hard disks. Background technique [0002] With the rapid development of new-generation information technologies such as cloud computing and mobile Internet, the amount of data shows an exponential growth trend, so higher requirements are placed on data storage speed and bandwidth. Solid-state hard drives based on NAND flash memory are known as one of the current mainstream storage devices due to their high performance, low power consumption, noise-free and many other advantages. [0003] The NAND flash memory used in solid-state drives has the following characteristics: 1) It is composed of pages, blocks, planes, and dies, which are nested from small to large. 2) Basic operations are divided into: read, write, erase, read and write in units of pages, and ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F12/02G06F12/0882G06F12/0895
CPCG06F12/0246G06F12/0253G06F12/0882G06F12/0895
Inventor 姚英彪孔小冲范金龙冯维许晓荣刘兆霆徐欣
Owner HANGZHOU DIANZI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap