Memory efficient and scalable address mapping for flash storage devices

Young-Kyoon Suh

doi:10.1016/j.sysarc.2014.01.002

Memory efficient and scalable address mapping for flash storage devices

2014-04-01

3

PRE

AI

DOI：10.1016/j.sysarc.2014.01.002

Original

Original request for help

Save

Abstract

En 中文

Flash memory devices commonly rely upon traditional address mapping schemes such as page mapping, block mapping or a hybrid of the two. Page mapping is more flexible than block or hybrid mapping without being restricted by block boundaries. However, its mapping table tends to grow large quickly as the capacity of flash memory devices does. To overcome this limitation, we propose novel mapping schemes that are fundamentally different from the existing mapping strategies. We call these new schemes Virtual Extent Trie (VET) and Extent Mapping Tree (EMT), as they manage mapping information by treating each 110 request as an extent and by using extents as basic mapping units rather than pages or blocks. By storing extents instead of individual addresses, our extent mapping schemes consume much less memory to store mapping information and still remain as flexible as page mapping. We observed in our experiments that our schemes reduced memory consumption by up to an order of magnitude in comparison with the traditional mapping schemes for several real world workloads. Our extent mapping schemes also scaled well with increasing address spaces by synthetic workloads. Even though the asymptotic mapping cost of VET and EMT is higher than the O(1) time of a page mapping scheme, the amount of increased overhead was almost negligible or low enough to be hidden by an accompanying I/O operation. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Flash memory

I/O request

Extent mapping

Canonical extent

Memory efficient and scalable address mapping for flash storage devices

Abstract

Journal

Organization