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

Conference on Internet Multimedia Management Systems II

作者： Long, BT Long, JD Xiang, Z Zhong, YH Tsinghua Univ Dept Comp Inst Media Beijing 100084 Peoples R China

ISBN: (纸本)0819442437

Interval caching can boost the throughput of video server by caching consecutive video request in a global cache. In this paper, we propose a novel cache admission control and replacement algorithm called ROC (Resist-Overload Capability) to efficiently manage cache usage in video server with interval caching. First, we introduce a deterministic cache admission control scheme to guarantee the QoS but serve under-utilization of the cache resources. Then a statistic-multiplex based admission control scheme is presented to improve the efficiency of cache usage by converting the characteristic of VBR video into the number of memory pages that the video interval requires during the service round. The statistic scheme suffers from the heavy convolution computation which deceases its efficiency. Thirdly, we simplify the convolution computation by using the Central Limit Theorem, and propose the Resist-Overload Capability metric to characterize the capability that resists the occurrences of cache overload. The related ROC based admission control scheme and replacement algorithm are proposed accordingly. The simulation results indicate(1) that ROC scheme highly improves the efficiency of cache management for VBR video server with interval caching.

关键词： interval caching cache admission control cache replacement algorithm VBR video video server

来源：评论

学校读者我要写书评

暂无评论

Wildcard Rules Caching and cache replacement algorithms in Software-Defined Networking

引用

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT 2016年第1期13卷 19-29页

作者： Sheu, Jang-Ping Chuo, Yen-Cheng Natl Tsing Hua Univ Dept Comp Sci Hsinchu 30013 Taiwan

In software-defined networking, flow tables of OpenFlow switches are implemented by ternary content addressable memory (TCAM). Although TCAM can process input packets in high speed, it is a scarce and expensive resource providing only a few thousands of rule entries on a network switch. Rules caching is a technique to solve the TCAM capacity problem. However, the rule dependency problem is a challenging issue for wildcard rules caching where packets can mismatch rules. In this paper, we use a cover-set approach to solve the rule dependency problem and cache important rules to TCAM. We also propose a rule cache replacement algorithm considering the temporal and spatial traffic localities. Simulation results show that our algorithms have better cache hit ratio than previous works.

关键词： Software-defined-networking TCAM rule dependency problem wildcard rules caching algorithm cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

HQ: An Architecture for Web cache replacement algorithms in Distributed Systems 6

HQ: An Architecture for Web Cache Replacement Algorithms in ...

引用

6th International Conference on Computer and Communication Engineering (ICCCE)

作者： Zou, Xueqiang Chen, Chen Chinese Acad Sci Inst Informat Technol Beijing Peoples R China

ISBN: (纸本)9781509024278

Distributed cache is capable of accelerating the process of retrieving an enormous amount of data. In order to optimize the cache performance in distributed environment, we present an architecture of cache replacement algorithms. The architecture called HQ (Hybrid Queue) focuses on organizing distributed cache clusters hierarchically, making use of the web data distribution. In addition, we also introduce a new cache replacement algorithm PDE (Predictive Dead-time Elimination), based on a compound measurement of data cached with the second exponential smoothing technique. Experiment indicates that HQ could bring 3% increment on cache hit-rate on average, while PDE could make a 3% increment as well, comparing with the most widely used algorithms, such as LRU, FIFO, LFU, LRFU, and EXP1 etc.

关键词： cache replacement algorithm Web cache Hybrid Architecture Distributed System

来源：评论

学校读者我要写书评

暂无评论

Compact CAR: Low-Overhead cache replacement Policy for an ICN Router

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2018年第6期E101B卷 1366-1378页

作者： Ooka, Atsushi Eum, Suyong Ata, Shingo Murata, Masayuki Natl Inst Informat & Commun Technol NICT Koganei Tokyo 1848795 Japan Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan Osaka City Univ Grad Sch Engn Osaka 5588585 Japan

Information-centric networking (ICN) has gained attention from network research communities due to its capability of efficient content dissemination. In-network caching function in ICN plays an important role to achieve the design motivation. However, many researchers on in-network caching due to its ability to efficiently disseminate content. The in-network caching function in ICN plays an important role in realizing the design goals. However, many in-network caching researchers have focused on where to cache rather than how to cache: the former is known as content deployment in the network and the latter is known as cache replacement in an ICN router. Although the cache replacement has been intensively researched in the context of web-caching and content delivery network previously, networks, the conventional approaches cannot be directly applied to ICN due to the fine granularity of chunks in ICN, which eventually changes the access patterns. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements in the design of a high performance ICN router. Then, we propose a novel cache replacement algorithm to satisfy the requirements named Compact CLOCK with Adaptive replacement (Compact CAR), which can reduce the consumption of cache memory to one-tenth compared to conventional approaches. In this paper, we argue that ICN requires a novel cache replacement algorithm to fulfill the requirements set for high performance ICN routers. Our solution, Compact CLOCK with Adaptive replacement (Compact CAR), is a novel cache replacement algorithm that satisfies the requirements. The evaluation result shows that the consumption of cache memory required to achieve a desired performance can be reduced by 90% compared to conventional approaches such as FIFO and CLOCK.

