Abstract
In this study, we designed a KM-Cluster-based pattern adaptive prefetching mechanism for the last-level cache structure to support real time big data management. The goal is to predict future memory access patterns aggressively and accurately through a new self-learning prefetching engine model. The pattern adaptive last-level cache consisted of three major parts: the last-level cache, the first-level prefetching buffer (FLPB) and the second-level prefetching buffer (SLPB). The SLPB efficiently manages the history records of cache blocks evicted from the last-level cache through a self-learning mechanism. A K-means clustering algorithm is used as an SLPB prefetching scheme. Hybrid main memory is constructed using a small portion of the DRAM buffer space and primarily NAND-Flash memory space. The overall performance of our proposed model is evaluated for OpenStack Swift and in-memory database application-Redis. Experimental results show that the proposed architecture reduces the total execution time by 20.96% and power consumption by 31.9% compared to the same last-level cache size with no SLPB structure.
| Original language | English |
|---|---|
| Pages (from-to) | 66-75 |
| Number of pages | 10 |
| Journal | Sustainable Computing: Informatics and Systems |
| Volume | 20 |
| DOIs | |
| State | Published - Dec 2018 |
Keywords
- Big data management
- Hybrid memory
- KM-Cluster
- Last-level cache
- Prefetching mechanism
Fingerprint
Dive into the research topics of 'A self-learning pattern adaptive prefetching method for big data applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver