检索结果-内蒙古大学图书馆

Study of the impact of replacement granularity and associated strategies on video caching

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2005年第1期8卷 89-100页

作者： Balafoutis, E Panagakis, A Laoutaris, N Stavrakakis, I Univ Athens Dept Informat & Telecommun Athens 15784 Greece

Partial caching of large media objects such as video files has been proposed recently as the caching of entire objects can easily exhaust the storage resources of a proxy server. In this paper the idea of segmenting video files into chunks and applying replacement decisions at the chunk level rather than on entire videos is examined. It is shown that a higher byte bit ratio (BHR) can be achieved by appropriately adjusting the replacement granularity. The price paid for the improved BHR performance is that the replacement algorithm takes a longer time to converge to the steady state BHR. For the segmentation of video into chunks two methods are presented. The Fixed Chunk Size segmentation scheme that is rather simple and reveals the basic trade-off between byte hit ratio (BHR) and responsiveness to changes of popularity;the Variable Chunk Size segmentation scheme that uses the request frequencies to dynamically adjust the size of the chunk and is shown to be capable of combining a small response time with high BHR. Moreover, a variation of the fixed chunk size segmentation scheme is presented, which is shown to improve its performance by switching between different chunk sizes. Video segmentation is also considered as a mechanism to provide for caching differentiation based on access costs. By employing access cost dependent chunk sizes an overall access cost reduction is demonstrated.

关键词： video partial caching segmentation replacement algorithms replacement granularity

来源：评论

学校读者我要写书评

暂无评论

The EELRU adaptive replacement algorithm

引用

PERFORMANCE EVALUATION 2003年第2期53卷 93-123页

作者： Smaragdakis, Y Kaplan, S Wilson, P Georgia Inst Technol Atlanta GA 30332 USA Amherst Coll Amherst MA 01002 USA Univ Texas Austin TX 78712 USA

The wide performance gap between processors and disks ensures that effective page replacement remains an important consideration in modem systems. This paper presents early eviction LRU (EELRU), an adaptive replacement algorithm. EELRU uses aggregate recency information to recognize the reference behavior of a workload and to adjust its speed of adaptation. An on-line cost/benefit analysis guides replacement decisions. This analysis is based on the LRU stack model (LRUSM) of program behavior. Essentially, EELRU is an on-line approximation of an optimal algorithm for the LRUSM. We prove that EELRU offers strong theoretical guarantees of performance relative to the LRU replacement algorithm. EELRU can never be more than a factor of 3 worse than LRU, while in a common best case it can be better than LRU by a large factor (proportional to the number of pages in memory). The goal of EELRU is to provide a simple replacement algorithm that adapts to reference patterns at all scales. Thus, EELRU should perform well for a wider range of programs and memory sizes than other algorithms. Practical experiments validate this claim. For a large number of programs and wide ranges of memory sizes, we show that EELRU outperforms LRU, typically reducing misses by 10-30%, and occasionally by much more-sometimes by a factor of 2-10. It rarely performs worse than LRIJ, and then only by a small amount. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： replacement algorithms LRU memory management virtual memory

来源：评论

学校读者我要写书评

暂无评论

p-Jigsaw: a cluster-based Web server with cooperative caching support

p-Jigsaw: a cluster-based Web server with cooperative cachin...

引用

International Conference on Cluster Computing (Cluster 2001)

作者： Chen, G Wang, CL Lau, FCM Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China

Clustering provides a viable approach to building scalable Web systems with increased computing power and abundant storage space for data and contents. In this paper, we present a pure-Java-based parallel Web server system, p-Jigsaw, which operates on a cluster and uses the technique of cooperative caching to achieve high performance. We introduce the design of an in-memory cache layer, called Global Object Space (GOS), for dynamic caching of frequently requested Web objects. The GOS provides a unified view of cluster-wide memory resources for achieving location-transparent Web object accesses. The GOS relies on cooperative caching to minimize disk accesses. A requested Web object can be fetched from a server node's local cache or a peer node's local cache, with the disk serving only as the last resort. A prototype system based on the W3C Jigsaw server has been implemented on a 16-node PC cluster. Three cluster-aware cache replacement algorithms were tested and evaluated. The benchmark results show good speedups with a real-life access log, proving that cooperative caching can have significant positive impacts on the performance of cluster-based parallel Web servers. Copyright (C) 2003 John Wiley Sons, Ltd.

关键词： Web object cache cooperative caching Global Object Space hot object replacement algorithms cluster the World Wide Web

来源：评论

学校读者我要写书评

暂无评论

p-Jigsaw: a cluster-based Web server with cooperative caching support

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2003年第7-8期15卷 681-705页

作者： Chen, G Wang, CL Lau, FCM Univ Hong Kong Dept Comp Sci & Informat Syst Hong Kong Hong Kong Peoples R China

关键词： Web object cache cooperative caching Global Object Space hot object replacement algorithms cluster the World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Estimating neural networks-based algorithm for adaptive cache replacement

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 1998年第4期28卷 602-611页

作者： Obaidat, MS Khalid, H Monmouth Univ Dept Comp Sci W Long Branch NJ 07764 USA Monmouth Univ Ctr Technol Dev & Transfer W Long Branch NJ 07764 USA Motorola Inc PowerPC Performance Somerset Design Ctr Austin TX 78730 USA

