返回
CAPre: Code-Analysis based Prefetching for Persistent Object Stores
DOI:10.1016/j.future.2019.10.023.png)
摘要
En 中文
Data prefetching aims to improve access times to data storage systems by predicting data records that are likely to be accessed by subsequent requests and retrieving them into a memory cache before they are needed. In the case of Persistent Object Stores, previous approaches to prefetching have been based on predictions made through analysis of the store's schema, which generates rigid predictions, or monitoring access patterns to the store while applications are executed, which introduces memory and/or computation overhead. In this paper, we present CAPre, a novel prefetching system for Persistent Object Stores based on static code analysis of object-oriented applications. CAPre generates the predictions at compile-time and does not introduce any overhead to the application execution. Moreover, CAPre is able to predict large amounts of objects that will be accessed in the near future, thus enabling the object store to perform parallel prefetching if the objects are distributed, in a much more aggressive way than in schema-based prediction algorithms. We integrate CAPre into a distributed Persistent Object Store and run a series of experiments that show that it can reduce the execution time of applications from 9% to over 50%, depending on the nature of the application and its persistent data model. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Persistent Object Stores
Static code analysis
Data prefetching
Parallel prefetching
Object-Oriented programming languages
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.8W
机构
引用论文
Dynamic energy efficient data placement and cluster reconfiguration algorithm for MapReduce framework面向MapReduce框架的动态节能数据放置和集群重构算法
A formal framework for prefetching based on the type-level access pattern in object-relational DBMSs

