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

Online International Conference on Green Engineering and Technologies (IC-GET)

作者： Narvekar, Meera Nayak, Snehal Prabhu, Gaurav Brahmbhatt, Nikul DJ Sanghvi Coll Engn Dept Comp Engn Mumbai Maharashtra India

ISBN: (纸本)9781509045563

Predicting the location of the user can be done in various ways and recent development in this field gives us different approach for the same. For example prediction of user location can be predicted using different approach. The prediction of future context based on the recorded past locations is often conceived as the ultimate challenge in exploiting the whole of context histories. Another way to predict user location is by adapting user movement location or mining mobility features of user to predict the next location.

关键词： Location-based Services HMM cache replacement algorithm

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of High Efficiency Acquisition Mechanism for Broadcast Audio Material 16

Design and Implementation of High Efficiency Acquisition Mec...

引用

16th IEEE/ACIS International Conference on Computer and Information Science (ICIS)

作者： Ding, Jian Wang, Yongbin Wang, Shujuan Wang, Qi Commun Univ China Informat Engn Sch Beijing 100024 Peoples R China Minist Culture Key Lab Acoust Visual Technol & Intelligent Contr Beijing 100024 Peoples R China Beijing Key Lab Modern Entertainment Technol Beijing 100024 Peoples R China

ISBN: (纸本)9781509055074

In the process of making radio programs, Radio stations need to get a lot of audio material, which are usually stored on the FTP server. The traditional radio program production station will download each audio, and do not consider the server's and the local environment, using a single-threaded download, which results in poor user experience. This paper designs an efficient download mechanism, which establishes a local cache which uses the least frequently used algorithm (LFU) as the basic cache replacement algorithm. To avoid the cache pollution and improve the hit rate of cache, this paper improves LFU by adding a kind of aging mechanism and considering the time effects. While the cache misses the audio, the client will take multi-threaded download to get more server resources. Finally, the efficiency of this method is verified by experimental comparison.

关键词： broadcast audio material FTP cache replacement algorithm multi-thread

来源：评论

学校读者我要写书评

暂无评论

TOW:A Novel Time and Popularity Sensitive cache algorithm for P2P Live Media Streaming

TOW:A Novel Time and Popularity Sensitive Cache Algorithm fo...

引用

3rd International Conference on Communications and Networking in China

作者： Hu, Maozhi Xu, Ke Xia, Shu-tao Ye, Mingjiang Tsinghua Univ Grad Sch Shenzhen Shenzhen 518057 Guangdong Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9781424423736

P2P applications are widely used and make tremendous traffic in today's network. With the increasing number of IPTV users, it is reasonable to foresee that P2P live media streaming media will account for a considerable proportion in future backbone traffic. Few works focus on the P2P live media streaming cache in the view of ISP and directly compare its performance with the P2P file delivery. The paper studies the various cache replacement algorithms and caching differences between P2P live media streaming and P2P file delivery, then proposes a novel "time sensitive" cache algorithm for P2P live media streaming called Time over Weight (TOW) and confirms its better performance than popular algorithm such as FIFO, LRU, LSB and LFU.

关键词： cache replacement algorithm P2P live streaming hit rate

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Cooperative Caching with Improved Performance in Wireless Mesh Networks

Efficient Cooperative Caching with Improved Performance in W...

引用

2010 IEEE International Conference on Communications

作者： Denko, Mieso K. Nkwe, Thabo Obaidat, Mohammad S. Univ Guelph Dept Comp & Informat Sci Guelph ON N1G 2W1 Canada Monmouth Univ Dept Comp Sci & Software Engn Long Branch NJ 07764 USA

ISBN: (纸本)9781424464043

The cache replacement mechanism in cooperative caching has a significant bearing in determining the caches performance. Valid data items still get evicted from the cache space when new item is to be cached but there is no space available to hold it. The existence of data items in caches indicates some degree of interest on the data item. Salvaging the evicted valid data item could improve the overall caching performance. In this paper, we propose an efficient cooperative caching scheme known as cacheRescue for wireless mesh networks. The cacheRescue scheme caches data in the mesh routers expandable storage space to hold valid but evicted data items. We have used simulation to evaluate the performance of cacheRescue scheme. The simulation results show that our proposed approach improves the caching performance when compared to other existing and previously proposed caching solutions.

关键词： Cooperative caching cache replacement algorithm WMNs performance evaluation modeling

来源：评论

学校读者我要写书评

暂无评论

In-memory Caching Orchestration for Hadoop 16

In-memory Caching Orchestration for Hadoop

引用

16th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid)

作者： Kwak, Jaewon Hwang, Eunji Yoo, Tae-Kyung Nam, Beomseok Choi, Young-ri Ulsan Natl Inst Sci & Technol Sch Elect & Comp Engn Ulsan South Korea

ISBN: (纸本)9781509024537

