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

IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)

作者： Keshavarzian, Iman Zeinalpour-Yazdi, Zolfa Tadaion, Aliakbar Yazd Univ Dept Elect & Comp Engn Yazd Iran

ISBN: (纸本)9781509004805

We consider the content caching problem in a set of the clustered small cells (SCs) in the heterogeneous network. Heterogeneous small cell networks is a promising solution to overcome the explosive growth of the mobile data traffic. A bottleneck of this solution is the capacity of backhaul links between small cells and the network core. However, an alternative solution is using SCs with low rate backhaul links which are equipped with storage devices to cache the popular files. We group SCs into some clusters based on the geographical situation. Each cluster has a cumulative cache storage which is the summation of the cache storage of SCs encountered at that cluster. During one time slot, users in a cluster can download the desired files from the cumulative cache storage of the cluster. Since users may move and change their positions, we model the problem of cluster cache placement as a discrete Markov chain. As the optimum caching placement problem is NP-hard, we provide an appropriate lower bound that guarantees 1/k optimal solution where k is the random walk step of the user's movement. Further, we derive a polynomial time approximation solution with 1/2k2 performance for a situation which the information about the mobility pattern of mobile users in the wireless cell does not exist. Through some simulation examples, we compare the proposed algorithms with an existing solution using real wireless data.

关键词： caching algorithm Small cell heterogeneous network Optimization problem

来源：评论

学校读者我要写书评

暂无评论

Joint caching and Sleep-Active Scheduling for Energy-Harvesting Based Small Cells 9

Joint Caching and Sleep-Active Scheduling for Energy-Harvest...

引用

9th International Conference on Wireless Communication and Signal Processing (WCSP)

作者： Xu, Dan Jin, Hao Zhao, Chenglin Liang, Dong Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China

ISBN: (纸本)9781538620625

The massive demand of mobile data traffic stimulates the emergence of cache-enabled heterogeneous cellular networks (HetNets). caching at the network edge can reduce the duplicated transmissions of the contents and improve users' quality of service (QoS), however, the dense deployment of cache-enabled small base stations (SBSs) and relays poses a challenge on energy consumption. Several emerging technologies have been focused on energy savings, such as energy harvesting and dynamic sleep mode operation of base stations (BSs). How to utilize these technologies to optimize energy consumption in cache-enabled HetNet is a hot research topic. Therefore, in this paper, a two-tier caching framework incorporating energy harvesting and sleep mechanism is proposed and joint optimization of energy-efficient sleeping and caching in the energy-harvesting based HetNet is studied. The optimization problem is formulated, aiming at maximizing energy savings in the system, which combines content placement with sleep-active scheduling for self-powered SBSs. To solve the problem, a dynamic energy-harvesting based caching algorithm with sleep-active scheduling mechanism called DECAS is proposed. Simulation results show that by using renewable energy and sleep mechanism, the proposed caching algorithm achieves significant performance gains on energy consumption and maintains high hit ratio, compared with the caching algorithms without joint optimization of energy-harvesting and sleep mechanism.

关键词： HetNets caching algorithm Energy saving Energy harvesting Sleep mechanism

来源：评论

学校读者我要写书评

暂无评论

On resource pooling and separation for LRU caching 18

On resource pooling and separation for LRU caching

引用

2018 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2018

作者： Tan, Jian Quan, Guocong Ji, Kaiyi Shroff, Ness Ohio State University ColumbusOH United States

ISBN: (纸本)9781450358460

caching systems using the Least Recently Used (LRU) principle have now become ubiquitous. A fundamental question for these systems is whether the cache space should be pooled together or divided to serve multiple flows of data item requests in order to minimize the miss probabilities. In this paper, we show that there is no straight yes or no answer to this question, and depends on complex combinations of critical factors, including, e.g., request rates, overlapped data items across different request flows, data item popularities and their sizes. To this end, we characterize the performance of multiple flows of data item requests under resource pooling and separation when the cache size is large. Analytically we show that it is asymptotically optimal to jointly serve multiple flows if their data item sizes and popularity distributions are similar, and their arrival rates do not differ significantly;the self-organizing property of LRU caching automatically optimizes the resource allocation among them asymptotically. Otherwise, separating these flows could be better, e.g., when data sizes vary significantly. We also quantify critical points beyond which resource pooling is better than separation for each of the flows when the overlapped data items exceed certain levels. These results provide new insights on the performance of caching systems. © 2018 Copyright held by the owner/author(s).

关键词： miss probability memcached LRU caching algorithm

来源：评论

学校读者我要写书评

暂无评论

