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

4th International Conference on Systems and Informatics (ICSAI)

作者： Xie, Wenhao Wang, Xiaoyan Xian Shiyou Univ Dept Sci Xian Shaanxi Peoples R China Northwestern Polytech Univ Dept Management Sci & Engn Xian Shaanxi Peoples R China

ISBN: (纸本)9781538611074

This paper has put forward the new cache replacement algorithm considering the popularity of the program, byte cache efficiency, file use frequency and other factors for P2P streaming media on demand system. The new algorithm can meet the high load requirements of the network. On this basis, it has completed the experiments of simulation in order to verify the new cache replacement algorithm. At the same time, it has compared the results with the traditional cache replacement algorithms and analyzed the advantages and disadvantages of the new algorithm.

关键词： P2P the streaming media system cache replacement algorithm cache management strategies

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization by Dynamically Altering cache replacement algorithm in CPU-GPU Heterogeneous Multi-Core Architecture 17

Performance Optimization by Dynamically Altering Cache Repla...

引用

17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)

作者： Fang, Juan Fan, Qingwen Hao, Xiaoting Cheng, Yanjin Sun, Lijun Beijing Univ Technol Intel Beijing Univ Technol Fac Informat Technol Multicore Technol LabColl Comp Sci Beijing Peoples R China

ISBN: (纸本)9781509066117

cache memory helps in expediting the speed of data retrieval time in processors in heterogeneous multi-core architecture, which is the main factor that affects system performance and power consumption. The implementation algorithm of cache replacement in current heterogeneous multi-core environment is thread-blinded, leading to a lower utilization of the cache. In fact, each of the CPU and GPU applications has its own characteristics, where CPU is responsible for the implementation of tasks and serial logic control, while GPU has a great advantage in parallel computing, which causes the need of cache blocks for CPU more sensitive than those for GPU. With that in mind, this research gives full consideration to the increment of thread priority in the cache replacement algorithm and takes a novel strategy to improve the work efficiency of last-level-cache (LLC), where the CPU and GPU applications share LLC dynamically and not in an absolutely fair status. Furthermore, our methodology switches policies between the LRU (Least Recently Used) and LFU (Least Frequently Used) effectively by comparing the number of cache misses on the LLC, which takes both the time and frequency of the accessing cache block into consideration. The experimental results indicate that this optimization method can effectively improve system performance.

关键词： CPU-GPU heterogeneous multi-core cache replacement algorithm System performance

来源：评论

学校读者我要写书评

暂无评论

An Efficient cache replacement algorithm for Minimizing the Error Rate in L2-STT-MRAM caches 4

An Efficient Cache Replacement Algorithm for Minimizing the ...

引用

4th IEEE International Conference on Parallel, Distributed and Grid Computing (IEEE PDGC)

作者： Olanrewaju, Rashidah F. Baba, Asifa Mehraj Khan, Burhan Ul Islam Yaacob, Mashkuri Azman, Amelia Wong Mir, Mohammad Shuaib IUM Malaysia Kulliyyah Engn Dept ECE Gombak Malaysia LUST Awantipora Sch Technol Dept ECE Awantipora Jammu & Kashmir India

ISBN: (纸本)9781509036691

In the recent times, various challenges are being encountered during SRAM cache design and development which lead to a situation of converting the memory cell technologies into on-chip embedded caches. The current research statistics towards cache designing reveals that Spin Torque Transfer Magnetic RAMs, preferably termed as STT-MRAMs has become one of the most promising areas in the field of memory chip design. Hence, it gained a lot of attention from the researchers due to its dynamic direct map and data access policies for reducing the average cost i.e. time and energy optimization. Instead of having efficient main memory access capability, STT-MRAMs suffer due to high error rate caused during stochastic switching in write operations. cache replacement algorithms play a significant role in minimizing the error rate in write operations. The proposed study aims to offer a theoretical and analytical modeling of an efficient cache replacement scheme to overcome the error as mentioned above in L2-STT-MRAM caches. The performance analysis of the proposed algorithm ensures its effectiveness in reducing the error rate and cost overheads as compared to the conventional LRU technique implemented on SRAM cells.

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

