Path and cache conscious prefetching (PCCP)

He, Zhen; Marquez, Alonso

doi:10.1007/s00778-005-0174-4

Cited by 5 publications

(5 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More complex approaches have been based on analysis done during application execution using various techniques such as Markov-Chains [9], traversal profiling [5,6] and the Lempel-Ziv compression algorithm [2]. The approach presented in [4] introduces type-level prediction based on the argument that patterns do not necessarily exist between individual objects but rather between object types.…”

Section: Related Workmentioning

confidence: 99%

Predicting Access to Persistent Objects Through Static Code Analysis

Touma

Queralt

Cortes

et al. 2017

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. In this paper, we present a fully-automatic, high-accuracy approach to predict access to persistent objects through static code analysis of object-oriented applications. The most widely-used previous technique uses a simple heuristic to make the predictions while approaches that offer higher accuracy are based on monitoring application execution. These approaches add a non-negligible overhead to the application's execution time and/or consume a considerable amount of memory. By contrast, we demonstrate in our experimental study that our proposed approach offers better accuracy than the most common technique used to predict access to persistent objects, and makes the predictions farther in advance, without performing any analysis during application execution.

show abstract

Section: Related Workmentioning

confidence: 99%

Predicting Access to Persistent Objects Through Static Code Analysis

Touma

Queralt

Cortes

et al. 2017

Communications in Computer and Information Science

View full text Add to dashboard Cite

show abstract

“…Other prefetching mechanisms are data-based techniques that rely on the history of accesses to objects stored in the POS. Some examples of these approaches include object-page relation modeling [24,18], stochastic methods [16], Markov-Chains [16,25], traversal profiling [26,23], the Lempel-Ziv data compression algorithm [27] and context-aware prefetching [28]. Moreover, predicting access to persistent objects at the type-level was first introduced by Han et al…”

Section: Related Workmentioning

confidence: 99%

“…Markov-Chains [16,25], traversal profiling [26,23], the Lempel-Ziv data compression algorithm [27] and context-aware prefetching [28]. Moreover, predicting access to persistent objects at the type-level was first introduced by Han et al…”

Section: Related Workmentioning

confidence: 99%

CAPre: Code-Analysis based Prefetching for Persistent Object Stores

Touma

Queralt

Cortés

2020

Future Generation Computer Systems

View full text Add to dashboard Cite

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.

show abstract

“…He and Marquez [14] proposed a prefetch framework called Path and Cache Conscious Prefetching (PCCP) from which a few variations of prefetch algorithms can be created. As the name indicates, PCCP framework provides both features of path and cache consciousness.…”

Section: Related Workmentioning

confidence: 99%