关键词： information-centric networking content-centric networking cache replacement algorithm in-network caching router

来源：评论

学校读者我要写书评

暂无评论

Efficient cache replacement policy for minimising error rate in L2-STT-MRAM caches

引用

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2018年第4期9卷 307-321页

作者： Olanrewaju, Rashidah F. Khan, Burhan Ul Islam Khan, Abdul Raouf Yaacob, Mashkuri Alam, Md. Moktarul IIUM Kulliyyah Engn Dept ECE Kuala Lumpur Malaysia King Faisal Univ Dept Comp Sci Al Hasa Saudi Arabia

The current research statistics for cache designing reveals that Spin Torque Transfer Magnetic RAMS (STT-MRAMs) have become one of the most promising technologies in the field of memory chip design, gaining a lot of attention from researchers due to its dynamic direct map and data access policies for reducing the average cost i.e. both time and energy optimisation. In this paper, the vulnerability of STT-MRAM caches has been investigated to examine the effect of workloads as well as process variations for characterising the reliability of STT-MRAM cache. The current study is intended to analyse and evaluate an existing efficient cache replacement policy namely Least Error Rate (LER) which utilises Hamming Distance (HD) computations to reduce the Write Error Rate (WER) of L2-STT-MRAM caches with acceptable overheads. The performance analysis of the algorithm ensures its effectiveness in reducing the WER and cost overheads as compared to the conventional LRU techniques.

关键词： cache replacement algorithm field assisted STT-MRAM error rate L2 caches

来源：评论

学校读者我要写书评

暂无评论

cache replacement Improving Based on User Group Interest Degree 1

引用

International Standard Conference on Trustworthy Computing and Services (ISCTCS)

作者： Zhang, Shuai Lu, Yueming Zhang, Xi Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100088 Peoples R China Minist Educ Key Lab Trustworthy Distributed Comp & Serv BUPT Beijing Peoples R China

ISBN: (数字)9783662474013

ISBN: (纸本)9783662474013;9783662474006

In order to reduce access latency and improve user experience, the current schemes include cache and prefetching technologies. The current cache replacement schemes only consider access time and access frequency, but ignore the user-group interest degree in access paths. This paper studies the visiting characteristics of user groups. Then a cache replacement improving algorithm is put forward called P-GDSF, which is based on the GDSF algorithm and joined the prediction mechanism due to user-group interest degree. The new algorithm takes most factors of Web objects into account. The simulation shows that our algorithm can achieve relatively higher hit rate and byte hit rate than the GDSF replacement algorithm in a certain cache space.

关键词： cache replacement algorithm User-group interest degree GDSF Access path Prefetching

来源：评论

学校读者我要写书评

暂无评论

Context Management Scheme Optimization of Coarse-Grained Reconfigurable Architecture for Multimedia Applications

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2017年第8期25卷 2321-2331页

作者： Cao, Peng Liu, Bo Yang, Jinjiang Yang, Jun Zhang, Meng Shi, Longxing Southeast Univ Natl ASIC Syst Engn Res Ctr Nanjing 210096 Jiangsu Peoples R China

Due to the combination of flexibility and efficiency, coarse-grained reconfigurable architectures (CGRAs) are suitable for the implementation of computing-intensive applications. However, with the growing performance requirements, the scale of CGRA increases exponentially, which leads to configuration performance degradation and configuration power rise. Based on the analysis of configuration context features, we optimize the context management scheme of CGRA from the aspects of context cache structure and replacement strategy. The context cache is structured hierarchically to reduce the memory overhead without configuration performance degradation and a hybrid context replacement algorithm is proposed to further increase the configuration efficiency with a novel context frequency weight factor. Experimental results show that the proposed context management scheme improves the configuration performance of the base CGRA significantly by 13.6%-20.5% for H.264 decoding and 13.6%-20.5% for MPEG2 decoding with only 43% context cache cost. Compared with other works, the proposed context management scheme shows the advantages of 2.3-6x less normalized context cache size and 2.3-2.7x cache efficiency.

关键词： cache replacement algorithm coarse-grained reconfigurable architecture (CGRA) context cache context management multimedia applications