Client's cache updating using idle time of clients in relational database management systems

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2007年第1期23卷 329-341页

作者： Sahin, Yasar-Guneri Bulbul, Halil-Ibrahim Yasar Univ Dept Comp Engn Izmir Turkey Gazi Univ Dept Comp Engn Ankara Turkey

Although multi-tiered software development is taking the place in database application environments, client-server infrastructure has still been in use for years. Furthermore, both infrastructures still need to be improved in some aspects. One of the important aspects of improvement is caching. This paper addresses the issue of caching in relational database system within client-server structure and a method that can be used to keep clients' cache up to date. The main objective of the proposed caching methods is to use clients' idle time in order that clients' cache is up-to-dated and to use the clients' memories for caching. For this purpose, a new combined system which includes CCDT (Clients Cache Description Table) for organizing client cache updating, predicate-based caching method MNTC (Maximum Number of Tuples in Cache) that includes a managerial patch in server-side and small patches in clients-side, and TPCF (Time Period calculated from client Commit Frequency) for calculation of idle time of the clients, is presented.

关键词： caching algorithm cache description database caching cached updating client-server structure

来源：评论

学校读者我要写书评

暂无评论

Improving Cache Performance for Large-Scale Photo Stores via Heuristic Prefetching Scheme

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2019年第9期30卷 2033-2045页

作者： Zhou, Ke Sun, Si Wang, Hua Huang, Ping He, Xubin Lan, Rui Li, Wenyan Liu, Wenjie Yang, Tianming Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Key Lab Informat Storage Syst Intelligent Cloud Storage Joint Res Ctr Wuhan 430073 Hubei Peoples R China Tencent Wuhan 430073 Hubei Peoples R China Temple Univ Philadelphia PA 19122 USA Tencent Inc Shenzhen 518057 Peoples R China Huanghuai Univ Zhumadian 463000 Peoples R China

Photo service providers are facing critical challenges of dealing with the huge amount of photo storage, typically in a magnitude of billions of photos, while ensuring national-wide or world-wide satisfactory user experiences. Distributed photo caching architecture is widely deployed to meet high performance expectations, where efficient still mysterious caching policies play essential roles. In this work, we present a comprehensive study on internet-scale photo caching algorithms in the case of QQPhoto from Tencent Inc., the largest social network service company in China. We unveil that even advanced cache algorithms can only perform at a similar level as simple baseline algorithms and there still exists a large performance gap between these cache algorithms and the theoretically optimal algorithm due to the complicated access behaviors in such a large multi-tenant environment. We then expound the reasons behind this phenomenon via extensively investigating the characteristics of QQPhoto workloads. Finally, in order to realistically further improve QQPhoto cache efficiency, we propose to incorporate a prefetcher in the cache stack based on the observed immediacy feature that is unique to the QQPhoto workload. The prefetcher proactively prefetches selected photos into cache before they are requested for the first time to eliminate compulsory misses and promote hit ratios. Our extensive evaluation results show that with appropriate prefetching we improve the cache hit ratio by up to 7.4 percent, while reducing the average access latency by 6.9 percent at a marginal cost of 4.14 percent backend network traffic compared to the original system that performs no prefetching.

关键词： caching algorithm distributed storage photo storage cloud computing

来源：评论

学校读者我要写书评

暂无评论

Eigenvalues of LRU via a linear algebraic approach

引用

OPERATIONS RESEARCH LETTERS 2018年第2期46卷 193-198页

作者： Tang, Dengwang Subramanian, Vijay Univ Michigan Ann Arbor MI 48109 USA

In this short paper we analyze the Markov Chain associated with Least Recently Used (LRU) cache replacement scheme. The eigenvalues and their multiplicities of this chain are determined using basic linear algebra alon... 详细信息

关键词： caching algorithm Markov chains Linear algebra

来源：评论

学校读者我要写书评

暂无评论

Implementation and optimization of SpMV algorithm based on SW26010P many-core processor and stored in BCSR format

引用

SCIENTIFIC REPORTS 2024年第1期14卷 1-13页

作者： Ma, Mengfei Huang, Xianqing Xu, Jiali Jia, Dongning Qingdao Marine Sci & Technol Ctr Informat Res Dept Qingdao Peoples R China Laoshan Lab Qingdao Peoples R China Ocean Univ China Coll Informat Sci & Engn Qingdao Peoples R China

