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

The Configuration Strategies on Caching for Web Servers

Wuhan University Journal of Natural Sciences 2006年第3期11卷 585-590页

作者： GUO Chengcheng ZHANG Li YAN Puliu School of Electronic Information Wuhan UniversityWuhan 430072 Hubei China

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.

关键词： web servers dynamic content caching configuration management replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

LONG-TERM FILE MIGRATION - DEVELOPMENT AND EVALUATION OF algorithmS

引用

COMMUNICATIONS OF THE ACM 1981年第8期24卷 521-532页

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

The steady increase in the power and complexity of modern computer systems has encouraged the implementation of automatic file migration systems which move files dynamically between mass storage devices and disk in response to user reference patterns. Using information describing 13 months of user disk data set file references, we develop and evaluate (replacement) algorithms for the selection of files to be moved from disk to mass storage. Our approach is general and demonstrates a general methodology for this type of problem. We find that algorithms based on both the file size and the time since the file was last used work well. The best realizable algorithms tested condition on the empirical distribution of the times between file references. Acceptable results are also obtained by selecting for replacement that file whose size times time to most recent reference is maximal. Comparisons are made with a number of standard algorithms developed for paging, such as Working Set, VMIN, and GOPT. Sufficient information (parameter values, fitted equations) is provided so that our algorithms may be easily implemented on other systems. [ABSTRACT FROM AUTHOR]

关键词： file migration mass storage memory hierarchies paging replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Configuration strategies on caching for web servers

引用

Wuhan University Journal of Natural Sciences 2006年第3期11卷 585-590页

作者： Guo, Chengcheng Zhang, Li Yan, Puliu School of Electronic Information Wuhan University Wuhan 430072 China

The Web cluster has been a popular solution of network server system because of its scalability and cost effectiveness. 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 introduces three different replacement algorithms in our cache proxy module to test the practical effects of caching dynamic pages under different conditions. The paper chiefly analyzes the influences of generated time and accessed frequency on caching dynamic Web pages. The paper also provides the detailed experiment results and main conclusions.

关键词： Configuration management Dynamic content caching replacement algorithm Web servers

来源：评论

学校读者我要写书评

暂无评论

NOTE ON AN ANOMALY IN PAGING

引用

COMMUNICATIONS OF THE ACM 1970年第7期13卷 451-&页

作者： POMERANZ, JE Univ. of Chicago Chicago IL

In [1] the authors use a lemma to prove their Theorem 1 (pp. 352-353). While the lemma is true, there is a defect in its proof, for one cannot assume that each of the symbols appearing as a type IV reference is in t(Ek , s). Using their example (p. 350) as a reference string with k = 12, t(E12 , 3) is 534 and lacks the two symbols (1 and 2) which appear as type IV references.

关键词： demand paging paging machines replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Grained Buffer Management for Database Systems

引用

FUTURE INTERNET 2021年第12期13卷 303页

作者： Wang, Xiaoliang Jin, Peiquan Univ Sci & Technol China Sch Comp Sci & Technol Hefei 230026 Peoples R China Chinese Acad Sci Key Lab Electromagnet Space Informat Hefei 230027 Peoples R China

The traditional page-grained buffer manager in database systems has a low hit ratio when only a few tuples within a page are frequently accessed. To handle this issue, this paper proposes a new buffering scheme called the AMG-Buffer (Adaptive Multi-Grained Buffer). AMG-Buffer proposes to use two page buffers and a tuple buffer to organize the whole buffer. In this way, the AMG-Buffer can hold more hot tuples than a single page-grained buffer. Further, we notice that the tuple buffer may cause additional read I/Os when writing dirty tuples into disks. Thus, we introduce a new metric named clustering rate to quantify the hot-tuple rate in a page. The use of the tuple buffer is determined by the clustering rate, allowing the AMG-Buffer to adapt to different workloads. We conduct experiments on various workloads to compare the AMG-Buffer with several existing schemes, including LRU, LIRS, CFLRU, CFDC, and MG-Buffer. The results show that AMG-Buffer can significantly improve the hit ratio and reduce I/Os compared to its competitors. Moreover, the AMG-Buffer achieves the best performance on a dynamic workload as well as on a large data set, suggesting its adaptivity and scalability to changing workloads.

关键词： buffer management replacement algorithm multi-grained buffer adaptive buffer

来源：评论

学校读者我要写书评

暂无评论

AN ANOMALY IN SPACE-TIME CHARACTERISTICS OF CERTAIN PROGRAMS RUNNING IN A PAGING MACHINE

引用

COMMUNICATIONS OF THE ACM 1969年第6期12卷 349-&页

