The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The limited lifespan is the Achilles’s heel of Solid State Drive (SSD) based on NAND flash memory. NAND flash has two drawbacks that degrade SSD’s lifespan. One is the out-of-place update. Another is the sequential write constraint within a block. To extend the lifespan, SSD usually employs a write buffer to reduce write traffic to flash memory. However, existing write buffer schemes only pay attention...
NAND flash memory has become a popular alternative to replace disks in a storage system because of its non-volatility, high I/O performance, shock resistance, and low power consumption. However, NAND flash memory has characteristics of erase-before-write and limited cycles of write and erase operations, which introduce new challenges into the design of file system. Index schemes of conventional file...
Flash memory, especially NAND flash memory, has become a popular alternative for the design of storage system. Index schemes of conventional file systems do not take the flash memory characteristics into account and will cause poor performance. The current flash file systems work well only in the case of small capacity. To address the problem, we propose a new hybrid indexing scheme both in directory...
The era of big data requires a high-bandwidth, high-concurrency architecture of storage systems. NAND flash memory acting as a replacement candidate of hard disk drives is popularly used in enterprise class storage systems due to its lower power consumption, faster random access, and higher shock resistance. To this end, we propose a high performance NAND flash-based card. The card presents three...
Solid State Drives (SSDs) based on NAND flash have been widely studied. Most related works focus on improving SSDs' performance. Many novel techniques have been proposed to achieve this goal. In this paper, we don't focus on any given technique, but explore several principles to design an SSD. Beforehand, we build an analytical model for SSDs by resorting to queueing theory. The model covers most...
NAND flash has some inherent peculiarities which increase the access delay seriously. We propose the Page to Block mapping Flash Translation Layer (PBFTL). Solid State Drives (SSDs) adopting PBFTL have lower response time. To achieve low response time for read requests, PBFTL adopts hybrid-level mapping scheme. But, hybrid-level FTL behaves awkwardly for write due to the high overhead of garbage collection...
The development of flash memory drives flash based SSDs to enter into enterprise-scale storage systems. As the kernel of SSD, flash translation layer (FTL) attracts many attentions. Generally, there are two types of FTLs according to the granularity of address mapping: block-level and page-level mapping FTLs. We focus on the latter one. Typically, page-level mapping scheme must employ a cache to alleviate...
The development of flash memory drives flash based SSD to enter into large-scale storage systems. The performance of SSD is highly dependent on the design of FTL. For the last few years, several FTL schemes have been proposed. Such as FAST, BAST, SAST etc. we design a novel FTL based on page-level mapping scheme. Since one of the major troubles of page-level mapping FTL is the unendurable memory consuming...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.