Method materialization is a promising data access optimization technique for multiple applications, including, in particular object programming languages with persistence, object databases, distributed computing systems, object-relational data warehouses, multimedia data warehouses, and spatial data warehouses. A drawback of this technique is that the value of a materialized method becomes invalid when an object used for computing the value of the method is updated. As a consequence, a materialized value of the method has to be recomputed. The materialized value can be recomputed either immediately after updating the object or just before calling the method. The moment the method is recomputed bears a strong impact on the overall system per...
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is cruci...
This paper, based on the content of the axioms for the randomized algorithm, considers the collectio...
Abstract—Materialized view is used in large data centric applications to expedite query processing. ...
Driven by several real-life case studies and in-lab developments, synthetic memory reference generat...
There is an increasing demand for systems which handle higher density, additional loads as seen in s...
An important technique for alleviating the memory bottleneck is data prefetching. Data prefetching ...
Abstract — Leveraging the power of scratchpad memories (SPMs) available in most embedded systems tod...
In this paper we introduce a technique for the synthetic generation of memory references which behav...
In this paper, we present a fully-automatic approach to predict access to persistent objects through...
© 2015 The Authors. Published by Elsevier B.V.In modern computer systems, the intermittent behaviour...
4siDriven by several real-life case studies and in-lab developments, synthetic memory reference gen...
In this paper we propose an approach, which is based on Markov Chain, to cluster and recommend candi...
This work presents an innovative system for analysing and predicting the runtime behaviour of object...
AbstractIn modern computer systems, the intermittent behaviour of infrequent, additional loads affec...
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is cruci...
This paper, based on the content of the axioms for the randomized algorithm, considers the collectio...
Abstract—Materialized view is used in large data centric applications to expedite query processing. ...
Driven by several real-life case studies and in-lab developments, synthetic memory reference generat...
There is an increasing demand for systems which handle higher density, additional loads as seen in s...
An important technique for alleviating the memory bottleneck is data prefetching. Data prefetching ...
Abstract — Leveraging the power of scratchpad memories (SPMs) available in most embedded systems tod...
In this paper we introduce a technique for the synthetic generation of memory references which behav...
In this paper, we present a fully-automatic approach to predict access to persistent objects through...
© 2015 The Authors. Published by Elsevier B.V.In modern computer systems, the intermittent behaviour...
4siDriven by several real-life case studies and in-lab developments, synthetic memory reference gen...
In this paper we propose an approach, which is based on Markov Chain, to cluster and recommend candi...
This work presents an innovative system for analysing and predicting the runtime behaviour of object...
AbstractIn modern computer systems, the intermittent behaviour of infrequent, additional loads affec...
Modern operating systems use main memory as a cache over disk-based storage. The time spent waiting ...
Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is cruci...
This paper, based on the content of the axioms for the randomized algorithm, considers the collectio...