An Aggregation Cache Replacement Algorithm Based on Ontology Clustering

This paper describes the theory, implementation, and experimental evaluation of an Aggregation Cache Replacement （ ACR ） algorithm. By considering application background, carefully choosing weight values, using a special formula to calculate the similarity, and clustering ontologies by similarity for getting more embedded deep relations, ACR combines the ontology similarity with the value of object and decides which object is to be replaced. We demonstrate the usefulness of ACR through experiments. （a） It is found that the aggregation tree is created wholly differently according to the application cases. Therefore, clustering can direct the content adaptation more accurately according to the user perception and can satisfy the user with different preferences. （b） After comparing this new method with widely-used algorithm Last-Recently-Used （LRU） and First-in-First-out （FIFO） method, it is found that ACR outperforms the later two in accuracy and usability. （c） It has a better semantic explanation and makes adaptation more personalized and more precise.

Shared Cache Based on Content Addressable Memory in a Multi-Core Architecture

Modern shared-memory multi-core processors typically have shared Level 2(L2)or Level 3(L3)caches.Cache bottlenecks and replacement strategies are the main problems of such architectures,where multiple cores try to access the shared cache simultaneously.The main problem in improving memory performance is the shared cache architecture and cache replacement.This paper documents the implementation of a Dual-Port Content Addressable Memory(DPCAM)and a modified Near-Far Access Replacement Algorithm(NFRA),which was previously proposed as a shared L2 cache layer in a multi-core processor.Standard Performance Evaluation Corporation(SPEC)Central Processing Unit(CPU)2006 benchmark workloads are used to evaluate the benefit of the shared L2 cache layer.Results show improved performance of the multicore processor’s DPCAM and NFRA algorithms,corresponding to a higher number of concurrent accesses to shared memory.The new architecture significantly increases system throughput and records performance improvements of up to 8.7%on various types of SPEC 2006 benchmarks.The miss rate is also improved by about 13%,with some exceptions in the sphinx3 and bzip2 benchmarks.These results could open a new window for solving the long-standing problems with shared cache in multi-core processors.

Architecture of Multimedia Proxy Caching over the Internet

Streaming media data have strict delay and loss requirements, which cannot be adequately supported by the current Internet. Proxy caching technology is introduced to alleviate the effect of the bottleneck bandwidth on the transporting quality. A new architecture of multimedia proxy caching is given to solve the problem of the traditional Web caching technology for the multimedia streaming. The mixed media management module and the (resource) management module are added to this architecture, the prefetching and replacement method is studied considering the characteristics of streaming media data, the concept of weighed popularity is given to enhance the (exactness) of the replacement algorithm.

The Configuration Strategies on Caching for Web Servers

The Web cluster has been a popular solution of network server system because of its scalability and cost effective ness. The cache configured in servers can result in increasing significantly performance, In this paper, we discuss the suitable configuration strategies for caching dynamic content by our experimental results. Considering the system itself can provide support for caching static Web page, such as computer memory cache and disk＇s own cache, we adopt a special pattern that only caches dynamic Web page in some experiments to enlarge cache space. The paper is introduced three different replacement algorithms in our cache proxy module to test the practical effects of caching dynamic pages under different conditions. The paper is chiefly analyzed the influences of generated time and accessed frequency on caching dynamic Web pages. The paper is also provided the detailed experiment results and main conclusions in the paper.