Page replacement algorithm based on counting bloom filter for NAND flash memory

Liu, Jun; Chen, Shuyu; Wang, Guiping; Wu, Tianshu

doi:10.1109/tce.2014.7027337

Cited by 7 publications

(3 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the performance results, FARS shows a better performance, because it reduces the read/write cycles. Trace-driven simulations show that the proposed algorithm performs better than the existing page replacement algorithms when they are performed on different kinds of NAND flash memories [10,11].…”

Section: The Evaluation Performancementioning

confidence: 99%

See 1 more Smart Citation

Page Replacement Algorithm for NAND Flash Used in Mobile Devices

Zhang¹

2016

JEEE

View full text Add to dashboard Cite

In modern society, intelligent devices equipped with flash memory are very popular. It has many wonderful characteristics, such as small, fast, little consumption, shock resistance and so on. Flash memory is divided into NOR memory and NAND memory. The NOR memory can be quickly read with byte data which is developed into data memory for code storage. A new algorithm is needed to optimize the performance of the flash memory. In this paper, we propose a new strategy for replacement to focus on reducing the execution time of the replacement cost and I / O, which is to improve the performance of the algorithm performance. Trace-driven method has a better performance than the existing algorithms in terms of cost and execution time.

show abstract

Section: The Evaluation Performancementioning

confidence: 99%

“…The hybrid storage medium widely used is accepted by many companies [2]. For example, Samsung's One-NAND which can not only store data but also execute code is one kind [10]. The characteristics of NOR, NAND and hybrid memory are listed in Table 1.…”

Section: Characteristics Of Flash Memorymentioning

confidence: 99%

Page Replacement Algorithm for NAND Flash Used in Mobile Devices

Zhang¹

2016

JEEE

View full text Add to dashboard Cite

show abstract

“…As a result, a large number of technologies have appeared, such as the Bloom filter (BF) [1]. The BF has a low query delay and a high time-space overhead, leading to its broad use in computing areas, such as network and network security [2–5], distributed systems [6–9] and applications or embedded devices [10,11], with limited computing and storage resources. Moreover, many variants have been proposed, including the counting Bloom filter (CBF) [12] and its improvements [13–14], the compressed Bloom filter[15], the spectral Bloom filter[16], the dynamic Bloom filter [17], the Cuckoo Filter[18], and the parallel BFs (PBF-HT and PBF-BF) [19, 20].…”

Section: Introductionmentioning

confidence: 99%

Suitability of a new Bloom filter for numerical vectors with high dimensions

et al. 2018

View full text Add to dashboard Cite

The notable increase in the size and dimensions of data have presented challenges for data storage and retrieval. The Bloom filter and its generations, due to efficient space overheads and constant query delays, have been broadly applied to querying memberships of a big data set. However, the Bloom filter and most of the variants regard each element as a 1-dimensional string and adopt multiple different string hashes to project the data. The interesting problem is when the inputs are numerical vectors with high dimensions, it remains unknown whether they can be projected into the Bloom filter in their original format. Furthermore, we investigate whether the projection is random and uniform. To address these problems, this paper presents a new uniform Prime-HD-BKDERhash family and a new Bloom filter (P-HDBF) to retrieve the membership of a big data set with the numerical high dimensions. Since the randomness and uniformity of data mapping determines the performance of the Bloom filter, to verify these properties, we first introduce information entropy. Our theoretical and experimental results show that the P-HDBF can randomly and uniformly map the data in their native formats. Moreover, the P-HDBF provides an efficient solution alternative to implement membership search with space-time overheads. This advantage may be suitable for engineering applications that are resource-constrained or identification of the nuances of the graphics and images.

show abstract