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

Improving Networked File System Performance Using a Locality-Aware Cooperative Cache Protocol

IEEE TRANSACTIONS ON COMPUTERS 2010年第11期59卷 1508-1519页

作者： Jiang, Song Zhang, Xuechen Liang, Shuang Davis, Kei Wayne State Univ Dept Elect & Comp Engn 5050 Anthony Wayne Dr Detroit MI 48202 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Los Alamos Natl Lab Los Alamos NM 87545 USA

In a distributed environment, the utilization of file buffer caches in different clients may greatly vary. Cooperative caching has been proposed to increase cache utilization by coordinating the shared usage of distributed caches. It allows clients that would more greatly benefit from larger caches to forward data objects to peer clients with relatively underutilized caches. To support such coordination, global cache utilization must be dynamically evaluated. This, in turn, requires an effective analysis of application data access patterns. Existing coordination protocols are demonstrably suboptimal in this respect, exhibiting inefficient memory utilization and undue interference among clients. We propose a locality-aware cooperative caching protocol, called LAC, that is based on analysis and manipulation of data block reuse distance to effectively predict cache utilization and the probability of data reuse at each client. Using a dynamically adaptive synchronization technique, we keep local information up to date and consistently comparable across clients. The system is highly scalable in the sense that global coordination is achieved without centralized control. We have conducted thorough trace-driven simulation experiments to assess the performance differences between LAC and various existing protocols representative of the general class. Using a realistic and representative cost model, we show that the LAC protocol significantly and consistently outperforms existing cooperative caching protocols, demonstrating high and balanced utilization of caches across all clients. In our experiments, LAC reduces block access time by up to 36 percent, with an average of 31 percent, over the system without peer cache coordination, and reduces block access time by up to 22 percent, with an average of 13 percent, over the best performer of the existing protocols.

关键词： replacement algorithm locality cooperative caching networked file system

来源：评论

学校读者我要写书评

暂无评论

Architecture of Multimedia Proxy Caching over the Internet

引用

Journal of Beijing Institute of Technology 2004年第4期13卷 355-359页

作者：潘浩潘天泉宋瀚涛王大震 School of Information Science and Technology Beijing Institute of Technology Beijing100081 China Department of Architecture and Engineering North China of Institute of Science and Technology Beijing101601 China

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.

关键词： streaming media proxy caching quality of service replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

A ZERO-ONE LAW FOR RANDOM SUBGROUPS OF SOME TOTALLY DISCONNECTED GROUPS

引用

TRANSFORMATION GROUPS 2009年第4期14卷 787-800页

作者： Glasner, Yair Ben Gurion Univ Negev Dept Math IL-84105 Beer Sheva Israel

Let A be a locally compact group topologically generated by d elements and let k > d. Consider the action, by precomposition, of Gamma = Aut(F(k)) on the set of marked, k-generated, dense subgroups D(k,A) := {eta epsilon Hom(F(k,A))| <()over bar> = A}. We prove the ergodicity of this action for the following two families of simple, totally disconnected, locally compact groups: A = PSL(2)(K) where K is a non-Archimedean local field (of characteristic not equal 2);A = Aut(0)(T(q+1))| the group of orientation- preserving automorphisms of a q + 1 regular tree, for q >= 2. In contrast, a recent result of Minsky's shows that the same action fails to be ergodic for A = PSL(2)(C) and, when k is even, also for A = PSL(2)(R). Therefore, if k >= 4 is even and K is a local field (with char(K) not equal 2), the action of Aut(F(k)) on D(k,PSL2(K)) is ergodic if and only if K is non-Archimedean. Ergodicity implies that every "measurable property" either holds or fails to hold for almost every k-generated dense subgroup of A.

关键词： PRODUCT replacement algorithm DISTRIBUTING POINTS AUTOMORPHISM GROUP HECKE OPERATORS REGULAR TREES T-SYSTEMS PRESENTATIONS CONNECTIVITY GENERATORS GRAPH Action connectivity replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

VSWS - THE VARIABLE-INTERVAL SAMPLED WORKING SET POLICY

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第3期9卷 299-305页

作者： FERRARI, D YIH, YY UNIV CALIF BERKELEY ELECTR RES LABBERKELEYCA 94720 BELL TEL LABS INC HOLMDELNJ 07733

