A self-learning pattern adaptive prefetching method for big data applications

doi:10.1016/j.suscom.2017.12.003

Return

A self-learning pattern adaptive prefetching method for big data applications

2018-12-01

PRE

DOI：10.1016/j.suscom.2017.12.003

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2017 Elsevier Inc. All rights reserved.

Keywords:

KM-Cluster

Prefetching mechanism

Big data management

Hybrid memory

Last-level cache

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.