来源：评论

学校读者我要写书评

暂无评论

Research on Improved cache replacement algorithm Serving for Wind Power System

Research on Improved Cache Replacement Algorithm Serving for...

引用

6th International Conference on Smart Grid and Clean Energy Technologies (ICSGCE)

作者： Lu, Erjie Chen, Luan Li, Jian Mo, Bintao Chang, Jian Huang, Qi Univ Elect Sci & Technol China Sch Energy Sci & Engn Chengdu Sichuan Provinc Peoples R China

ISBN: (纸本)9781467389044

To improve the distributed cache replacement algorithm performance in wind power system, after researching several traditional algorithms such as LFU (Least Frequently Used), SIZE (Object Size Based), LRU (Least Recently Used) and Hybrid (Saved Value Based), a new algorithm FST (Frequency, Object size, Access time) is proposed. This algorithm combines the features of access frequency, object size, access time interval, and the longest time without access. It avoids the outdated "hot spots" document's occupying memory space to waste resources, so it is supposed to improve the system performance. By taking contrast test with LFU, SIZE and LRU in the wind power system cache server, FST algorithm shows better performance in request hit rate, byte hit rate and reducing delay time.

关键词： cache replacement algorithm wind power system request hit rate byte hit rate delay time

来源：评论

学校读者我要写书评

暂无评论

The Summarize of cache Management Strategy and cache replacement algorithm in P2P Streaming Media Requesting Program System

The Summarize of Cache Management Strategy and Cache Replace...

引用

2015 International Conference on Information,Business and Management(IBM 2015)

作者： Wenhao Xie Department of Applied Mathematics Xi'an Shiyou University

Based on the analysis of cache management strategies and cache replacement algorithm in current P2P streaming media system,this paper deeply analyzes and researches the cache management *** considering the popularity of the program,byte caching effectiveness,frequency of usage in the future and so on,the author introduces the indicators of success for replacement strategy,the cache media stream scheduling strategies,all kinds of cache control strategies and the cache replacement *** most of the cache management strategies and cache replacement algorithms can meet the demands of the of P2P streaming media requesting program *** the basis of it,this paper introduces the shortages of the existing cache replacement *** can provide the basis of further explore new cache replacement ***,It analyses its application prospect.

关键词： P2P cache management strategy cache media stream scheduling strategy cache replacement algorithm Streaming media requesting program system

来源：评论

学校读者我要写书评

暂无评论

A Modified PSO algorithm Based On cache replacement algorithm 10

A Modified PSO Algorithm Based On Cache Replacement Algorith...

引用

10th International Conference on Computational Intelligence and Security CIS 2014

作者： Feng, Mingyue Pan, Hua Xidian Univ Xian Peoples R China

ISBN: (纸本)9781479974344

Recently, the research of the PSO algorithm has gained more attention. The performance of the PSO algorithm can be improved by using hybrid techniques. In this paper, to solve the problem of slow convergence and optimize the PSO algorithm performance, we propose a new algorithm - cache replacement Search PSO (CRS-PSO), which integrates basic PSO and the idea of cache design in the computer realm. The experimental results show that the proposed CRS-PSO can effectively solve the slow convergence problem and give a better performance than PSO alone.

关键词： particle swarm optimization cache replacement algorithm hybrid algorithm slow convergence

来源：评论

学校读者我要写书评

暂无评论

LRU-MRU With Physical Address cache replacement algorithm On FPGA Application 17

LRU-MRU With Physical Address Cache Replacement Algorithm On...

引用

IEEE 17th International Conference on Computational Science and Engineering (CSE)

作者： Xue, Yuan Lei, Yongmei Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China

ISBN: (纸本)9781479979813