The irregular distribution of non-zero elements of large-scale sparse matrix leads to low data access efficiency caused by the unique architecture of the Sunway many-core processor, which brings great challenges to the efficient implementation of sparse matrix-vector multiplication (SpMV) computing by SW26010P many-core processor. To address this problem, a study of SpMV optimization strategies is carried out based on the SW26010P many-core processor. Firstly, we design a memorized data storage transformation strategy to transform the matrix in CSR storage format into BCSR (Block Compressed Sparse Row) storage. Secondly, the dynamic task scheduling method is introduced to the algorithm to realize the load balance between slave cores. Thirdly, the LDM memory is refined and designed, and the slave core dual cache strategy is optimized to further improve the performance. Finally, we selected a large number of representative sparse matrices from the Matrix Market for testing. The results show that the scheme has obviously speedup the processing procedure of sparse matrices with various sizes and sizes, and the master-slave speedup ratio can reach up to 38 times. The optimization method used in this paper has implications for other complex applications of the SW26010P many-core processor.

关键词： Sparse matrix-vector multiplication caching algorithm SW26010P Block compressed sparse row High performance computing

来源：评论

学校读者我要写书评

暂无评论

caching scheme for information-centric networks with balanced content distribution

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2022年第7期35卷 e5104-e5104页

作者： Dutta, Nitul Patel, Shobhit K. Faragallah, Osama S. Baz, Mohammed Rashed, Ahmed Nabih Zaki SRM Univ Comp Sci & Engn Dept Guntur Andhra Pradesh India Marwadi Univ Elect & Commun Engn Dept Rajkot Gujarat India Taif Univ Dept Informat Technol Coll Comp & Informat Technol POB 11099 At Taif 21944 Saudi Arabia Taif Univ Dept Comp Engn Coll Comp & Informat Technol POB 11099 At Taif 21944 Saudi Arabia Menoufia Univ Elect & Elect Commun Engn Dept Fac Elect Engn Menoufia 32951 Egypt

Information-centric network (ICN) emphasizes on content retrieval without much bothering about the location of its actual producer. This novel networking paradigm makes content retrieval faster and less expensive by shifting data provisioning into content holder rather than content owner. caching is the feature of ICN that makes content serving possible from any intermediate device. An efficient caching is one of the primary requirements for effective deployment of ICN. In this paper, a caching approach with balanced content distribution among network devices is proposed. The selection of contents to be cached is determined through universal and computed using Zipf's law. The dynamic change in popularity of contents is also considered to take make caching decisions. For balancing the cached content across the network, every router keeps track of its neighbor's cache status. Three parameters, the proportionate distance of the router from the client (p(d)), the router congestion (r(c)), and the cache status (c(s)), are contemplated to select a router for caching contents. The new caching approach is evaluated in the simulated environment using ndnSIM-2.0. Three state-of-the-art approaches, Leave Copy Everywhere (LCE), centrality measures-based algorithm (CMBA), and a probability-based caching (probCache), are considered for comparison. The proposed method of caching shows the better performance compared to the other three protocols used in the comparison.

关键词： caching algorithm information-centric networks (ICNs) mathematical analysis popularity probabilistic caching

来源：评论

学校读者我要写书评

暂无评论

Effective caching for NetNews servers

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2001年第3期E84D卷 348-354页

作者： Funasaka, J Saisho, K Fukuda, A Nara Inst Sci & Technol Grad Sch Informat Sci Ikoma 6300101 Japan

Since the traffic of NetNews is increasing, keeping all articles becomes serious problem from a viewpoint of waste of network bandwidth and the amount of disk usage. In addition, users read not all incoming articles. We have proposed several caching algorithms to overcome this problem and shown that a selective prefetch scheme gives the best system performance among the proposed ones. However, since the selective prefetch scheme employed a simple selecting policy, the scheme gave low hit ratio in some cases. Therefore, this paper intends to improve the selective prefetch scheme from a viewpoint of the amount of disk usage as well as hit ratio. In this paper, we divide the scheme into three factors: reference span, criterion, and threshold in criterion. Through simulation experiments using actual NetNews logs, we investigate the influence of the factors of the reference span and the threshold to system performance. As a result, it is shown that the reference span is more significant factor than the threshold, the selective prefetch scheme with a value around the seven days reference span keeps high hit ratio and reduces the amount of disk usage.

关键词： NetNews cache system caching algorithm simulation automatic selection

来源：评论

学校读者我要写书评

暂无评论

On Resource Pooling and Separation for LRU caching

引用

Performance Evaluation Review 2018年第1期46卷 27-27页

作者： Tan, Jian Quan, Guocong Ji, Kaiyi Shroff, Ness Ohio State University ColumbusOH United States

关键词： caching algorithm LRU memcached miss probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：