A variety of file replication and replacement algorithms were proposed for the Data Grids in the literature. On the other hand, real-time Grid applications are emerging in many disciplines of science and engineering. Thus, it is natural to ask about the realtime performance of these file replication and replacement algorithms. Based on this motivation, in this study, the performance of three re...

This paper proposes a mobile cache model to facilitate the cooperative proxy caching in wireless base stations. This mobile cache model uses a network cache line to record the caching state information about a web document for effective data search and cache space management. Based on the proposed mobile cache model, a P2P cooperative proxy caching scheme is proposed to use a self-configured an...

Avoiding problems such as packet loss in the transport network is crucial for mobile providers to offer high-quality services reliably and without interruptions. In this paper, we propose compare three different transmission strategies, namely Caching, Network Coding (NC) Repetition enabled User Plane (UP) of backhaul operators prevent performance degradation. proposed NC-enabled method, NC pro...

Database caching supports declarative query processing close to the application. Using a full-fledged DBMS as cache manager, it enables the evaluation of specific project-select-join queries in the cache. In this paper, we propose significant improvements and optimizations – as compared to the well-known DBCache approach – that make our caching concept truly adaptive. Furthermore, we describe a...

The exponential growth of the World Wide Web has made it the most popular information dissemination tool in the world. The growth necessitates caching, prefetching, and replication schemes on the web to alleviate the web server load, conserve the network band-width, and reduce the retrieval latency. At the same time, cache consistency should be maintained to avoid returning stale pages to users...

We propose a generic framework for storage support in a distributed environment. This comprises a set of storage abstractions and storage policies: data clusters, cluster containers, and container domains, supporting sharing, caching, and replication. These abstractions and these policies are structured as fragmented objects (FOs), such that each storage system designer can ooer the appropriate...

The goal of the ADMS project is to create a framework for caching materialized views, access paths, and experience obtained during query execution. The rationale behind this project is to amortize database access cost over an extended time period and adapt execution strategies based on experience. ADMS demonstrates the versatility of the views and their role in performance, data warehousing, ma...

This paper presents an approach to enhancing B-tree indexing performance by using a replication technique called persistent caching. A notable feature of the approach is its compatibility with ordinary B-trees; it exploits only the otherwise unused area of each B-tree page, and the basic behavior of B-trees need not be changed. This paper evaluates the performance of persistently cached B-trees...

This article presents the new features of OmpSs@FPGA framework. OmpSs is a data-flow programming model that supports task nesting and dependencies to target asynchronous parallelism heterogeneity. extension addressed specifically FPGAs. environment built on top Mercurium source compiler Nanos++ runtime system. To address FPGA specifics implements several related as local variable caching, wide ...