In this paper, we investigate techniques to effectively orchestrate HDFS in-memory caching for Hadoop. We first evaluate a degree of benefit which each of various MapReduce applications can get from in-memory caching, i.e. cache affinity. We then propose an adaptive cache local scheduling algorithm that adaptively adjusts the waiting time of a MapReduce job in a queue for a cache local node. We set the waiting time to be proportional to the percentage of cached input data for the job. We also develop a cache affinity cache replacement algorithm that determines which block is cached and evicted based on the cache affinity of applications. Using various workloads consisting of multiple MapReduce applications, we conduct experimental study to demonstrate the effects of the proposed in-memory orchestration techniques. Our experimental results show that our enhanced Hadoop in-memory caching scheme improves the performance of the MapReduce workloads up to 18% and 10% against Hadoop that disables and enables HDFS in-memory caching, respectively.

关键词： Hadoop In-memory caching cache locality cache Affinity Scheduling policy cache replacement algorithm Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Dynamically selecting distribution strategies for web documents according to access pattern

引用

International Conference on Embedded and Ubiquitous Computing

作者： Qu, WY Wu, D Li, KQ Shen, H Japan Adv Inst Sci & Technol Grad Sch Informat Sci Nomi Ishikawa 9231292 Japan Dalian Univ Technol Dept Comp Sci & Engn Dalian 116024 Peoples R China Dalian Maritime Univ Coll Comp Sci & Technol Dalian 116026 Peoples R China

ISBN: (纸本)3540308075

Web caching and replication are efficient techniques for reducing web traffic, user access latency, and server load. In this paper we present a group-based method for dynamically selecting distribution strategies for web documents according to access patterns. The documents axe divided into groups according to access patterns and the documents in each group are assigned to the same distribution strategy. Our group-based model combines performance metrics with the different weights assigned to each of them. We use both trace data and statistical data to simulate our methods. The experimental results show that our group-based method for document distribution strategy selection can improve several performance metrics, while keeping others almost the same.

关键词： Web caching and replication distribution strategy cache replacement algorithm simulation trace data autonomous system (AS)

来源：评论

学校读者我要写书评

暂无评论

CRP: Conditional replacement Policy for Reliability Enhancement of STT-MRAM caches

引用

IEEE TRANSACTIONS ON MAGNETICS 2022年第7期58卷

作者： Rahbari, Marjan Farbeh, Hamed Islamic Azad Univ South Tehran Branch Dept Comp Engn Tehran *** Iran Amirkabir Univ Technol Tehran Polytech Dept Comp Engn Tehran 158754413 Iran

Driven by the trends of emerging technologies in on-chip memories, with increasing the size of last-level caches (LLCs), spin-transfer torque magnetic random access memories (STT-MRAMs) are the most promising alternative technology among the non-volatile memories (NVMs) to replace SRAMs. Despite their high density, scalability, and near-zero leakage power, the reliability of STT-MRAM LLCs is threatened by a high error rate due to their stochastic switching behavior. The error rate is highly influenced by the cache management, which necessitates redesigning the cache replacement policy based on the error behavior. In this article, we propose an error-aware cache replacement policy, namely, conditional replacement policy (CRP), to improve the reliability of STT-MRAM caches by decreasing the rate of both read disturbance and write failure. This is ascertained by nominating an appropriate data block in the cache to be replaced with an incoming data block, considering the minimum error rate. Moreover, the performance and latency of both write and read operations are considered. The simulation results show that compared with the state-of-the-art replacement policy in STT-MRAM caches, CRP reduces the total error rate by 68%. In addition, the proposed policy enhances the performance by 2% and saves energy consumption by 19%, on average. Meanwhile, the total number of writes is decreased by 41% compared with the previous scheme.

关键词： Thermal stability Reliability Magnetic tunneling Error analysis Switches Thermal factors Random access memory cache replacement algorithm read disturbance spin-transfer torque magnetic random access memory (STT-MRAM) cache stochastic switching write failure

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND IMPLEMENTATION OF A P2P COOPERATIVE PROXY cache SYSTEM

引用

Journal of Interconnection Networks 2007年第2期8卷 147-162页

作者： JAMES Z. WANG VIPUL BHULAWALA Department of Computer Science Clemson University Box 340974 Clemson SC 29634-0974 USA +1-864-656-7678.

In this paper, we design and implement a P2P cooperative proxy caching system based on a novel P2P cooperative proxy caching scheme. To effectively locate the cached web documents, a TTL-based routing protocol is proposed to manage the query and response messages in the P2P cooperative proxy cache system. Furthermore, we design a predict query-route algorithm to improve the TTL-based routing protocol by adding extra information in the query message packets. To select a suitable cache replacement algorithm for the P2P cooperative proxy cache system, three different cache replacement algorithms, LRU, LFU and SIZE, are evaluated using web trace based performance studies on the implemented P2P cooperative proxy cache system. The experimental results show that LRU is an overall better cache replacement algorithm for the P2P proxy cache system although SIZE based cache replacement approach produces slightly better cache hit ratio when cache size is very small. The performance studies also demonstrate that the proposed message routing protocols significantly improve the performance of the P2P cooperative proxy cache system, in terms of cache hit ratio, byte hit ratio, user request latency, and the number of query messages generated in the proxy cache system, compared to the flooding based message routing protocol.

关键词： P2P cooperative proxy caching cache replacement algorithm message routing protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：