来源：评论

学校读者我要写书评

暂无评论

MCB: a multidevice cooperative buffer management strategy for boosting the write performance of the SSD-SMR hybrid storage

引用

JOURNAL OF SUPERCOMPUTING 2023年第12期79卷 13462-13489页

作者： Zhang, Chi Nie, Shiqiang Wang, Jinyu Liu, Song Wu, Weiguo Xi An Jiao Tong Univ Sch Comp Sci & Technol West Xianning Rd Xian 710049 Shaanxi Peoples R China

Shingled magnetic recording (SMR) disks satisfy the growing demand for storage capacity for big data applications with their high capacity and low cost. However, the most severe challenge for SMR disks is the precipitous degradation of I/O performance when subjected to non-sequential writes. Using Solid State Drives (SSDs) as external caches for SMR disks is a cost-effective method to improve the I/O performance of SMR disks. Nevertheless, the existing SMR-oriented cache replacement algorithm is ineffective in resolving the conflict between the write amplification and the cache hit rate, resulting in limited performance gains from SSDs to SMR disks. In this paper, we design a multidevice cooperative buffer (MCB) management strategy to boost the write performance of SSD-SMR storage systems. Firstly, MCB selectively directs write traffic into the SSD cache to reduce the frequency of cleaning activity. Then, MCB adaptively evicts victim blocks from the SSD cache based on the locality principle. Finally, MCB utilizes a novelty SMR disk internal persistent buffer management mechanism to further optimize the efficiency of the SSD cache cleaning. The experimental results show that MCB achieves 7.4x and 1.5x performance improvements for write-intensive traces with spatial locality and temporal locality, respectively, compared to the state-of-the-art strategies.

关键词： Shingled magnetic recording Cost-effective hybrid storage Multidevice collaboration cache replacement algorithm Write amplification

来源：评论

学校读者我要写书评

暂无评论

Scalable cache Component in ICN Adaptable to Various Network Traffic Access Patterns

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2018年第1期E101B卷 35-48页

作者： Ooka, Atsushi Suyong, Eum Ata, Shingo Murata, Masayuki Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka 5650871 Japan Osaka City Univ Grad Sch Engn Osaka 5588585 Japan

Information-centric networking (ICN) has received increasing attention from all over the world. The novel aspects of ICN (e.g., the combination of caching, multicasting, and aggregating requests) is based on names that act as addresses for content. The communication with name has the potential to cope with the growing and complicating Internet technology, for example, Internet of Things, cloud computing, and a smart society. To realize ICN, router hardware must implement an innovative cache replacement algorithm that offers performance far superior to a simple policy-based algorithm while still operating with feasible computational and memory overhead. However, most previous studies on cache replacement policies in ICN have proposed policies that are too blunt to achieve significant performance improvement, such as first-in first-out (popularly, FIFO) and random policies, or impractical policies in a resource-restricted environment, such as least recently used (LRU). Thus, we propose CLOCK-Pro Using Switching Hash-tables (CUSH) as the suitable policy for network caching. CUSH can identify and keep popular content worth caching in a network environment. CUSH also employs CLOCK and hash-tables, which are low-overhead data structure, to satisfy the cost requirement. We numerically evaluate our proposed approach, showing that our proposal can achieve cache hits against the traffic traces that simple conventional algorithms hardly cause any hits.

关键词： information-centric networking content-centric networking caching cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Quality-Adaptive Proxy Caching for Peer-to-Peer Video Streaming Using Multiple Description Coding

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2009年第3期25卷 687-701页

作者： Ding, Jen-Wen Lan, Shi-Yuan Natl Kaohsiung Univ Appl Sci Dept Informat Management Kaohsiung 807 Taiwan

In the past few years, video streaming has been one of the most prominent applications in the Internet. There are basically two types of approaches to deliver on-demand video streams: infrastructure-based and infrastructure-less. The infrastructure-based approach, also known as the content delivery network (CDN) approach. employs numerous replicate servers and proxies to assist video streaming. The main drawback of this approach is that it is costly to deploy numerous servers and proxies. The infrastructure-less approach, also known as the peer-to-peer (P2P) approach, employs numerous peers to relay video streams. The main drawback of the P2P approach is its instability due to frequent joining/leaving of peers. The state-of-the-art development is to combine the two types of approaches. In this paper, we employ multiple description coding (MDC) to develop a novel P2P-assisted proxy caching scheme, called MP3, for on-demand video streaming. Our simulation results show that with the use of MDC, MP3 call effectively provide adaptive video quality for clients in a heterogeneous network environment.

关键词： adaptive video streaming peer-to-peer computing multimedia proxy cache replacement algorithm multiple description coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：