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

LER: Least-Error-Rate replacement algorithm for Emerging STT-RAM caches

IEEE TRANSACTIONS ON DEVICE AND MATERIALS RELIABILITY 2016年第2期16卷 220-226页

作者： Monazzah, Amir Mahdi Hosseini Farbeh, Hamed Miremadi, Seyed Ghassem Sharif Univ Technol Dept Comp Engn Tehran *** Iran

Spin-transfer-torque RAMs (STT-RAMs) are the most promising technology for replacing Static RAMs (SRAMs) in on-chip caches. One of the major problems in STT-RAMs is the high error rate due to stochastic switching in WRITE operations. cache replacement algorithms have a major role in the number of WRITE operations into the caches. Due to this fact, it is necessary to redesign cache replacement algorithms to consider the new challenges of STT-RAM caches. This paper proposes a cache replacement algorithm, which is called least error rate (LER), to reduce the error rate in L2 caches. The main idea is to place the incoming block in a line that incurs the minimum error rate in WRITE operation. This is done by comparing the contents of the incoming block with lines in a cache set. Compared with Least Recently Used (LRU) algorithm, LER reduces the error rate by 2x with about 1.4% and 3.6% performance and dynamic energy consumption overheads, respectively. Moreover, LER imposes no area overhead to system.

关键词： cache replacement algorithm error rate stochastic switching STT-RAM

来源：评论

学校读者我要写书评

暂无评论

RUE: A caching method for identifying and managing hot data by leveraging resource utilization efficiency

引用

SOFTWARE-PRACTICE & EXPERIENCE 2021年第11期51卷 2252-2273页

作者： Ai, Liang Deng, Yuhui Zhou, Yi Feng, Hao Jinan Univ Dept Comp Sci Guangzhou 510632 Peoples R China Wuhan Natl Lab Optoelect Wuhan Peoples R China Columbus State Univ TSYS Sch Comp Sci Columbus GA USA

In this study, we propose a caching method called RUE for dynamic large-scale data streams. We define a data model to facilitate hot data identification and management. At the heart of RUE model is hot degree that takes into account two factors data resource utilization efficiency and reuse distance, aiming to quantitatively reflect data popularity in a dynamic data stream. Based on data's hot degree, RUE classifies data into four types, each of which is assigned with an associated cache residence time. Guided by RUE model, we develop HM algorithm to identify and manage hot data in a dynamic data stream. HM algorithm is implemented by four stacks, namely, new stack, short stack, long stack, and temp stack. Moreover, an eviction and a migration algorithms are integrated into HM to facilitate block replacement and migration. To evaluate the performance of HM algorithm, we quantitatively compare the performance of RUE with three state-of-art algorithms, namely, LRU, LIRS, and ARC under various replacement policies, operations, and workloads. Experimental results show that RUE outperforms these three existing algorithms in terms of both read and write hit rates. Furthermore, we show that with the four stacks in place, the computing overhead of HM is negligible.

关键词： cache replacement algorithm caching hot data identification and management resource utilization efficiency reuse distance

来源：评论

学校读者我要写书评

暂无评论

Adaptive Peer Caching for P2P Video-on-Demand Streaming

Adaptive Peer Caching for P2P Video-on-Demand Streaming

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Kim, Jongtack Im, Heesu Bahk, Saewoong Tmax R and D Center TmaxSoft South Korea School of EECS INMC Seoul National University South Korea

ISBN: (纸本)9781424456383

In this paper, we propose a novel P2P VoD streaming system, named PECAN where each peer adjusts its cache capacity adaptively to meet the server's upload bandwidth constraint and achieve the fairness. For doing so, we first propose a new cache replacement algorithm that designs the number of caches for a segment to be proportional to its popularity. Second, we mathematically prove that if the cache capacity of a peer is proportional to its segment request rate, the fairness between upload and download amounts at each peer can be achieved. Third, we propose a method that determines each peer's cache capacity adaptively according to the constraint of the server's upload bandwidth. Through simulations, we show that PECAN meets the server upload bandwidth constraint, and achieves the fairness well at each peer.

关键词： P2P VoD streaming system P2P video-on-demand streaming PECAN system adaptive peer caching cache capacity cache replacement algorithm cache storage peer-to-peer computing segment request rate upload bandwidth constraint video on demand video streaming

来源：评论

学校读者我要写书评

暂无评论

The Optimization Mechanism Research of Distributed Unified Authentication Based on cache 14

The Optimization Mechanism Research of Distributed Unified A...

引用

14th Web Information Systems and Applications Conference (WISA)

作者： Yang, Dongju Kai, Feng North China Univ Technol Res Ctr Cloud Comp Beijing Key Lab Integrat & Anal Large Scale Strea Beijing Peoples R China

ISBN: (纸本)9781538648063