A local variable-size memory management policy has been developed. The variable-interval sampled working set (VSWS) is a working-set-like algorithm that exhibited a static performance similar to that of the sampled working set (SWS) policy and a dynamic performance better than SWS. Simpler hardware support requirements and a lower number of process suspensions for use bit scanning purposes are 2 advantages of VSWS over SWS. Because memory demands are increasing in important applications, along with the technology-driven trend toward smaller page sizes, bit scanning overhead use is apt to become a prime characteristic of memory policies which base their estimation of the current locality on the information contained in the use bits. Before local variable-size policies become really workable options to the global policies in most virtual memory systems used today, schemes for reducing the overhead of VSWS or SWS must be studied in depth.

关键词： Working Set Policy Damped Working Set Policy Local replacement Policy Memory Management Page Fault Frequency Policy Program Behavior replacement algorithm Sampled Working Set Policy Variable Size Policy Virtual Memory

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF LONG-TERM FILE REFERENCE PATTERNS FOR APPLICATION TO FILE MIGRATION algorithmS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1981年第4期7卷 403-417页

作者： SMITH, AJ UNIV CALIF BERKELEY LAWRENCE BERKELEY LAB BERKELEYCA 94720

In most large computer installations, files migrate from on-line disk to mass storage, returning to disk only when they are needed by an interactive text editor. A study of file usage has determined that the average file is used 2 or fewer times; the average number of references per file, however, is 10.6. This translates to a highly skewed distribution: most files are used very little, and a few are accessed a large number of times. Data produced by a study of file usage has formed the basis for the construction and evaluation of a number of file migration algorithms. The size of a file and the time since it was last used are most important in determining when to migrate the file from disk to mass storage.

关键词： Time Series Analysis File Migration Mass Storage Memory Hierarchies replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Coordinated multilevel buffer cache management with consistent access locality quantification

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第1期56卷 95-108页

作者： Jiang, Song Davis, Kei Zhang, Xiaodong Wayne State Univ Dept Elect & Comp Engn Detroit MI 48202 USA Los Alamos Natl Lab Performance & Architecture Lab Comp & Computat Sci Div Los Alamos NM 87545 USA Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

This paper proposes a protocol for effective coordinated buffer cache management in a multilevel cache hierarchy typical of a client/server system. Currently, such cache hierarchies are managed suboptimally-decisions about block placement and replacement are made locally at each level of the hierarchy without coordination between levels. Though straightforward, this approach has several weaknesses: 1) Blocks may be redundantly cached, reducing the effective total cache size, 2) weakened locality at lower-level caches makes recency-based replacement algorithms such as LRU less effective, and 3) high-level caches cannot effectively identify blocks with strong locality and may place them in low-level caches. The fundamental reason for these weaknesses is that the locality information embedded in the streams of access requests from clients is not consistently analyzed and exploited, resulting in globally nonsystematic, and therefore suboptimal, placement and replacement of cached blocks across the hierarchy. To address this problem, we propose a coordinated multilevel cache management protocol based on consistent access-locality quantification. In this protocol, locality is dynamically quantified at the client level to direct servers to place or replace blocks appropriately at each level of the cache hierarchy. The result is that the block layout in the entirely hierarchy dynamically matches the locality of block accesses. Our simulation experiments on both synthetic and real-life traces show that the protocol effectively ameliorates these caching problems. As anecdotal evidence, our protocol achieves a reduction of block accesses of 11 percent to 71 percent, with an average of 35 percent, over uniLRU, a unified multilevel cache scheme.

关键词： replacement algorithm locality multilevel caching networked file system

来源：评论

学校读者我要写书评

暂无评论

Lazy-split B⁺-tree: a novel B⁺-tree index scheme for flash-based database systems

引用

DESIGN AUTOMATION FOR EMBEDDED SYSTEMS 2013年第1期17卷 167-191页

作者： Jin, Rize Cho, Hyung-Ju Lee, Sang-Won Chung, Tae-Sun Ajou Univ Dept Comp Engn Suwon 443749 South Korea Sungkyunkwan Univ Sch Informat & Commun Engn Suwon 440746 South Korea

Flash memory is rapidly being deployed as a data storage medium for embedded systems and tablet computers due to its shock resistance, fast access, and low power consumption, etc. However, it has some intractable characteristics, such as erase-before-write, asymmetric read/write/erase speed, and a limited number of write/erase cycles. Due to these hardware limitations, magnetic disk-based systems and applications can hardly make full use of the advantages of flash memory when adopting it directly for storage. For example, the frequent changes of B-tree can degrade the performance and negatively influence the lifespan of flash memory. Most state-of-the-art studies on flash-aware index design focused mainly on buffer and storage mechanisms whereby they can obtain efficient I/Os to flash memory. In this paper, we identify the problems inherent in the related studies, and then introduce the concepts of lazy-split, modify-two-node, and semi-clean, which make possible the construction of a novel index solution, the Lazy-Split B+-tree (LSB+-tree). In detail, by their introduction, the first concept of LSB+-tree can efficiently reduce the number of node splits, the second can reduce the number of node modifications, and the last can make a further improvement on buffer space utilization and flash writes reduction.

关键词： B+-Tree Splitting policy replacement algorithm Index manager Flash memory

来源：评论

学校读者我要写书评

暂无评论

OPTIMIZATION OF I/O SYSTEMS BY CACHE DISKS AND FILE MIGRATION - A SUMMARY

引用

PERFORMANCE EVALUATION 1981年第3期1卷 249-262页

作者： SMITH, AJ UNIV CALIF BERKELEY LAWRENCE BERKELEY LAB BERKELEYCA 94720 STANFORD UNIV STANFORD LINEAR ACCELERATOR CTRSTANFORDCA 94305

The file system, and the components of the computer system associated with it (disks, drums, channels, mass storage tapes and tape drives, controllers, I/O drivers, etc.) comprise a very substantial fraction of most computer systems; substantial in several aspects, including amount of operating system code, expense for components, physical size and effect on performance. In a comparison paper, we surveyed the traditional methods for optimizing the I/O system. We then examined disk and I/O system architecture in IBM type systems, and indicated shortcomings and future directions. In this paper we go one step further and summarize research by the author on two topics: cache disks and file migration. Cache disks are disks which have an associated cache which buffers recently used tracks of data. The case for cache disks is presented, and some of the issues are discussed. Parameter values for some aspects of the cache design are suggested. The second part of this paper summarizes the author's work on file migration, by which files are migrated between disk and mass storage as needed in order to effectively maintain on-line a much larger amount of information than the disks can hold. Some of the algorithms investigated are discussed, and the basic results are presented.

关键词： File migration Disk Disk Cache Cache Controller Buffer replacement algorithm Input/Output File Systems

来源：评论

学校读者我要写书评

暂无评论

Construction of Distributed Cache Mechanism in Database Laboratorial Curriculum Design

Construction of Distributed Cache Mechanism in Database Labo...

引用

IEEE International Symposium on IT in Medicine and Education

作者： Zhang Cai-ming Liu Hui Shandong Econ Univ Comp Sci & Technol Dept Jinan 250014 Peoples R China

ISBN: (纸本)9781424425105

With the development of Internet Technology, in most universities and colleges, the education researches and innovation about professional curriculum of computer science & technology have occurred continually. In our database laboratorial curriculum design, we put forward higher requirements with the performance in Decision Support System (DSS). In order to improve the query response-time in DSS, this paper proposes a new DSS architecture with Distributed Cache Mechanism, gives the working flow of the system, and introduces an admission & replacement algorithm. Experimental results show that the system performance is favorable.

关键词： Curriculum Design System performance Cache memory universities Database Technological Innovations Distribute replacement algorithm Reaction Time

来源：评论

学校读者我要写书评

暂无评论

A Penalty Aware Memory Allocation Scheme for Key-value Cache 44

A Penalty Aware Memory Allocation Scheme for Key-value Cache

引用

44th Annual International Conference on Parallel Processing Workshops (ICPPW)

作者： Ou, Jianqiang Patton, Marc Moore, Michael Devon Xu, Yuehai Jiang, Song Wayne State Univ ECE Dept Detroit MI 48202 USA

ISBN: (纸本)9781467375887

Key-value caches, represented by Memcached, play a critical role in data centers. Its efficacy can significantly impact users' perceived service time and back-end systems' workloads. A central issue in the in-memory cache's management is memory allocation, or how the limited space is distributed for storing key-value items of various sizes. When a cache is full, the allocation issue is how to conduct replacement operations on items of different sizes. To effectively address the issue, a practitioner must simultaneously consider three factors, which are access locality, item size, and miss penalty. Existing designs consider only one or two of the first two factors, and pay little attention on miss penalty. This inadequacy can substantially compromise utilization of cache space and request service time. In this paper we propose a Penalty Aware Memory Allocation scheme (PAMA) that takes all three factors into account. While the three different factors cannot be directly compared to each other in a quantitative manner, PAMA uses their impacts on service time to determine where a unit of memory space should be (de) allocated. The impacts are quantified as the decrease (or increase) of service time if a unit of space is allocated (or deallocated). PAMA efficiently tracks access pattern and use of memory, and speculatively evaluates the impacts to enable penalty-aware memory allocation for KV caches. Our evaluation with real-world Memcached workload traces demonstrates that PAMA can significantly reduce request service time compared to other representative KV cache management schemes.

关键词： Key-value Cache replacement algorithm Locality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：