作者： BELADY, LA NELSON, RA SHEDLER, GS IBM Thomas J. Watson Research Center Yorktowm Heights NY IBM Thomas J. Watson Research Center Yorktowm Heights NY IBM Thomas J. Watson Research Center Yorktowm Heights NY

The running time of programs in a paging machine generally increases as the store in which programs are constrained to run decreases. Experiment, however, have revealed cases in which the reverse is true: a decrease in the size of the store is accompanied by a decrease in running *** informal discussion of the anomalous behavior is given, and for the case of the FIFO replacement algorithm a formal treatment is presented.

关键词： demand paging paging machines replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Buffer Cache Management for Combined MLC and SLC Flash Memories Using both Volatile and Nonvolatile RAMs

Buffer Cache Management for Combined MLC and SLC Flash Memor...

引用

IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

作者： Junseok Park Hyokyung Bahn Kern Koh School of Computer Science and Engineering Seoul National University Dept. of Computer Science and Engineering Ewha University

ISBN: (纸本)9781424449316

This paper presents a new buffer cache management scheme called DABC-NV for mixed MLC and SLC flash memories as the secondary storage and both byte-accessible NVRAM and conventional volatile RAM as their buffer caches. DABC-NV has four salient features. First, it allocates buffer cache space to MLC and SLC flash memories based on their I/O costs and then dynamically adjusts the allocated size according to the evolution of workloads. Second, it separately exploits read and write histories of block references, and thus it estimates future references of each operation more precisely. Third, it guarantees the complete consistency of write I/Os since all dirty data are cached in nonvolatile buffer caches. Fourth, metadata lists are maintained separately from cached blocks. This allows more efficient management of volatile and nonvolatile buffer caches based on read and write histories, respectively. Trace-driven simulations show that DABC-NV improves the I/O performance of embedded systems significantly. Specifically, it reduces I/O time by 24% on average compared to the CLOCK-NV algorithm.

关键词： replacement algorithm NVRAM NAND flash memory Buffer caching MLC flash memory

来源：评论

学校读者我要写书评

暂无评论

Cache Performance Research for Embedded Processors

Cache Performance Research for Embedded Processors

引用

2012 International Conference on Solid State Devices and Materials Science(SSDMS 2012)

作者： Chenxu WANG Jiamin ZHENG Mingyan YU Microelectronics Center Harbin Institute of Technology at Weihai

The embedded processor performance is significantly influenced by cache whose performance depend on its architecture parameters. Meanwhile, In order to overcome the non-timing accurate flaw of software simulation method, In this paper, a hardware emulation method--RTL level models is used for CPU and cache controller, while circuit model for cache memory cell--is adopted to do research on cache performance. A more accurate design space, miss rate and cycle trend influenced by cache parameters, is presented. Compared with Round Robin, it shows that miss rate and cycle number of instruction cache is reduced by 22.08% and 20.36%, respectively, because PseudoLRU is adopted.

关键词： cache performance research hardware model replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards a Flexible Resource Management System for Content Centric Networking

Towards a Flexible Resource Management System for Content Ce...

引用

IEEE International Conference on Communications

作者： Indra Widjaja Bell Labs Alcatel-Lucent

ISBN: (纸本)9781457720529

Content Centric Networking (CCN) is a new and promising architecture that can provide better security and much improved content delivery service than the current Internet. Each router in CCN has a content store that caches objects according to a replacement algorithm and a pending interest table that stores pending requests waiting for matching objects. We propose a novel and flexible resource management system where the content store can store objects as well as pending requests. To each pending request, we add control fields that can be used to control caching resources according to a given objective function. We examine several applications that can benefit from using the proposed resource management system. The experimental results quantify key performance improvements.

关键词： Resource Management System replacement algorithm Objective function shopping mall Networking Cache memory FLEXIBLE

来源：评论

学校读者我要写书评

暂无评论

Cache Performance Research For Embedded Processors

Cache Performance Research For Embedded Processors

引用

2010 International Conference on Circuit and Signal Processing (ICCSP 2010) & 2010 Second IITA International Joint Conference on Artificial Intelligence (IITA-JCAI 2010)

作者： Chenxu WANG Jiamin ZHENG Mingyan YU Microelectronics Center Harbin Institute of Technology at Weihai Weihai, Shandong

The embedded processor performance is significantly influenced by cache whose performance depend on its architecture parameters. Meanwhile, In order to overcome the non-timing accurate flaw of software simulation method, In this paper, a hardware emulation method --RTL level models is used for CPU and cache controller, while circuit model for cache memory cell--is adopted to do research on cache performance . A more accurate design space, miss rate and cycle trend influenced by cache parameters, is presented. Compared with Round Robin, it shows that miss rate and cycle number of instruction cache is reduced by 22.08% and 20.36%, respectively, because Pseudo- LRU is adopted.

关键词： cache performance research hardware model replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：