It is one of the popular and effective way to build a unified authentication center to implement single sign-on among many applications in the enterprise. How to deal with the high concurrent and high flow of user requests to ensure the stability and efficiency of the authentication service is most important when integrating multiple systems. Aiming at the problem of authentication center, such as overloaded, single point of failure, slow response time, etc. we put forward a distributed architecture with cache to enable the unified authentication. The authentication tickets can be shared among multiple nodes by cache. The hot and important data can be prefetched to cache to improve the response time. A multi-factor cache replacement algorithm based on Hybird is also proposed which combining complex and diverse user behavior to improve the effectiveness of data replacement. The experimental results show that the optimized distributed authentication architecture can guarantee the stability of the system, and the cache mechanism can improve the response time, and a multi factor cache replacement algorithm based on Hybird can improve the cache hit ratio.

关键词： application integration identity authentication high availability cache mechanism cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

STAR: A Zone Translation Scheme to Improve the Performance of Host-Aware SMR 6

STAR: A Zone Translation Scheme to Improve the Performance o...

引用

IEEE 6th International Conference on Big Data Analytics (ICBDA)

作者： Liu, Wenguo Li, Hui Zeng, Lingfang Inspur Elect Informat Ind Co Ltd State Key Lab High End Server & Storage Technol Jinan Peoples R China Zhejiang Lab Hangzhou Peoples R China

ISBN: (纸本)9781665415132

The exponential growth of big data requires more and more storage space. Host aware SMR (HA-SMR) drives are the most promising among the three types of SMR drives which can effectively improve the areal density of hard disk drives. However, when handling non-sequential writes under write-intensive workloads, a host-aware SMR drive often suffers from performance degradation. In this paper, we propose a hybrid storage system called STAR, which consists of an SSD cache and an HA-SMR drive. In STAR, we propose a new data layout management for the HA-SMR drive, which divides the whole space of the HA-SMR drive into data zones and a log section. The log section is used to buffer data blocks for the data zones. We design a zone translation layer (ZTL) at the host side for the HA-SMR drive to translate non-sequential writes to sequential ones, and we call it ZTL HA-SMR drive. In addition, we also use an SSD cache to absorb non-sequential writes for the ZTL HA-SMR drive and design a cache replacement algorithm called LCF, which can reduce data migration in the ZTL HA-SMR drive. Our experimental results show that STAR can effectively reduce non-sequential writes to the HA-SMR drive and improve the performance of the HA-SMR drive as well.

关键词： SSD cache HA-SMR drive zone translation layer cache replacement algorithm non-sequential writes

来源：评论

学校读者我要写书评

暂无评论

Architecture of proxy partial caching using HTTP for supporting interactive video and cache consistency 11

Architecture of proxy partial caching using HTTP for support...

引用

11th International Conference on Computer Communications and Networks

作者： Liao, WK Shih, PH Natl Chiao Tung Univ Dept Commun Engn Hsinchu Taiwan

ISBN: (纸本)078037553X

Proxy partial caching, e.g. segment-based proxy caching or proxy prefix caching, partitions the object into non-overlapping pieces. The proxy cache then treats each piece as an individual file when performing caching and replacing. Upon receipt of request to the object, the proxy cache delivers the cached portion to the client immediately to mask the start-up delay. However, two architectural challenges are confronted when implementing this technique in the web proxy software, e.g., Squid cache. The first challenge is related to caching video streams. Although not until recently, HTTP is recognized as an efficient method to support interactive video, many fundamental issues are still required to be solved. To this end, we propose an approach of segment-based video streams retrieval and caching via HTTP byte-range requests to further mask the possible start-up delay, enhance the interactive function "pause", and simplify the web proxy cache design. Proxy partial caching introduces the second architectural challenge called dirty-initial-segments problem, i.e. cached portion in the proxy cache is inconsistent with the original in the server. If this happens, the cached portion already delivered to the client cannot be concatenated with the latter portion from the server. To relieve this problem, we propose a novel algorithm called validating upon partial replacement, which synchronizes the operations of proactive consistency validation, partition and replacement performed upon an object. We show that our proposed algorithm bears the merit of controllable chance to disturb users, easily embedding into the existing web proxy cache with minimum modification, and improving the cache performance.

关键词： Web proxy cache partial caching cache consistency cache replacement algorithm video on demand

来源：评论

学校读者我要写书评

暂无评论

GDSF-Based Low Access Latency Web Proxy Caching replacement algorithm 18

GDSF-Based Low Access Latency Web Proxy Caching Replacement ...

引用

2nd International Conference on Computer Science and Artificial Intelligence (CSAI) / 10th International Conference on Information and Multimedia Technology (ICIMT)

作者： Zhao, Zehua Ma, Yan Cong, Qun Beijing Univ Posts & Telecommun Inst Network Technol 10 Xitucheng Rd Beijing Peoples R China Beijing WRD Technol Co Ltd 5th Floor35 Wenhuiyuan Rd Beijing Peoples R China