A caching model is proposed to accelerate the I/O speed between disks and FPGA devices in the conditions of reconfigurable computing. Especially the speed of FPGA processing is much larger than the RAID reading rate. The accelerating strategy is based on LRU-MRU replacement, adding physical address factors at the same time. In the case of two-cache application mode, the accelerating strategy, according to the characteristics of FPGA application, can accelerate 5% comparing with the traditional LRU-MRU algorithm. Through the quantitative analysis of this algorithm, we propose the cache optimization model of small file to improve disk read rate for FPGA computation.

关键词： cache replacement algorithm physical address LRU-MRU RAID FPGA

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Incremental Least-Recently-Used algorithm: Good, Robust, and Predictable Performance 59

Incremental Least-Recently-Used Algorithm: Good, Robust, and...

引用

59th Annual IEEE International Conference on Communications (IEEE ICC)

作者： Chen, Chunpeng Zhang, Jinbei Cai, Kechao Sun Yat Sen Univ Sch Elect & Commun Engn Shenzhen Peoples R China

ISBN: (纸本)9798350304060;9798350304053

In this paper, we propose a replacement algorithm for file caching in communication networks. While various schemes for file replacement exist, achieving simultaneous good, robust, and predictable performance remains challenging. To address this challenge, we introduce the Incremental Least-Recently-Used (iLRU) algorithm, a general scheme building on the Least-Recently-Used (LRU) algorithm. iLRU initially caches a portion of a file upon the first request and incrementally caches more with subsequent requests. Request frequency is inferred from caching states without additional overhead, where a larger cached size indicates higher request frequency. We develop an analytical model based on the Time-to-Live (TTL) concept to predict iLRU's hit ratio. Our theoretical analysis demonstrates that iLRU allocates a larger cache space to popular files, achieving a higher hit ratio than the LRU algorithm. Simulation results show that iLRU outperforms classical algorithms and validate the accuracy of the analytical model. Furthermore, the results on real traces validate iLRU's robustness in various scenarios.

关键词： Communication Networks cache replacement algorithm Performance Analysis

来源：评论

学校读者我要写书评

暂无评论

Adaptive Size-Aware cache Insertion Policy for Content Delivery Networks 40

Adaptive Size-Aware Cache Insertion Policy for Content Deliv...

引用

IEEE 40th International Conference on Computer Design (ICCD)

作者： Wang, Peng Liu, Yu Zhao, Zhelong Zhou, Ke Huang, Zhihai Chen, Yanxiong Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Wuhan Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan Peoples R China Tencent Technol Shenzhen Co Ltd Shenzhen Peoples R China

ISBN: (数字)9781665461863

ISBN: (纸本)9781665461863

Content delivery networks (CDNs) are large distributed cache systems that deliver objects with inconsistent sizes. The zero-reuse objects that are not reused in a time window but still loaded and evicted in the cache waste cache resources and result in degradation of object hit ratio (OHR) in CDNs. Although prohibiting these objects from entering the cache is a viable solution, the variable workloads and various object sizes in CDNs make the determination of zero-reuse difficult, resulting in an increased risk of bandwidth overhead in the data center by the misjudgment. To alleviate this problem, we propose to use the insertion policy to give each object at least one chance to be hit. Meanwhile, we find that the distribution of zero-reuse objects correlates with their sizes through data analysis. As a result, we propose an adaptive size-aware cache insertion policy (ASC-IP) for the OHR improvement and design an adaptive scheme to dynamically adjust the size threshold used to determine the zero-reuse objects, adapting the mutative access patterns with negligible overhead. We have deployed ASC-IP in TDC of Company-T and ASC-IP can improve the OHR by 9.6% and reduce the user access latency by 7.14ms on average and reduce the back-to-source bandwidth by 8.75Gbps. In addition, on Twitter, Wikipedia, and a real-world Trace-T, we show that ASC-IP outperforms state-of-the-art cache algorithms working on CDNs and can upgrade LRU-based replacement algorithms with negligible overheads.

关键词： content delivery network cache replacement algorithm cache insertion policy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：