Multi-channel NFSDS and FTL

3 May

Multi-channel / multi-channel NFSDs FTL A Summary of the proposed FTL design method assumes that has NFSDs design of a single channel / single FTL.

The proposed method is perfect for Single / Single [FTL-SS] FTL expanded to multi-channel / multi-channel FTL-MM] NFSDs FTL However maintenance expanded FTL efficiency greater than or equal to FTL-SS . For this reason, in this work we do not focus on the design of a FTL-SS. In any case, we applied our method in several well-known FTL up to demonstrate the effectiveness and universality. To this end, joined the expansion of our method the FTL inherited the nature of the Single / Single version. The FTLs brief introduction in Section B of Chapter. And then, in the third quarter about the key design parameters of the method. In chapters D segment and the E segment, we will respectively address translation scheme set forth in our program and our proposed address mapping structure.

Many research groups in the study FTL-SS. The vast majority of these FTLs aimed at reducing the number of additional operations, NFSDs they will greatly reduce the overall performance. Generation of redundant operation is mostly due to the wear-leveling and garbage collection mechanism. Including many FTLs, we will outline three famous the FTLs – BAST, FAST, and Superblock FTL. We also use them in two ways. First, we extract a common feature of these three FTLs. Based on these extracted feature, we have established a common method to extend FTL-SSS. Then, we use them, a lot of experiments to verify the universality and effectiveness of our approach. Simply said, the vast majority of conventional FTLs spent a block address mapping mechanism. Thus, the mutual concept is very similar. The main difference between them lies in the association between the modules and the data log block, which seriously affect the quantity of additional operations.

Next, we concluded from the associated angle above three FTLs Bast: (: (: (: the (block associative Sctor Translation)))) Bast is a block map-based log block FTL. Declared when a write operation of the data and its corresponding logical addresses, BAST first from the address mapping table to find a block. Then, it is based on a logical address corresponding to the least significant bit bit page offset to allocate a page. There are three types of blocks – free blocks, data blocks and log blocks in BAST. A free block is a clean storage block, it retains data after the write. A data block is assigned a page to store the data to be written. We call this allocation page page】 【Valid. If the logical address of the write operation and a write is the same as before, valid will be assigned to this new write operation. In this case, Bast make this failure, and the new data is written to a log block. We call this an update [update]. The BAST assigned a separate log block to each data block, whenever an update to reproduce the first data block. To the next update, the same log block is used

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: