Web caching aims to reduce network traÆc, server load, and user-perceived retrieval delays by replicating \popular" content on proxy caches that are strategically placed within the network. While key to e ective cache utilization, popularity information (e.g. relative access frequencies of objects requested through a proxy) is seldom incorporated directly in cache replacement algorithms. Rather...

This paper introduces MICP, a novel multiversion integrated cache replacement and prefetching algorithm designed for efficient cache and transaction management in hybrid data delivery networks. MICP takes into account the dynamically and sporadically changing cost/benefit ratios of cached and/or disseminated object versions by making cache replacement and prefetching decisions sensitive to the ...

In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. Three buffer structures (i.e. single, hybrid and by levels) over two buffering schemes (i.e. local to each R-tree, and global to the query) using several page replacement algorithms (e.g. FIFO, LRU, 2Q,...

In this paper, we have proposed a new concept of text compression/decompression algorithm using special character replacement technique. Moreover after the initial compression after replacement of special characters, we remove the spaces between the words in the intermediary compressed file in specific situations to get the final compressed text file. Experimental results show that the proposed...

Stochastic gradient methods for machine learning and optimization problems are usually analyzed assuming data points are sampled with replacement. In practice, however, sampling without replacement is very common, easier to implement in many cases, and often performs better. In this paper, we provide competitive convergence guarantees for without-replacement sampling, under various scenarios, f...

The desire to have large amounts of memory with small access latency is desired by all. Caches provide this effect in a manageable fashion. In databases, the buffer pool acts as a cache to reduce the latency to access disk. However, the benefit of caching depends on the effectiveness of the replacement algorithm. In this report, I summarize my work over the past few months on Derby on different...

Power consumption is an increasingly impressing concern for data servers as it directly affects running costs and system reliability. Prior studies have shown most memory space on data servers are used for buffer caching and thus cache replacement becomes critical. This paper investigates the tradeoff between these two interacting factors and proposes three energy-aware buffer cache replacement...

In this paper we will design architecture for cloud computing services with QoS by supported scheduling algorithm for resource allocation. Cloud generally uses virtualization technology which is specially designed for maximum resource utilization. The QoS of cloud environment for any kind of resource utilization is achieved feasibly by using QoS-aware Cache Replacement algorithm. This algorithm...

In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedback mechanism which dynamically changes the sizes of dedicated buffer areas and thereby the buffer hit rate for the different classes in such a way that user-specified response time goals are satisfied. The aggregated s...

The ability to stay continually connected, due to the ubiquitous availability of a wide variety of networks, is a present day reality. Yet the convenience and transparency of distributed file systems across heterogeneous networks have a long way to go. In this paper, we examined the cache replacement algorithm on the clientside by taking the low-bandwidth connection into consideration. Motivate...