ISBN: (纸本)9781450366069

In order to solve the problem that the GDSF (Greedy Dual Size Frequency) cache replacement algorithm has an insufficient effect on user access delay reduction in the reverse proxy environment, this paper proposes an improved algorithm GDSF-LAL (Greedy Dual Size Frequency - Low Access Latency). The algorithm considers the delay from two terms: one is caused by the proxy server for requesting resources from the origin backend server when the web resources miss in the cache, and the other is to send responses to users. As well, we consider user access delay reduction rate and total user access delay to evaluate this algorithm. The simulation results show that the performance of our algorithm is better than that of the GDSF algorithm.

关键词： Web cache cache replacement algorithm GDSF algorithm Network

来源：评论

学校读者我要写书评

暂无评论

A novel caching scheme for Internet based mobile ad hoc networks 12

A novel caching scheme for Internet based mobile ad hoc netw...

引用

12th International Conference on Computer Communications and Networks (ICCCN 2003)

作者： Lim, SH Lee, WC Cao, GH Das, CR Penn State Univ Dept Comp Sci & Engn University Pk PA 16802 USA

ISBN: (纸本)0780379454

Internet based mobile ad hoc network (IMANET) is an emerging technique that combines a wired network (e.g. Internet) and a mobile ad hoc network (MANET) for developing a ubiquitous communication infrastructure. However, IMANET has several limitations to fulfill users' demands to access various kinds of information such as limited accessibility to the wired Internet, insufficient wireless bandwidth, and longer message latency. In this paper, we address the issues involved in information search and access in IMANET. A broadcast based Simple Search (SS) algorithm and an aggregate caching mechanism are proposed for improving the information accessibility and reducing average communication latency in IMANET. As part of the aggregate cache, a cache admission control policy and a cache replacement policy, called Time and Distance Sensitive (TDS) replacement, are developed to reduce the cache miss ratio and improve the information accessibility. We evaluate the impact of caching, cache management, and access points, which are connected to the Internet, through extensive simulation. The simulation results indicate that the proposed aggregate cache can significantly improve an IMANET performance in terms of throughput and average number of hops to access data. In particular, with aggregate caching, more than 200% improvement in throughput is achieved compared to the IMANET with no cache case, when the access pattern follows a Zipf distribution.

关键词： aggregate cache cache admission control cache replacement algorithm internet based mobile ad hoc network simple search algorithm

来源：评论

学校读者我要写书评

暂无评论

Web Log Mining for Improvement of Caching Performance

Web Log Mining for Improvement of Caching Performance

引用

International MultiConference of Engineers and Computer Scientists (IMECS 2012)

作者： Soonthomsutee, Rudeekom Luenam, Pramote Natl Inst Dev Adm Sch Appl Stat Bangkok Thailand

ISBN: (纸本)9789881925114

The objective of this study is to build a model of cache replacement policy for improvement of web caching performance. The integration approach of cluster analysis and classification are used to create a classifier for predicting the cache life time. The data set was collected from the cache of the National Institute Development Administration's proxy servers. The data collection period was from October 2009 to March 2010. There are four main tasks in this study. First, the access log from proxy servers were collected and preprocessing tasks were performed. Second, the access log data were partitioned into clusters based on users' access patterns. Third, classifier models of the cache replacement policy were built and their accuracies were compared. Finally, the efficiency of the selected classifier was compared with other cache replacement algorithms. Results show that overall classification accuracy of the model is satisfactory and the model is efficient and very good in performance.

关键词： web log mining web caching cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

On the Theory and Potential of LRU-MRU Collaborative cache Management 11

On the Theory and Potential of LRU-MRU Collaborative Cache M...

引用

International Symposium on Memory Management (ISMM 11)

作者： Gu, Xiaoming Ding, Chen Univ Rochester Dept Comp Sci Rochester NY 14627 USA

ISBN: (纸本)9781450302630

The goal of cache management is to maximize data reuse. Collaborative caching provides an interface for software to communicate access information to hardware. In theory, it can obtain optimal cache performance. In this paper, we study a collaborative caching system that allows a program to choose different caching methods for its data. As an interface, it may be used in arbitrary ways, sometimes optimal but probably suboptimal most times and even counter productive. We develop a theoretical foundation for collaborative caches to show the inclusion principle and the existence of a distance metric we call LRU-MRU stack distance. The new stack distance is important for program analysis and transformation to target a hierarchical collaborative cache system rather than a single cache configuration. We use 10 benchmark programs to show that optimal caching may reduce the average miss ratio by 24%, and a simple feedback-driven compilation technique can utilize collaborative cache to realize 50% of the optimal improvement.

关键词： algorithms Measurement Performance collaborative caching bipartite cache cache replacement algorithm LRU MRU OPT

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：