In this paper, we propose an adaptive cache replacement scheme based on the estimating type of neural networks (NN's), The statistical prediction property of such NN's is used in our work to develop a neural network based replacement policy which can effectively identify and eliminate inactive cache lines. This would provide larger free space for a cache to retain actively referenced lines. The proposed strategy may, therefore, yield better cache performance as compared to the conventional schemes, Simulation results for a wide spectrum of cache configurations indicate that the estimating neural network based replacement scheme provide significant performance advantage over existing policies.

关键词： cache memory neural networks Parzen window replacement algorithms trace-driven simulation

来源：评论

学校读者我要写书评

暂无评论

A partitioned on-chip virtual cache for fast processors

引用

JOURNAL OF SYSTEMS ARCHITECTURE 1997年第8期43卷 519-531页

作者： Kim, D Lee, J Park, S AJOU UNIV DIV INFORMAT & COMP ENGNKWONSUN GUSUWON 441749KYUNGGI DOSOUTH KOREA

In this paper, we propose a new virtual cache architecture that reduces memory latency by encompassing the merits of both direct-mapped cache and set-associative cache, The entire cache memory is divided into n banks, and the operating system assigns one of the banks to a process when it is created. Then, each process runs on the assigned bank, and the bank behaves like in a direct-mapped cache. If a cache miss occurs in the active home bank, then the data will be fetched either from other banks or from the main memory like a set-associative cache. A victim for cache replacement is selected from those that belong to a process which is most remote from being scheduled. Trace-driven simulations confirm that the new scheme removes almost as many conflict misses as does the set-associative cache, while cache access time is similar to a direct-mapped cache.

关键词： virtual cache conflict miss multiprogramming context switch process cache partitioning replacement algorithms

来源：评论

学校读者我要写书评

暂无评论

A VIRTUAL STACK FACILITY FOR MINICOMPUTER AND MICROCOMPUTER IMPLEMENTATION OF THE FINITE-ELEMENT METHOD

引用

SOFTWARE-PRACTICE & EXPERIENCE 1990年第12期20卷 1209-1226页

作者： ELDIN, AS EVANS, DJ LOUGHBOROUGH UNIV TECHNOL PARALLEL ALGORITHMS RES CTRDEPT COMP STUDIESLOUGHBOROUGH LE11 3TULEICSENGLAND

In this paper, the efficient implementation of the finite element method on mini-computers and microcomputers is considered. The main limitations of memory and address space are overcome and a software solution proposed with the use of a virtual stack facility which is implemented and tested. A new replacement algorithm for a virtual stack is presented and shown to be more efficient than other known implementations.

关键词： Finite elements Stack management replacement algorithms Compiler design

来源：评论

学校读者我要写书评

暂无评论

FINITE-ELEMENT SOFTWARE FOR MINICOMPUTERS

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年第1-4期35卷 43-68页

作者： ELDIN, AS EVANS, DJ LOUGHBOROUGH UNIV TECHNOL PARALLEL ALGORITHMS RES CTRLOUGHBOROUGH LE11 3TULEICSENGLAND

In this paper the efficient implementation of the Finite Element Method (FEM) on mini-computers is considered. The main limitations of memory and address space are overcome and a software solution proposed using a Virtual Stack Facility (VSF) which is implemented and tested. A new replacement algorithm for a virtual stack is presented and shown to be more efficient than other implementations.

关键词： Finite element software stack management replacement algorithms compiler design D.2.1 J.2

来源：评论

学校读者我要写书评

暂无评论

INSTRUCTION CACHE replacement POLICIES AND ORGANIZATIONS

引用

IEEE TRANSACTIONS ON COMPUTERS 1985年第3期34卷 234-241页

作者： SMITH, JE GOODMAN, JR UNIV WISCONSIN DEPT COMP SCIMADISONWI 53706

Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references —the loop model. First the loop model is used to study replacement policies and cache organizations. It is concluded theoretically that random replacement is better than LRU and FIFO, and that under certain circumstances, a direct-mapped or set-associative cache may perform better than a full-associative cache organization. Experimental results using instruction trace data are then given and analyzed. The experimental results indicate that the loop model provides a good explanation for observed cache performance.

关键词： Cache memories direct-mapped fully associative loop model memory organization replacement algorithms set-associative

来源：评论

学校读者我要写书评

暂无评论

MEMORY MANAGEMENT FOR B-TREES

引用

PERFORMANCE EVALUATION 1985年第3期5卷 159-174页

作者： SPIRN, JR TSUR, S DIGITAL EQUIPMENT CORP HUDSONMA MICROELECTR & COMP TECHNOL CORP AUSTINTX

In this paper we consider the paging cost associated with the use of B-trees as indexes for random access files and data base systems. We measure the cost by the number of page faults as opposed to previously published analyses which are based on the number of pages accessed. We provide the analysis for two paging policies denoted LAP and LEC respectively. We show that the first policy is not optimal but nearly so and that the second is the optimal policy among a class of algorithms for sequences of independently chosen key references. Our simulation results show that, as a practical matter, the performance of LAP and LEC is nearly identical. Since LAP can easily be implemented we suggest it as a candidate for practical use.

关键词： B-Trees Indexed Files Random-Access Files Databases Paging replacement algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：