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

25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

作者： Sun, Diansen Chai, Yunpeng MOE Key Lab Data Engn & Knowledge Engn Beijing Peoples R China Renmin Univ China Sch Informat Beijing Peoples R China

ISBN: (纸本)9781450371025

To satisfy the huge storage capacity requirements of big data, the emerging high-density disks gradually adopt the Shingled Magnetic Recording (SMR) technique. However, the most serious challenge of SMR disks lies in their weak fine-grained random write performance caused by the write amplification inner SMRs and its extremely unbalanced read and write latencies. Although fast storage devices like Flash-based SSDs can be used to boost SMR disks in SMR-based hybrid storage, the optimization targets of existing cache algorithms (e.g., higher popularity for LRU, lower SMR write amplification ratio for MOST) are NOT the crucial factor for the performance of the SMR-based hybrid storage. In this paper, we propose a new SMR-Aware Co-design cache algorithm called SAC to accelerate the SMR-based hybrid storage. SAC adopts a hardware/software co-design method to fit the characteristics of SMR disks and to optimize the crucial factor, i.e., RMW operations inner SMR disks, effectively. Furthermore, SAC also makes a good balance between some conflicting factors, e.g., the data popularity vs. the SMR write amplification and clean cache space vs. dirty cache space. In our evaluations under real-world traces, SAC achieves a 7.5. performance speedup compared with LRU in the write-only mode, and a 2.9. speedup in the read-write mixed mode.

关键词： cache algorithm SMR hybrid storage write amplification

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Networking, Architecture and Storage (NAS 2015)

作者： Ye, Feng Chen, Jianxi Fang, Xuejiao Li, Jieqiong Feng, Dan Huazhong Univ Sci & Technol Sch Comp Wuhan Natl Lab Optoelect Wuhan Peoples R China

ISBN: (纸本)9781467378918

Flash-based Solid State Drive (SSD) has limitations in terms of cost and lifetime. It is used as a second-level cache between main memory and traditional HDD-based storage widely. Adopting traditional cache algorithms, which are designed primarily depending on temporal locality and popular blocks, to SSD-based second-level disk cache can cause unnecessary cache replacements, which not only degrade the cache performance but also shorten the lifetime of SSD. To overcome this problem, this paper proposes a performance-effective Regional Popularity-Aware cache replacement algorithm (RPAC). Instead of a single block, the popularity of a region which is constituted by many adjacent disk blocks is recorded and used to determine replacing a block or not. In this way, the spatial locality of disk access is completely leveraged and sequential I/O blocks are gathered in SSD cache. Furthermore, it reduces the number of unnecessary cache replacement and erasure operation on SSD, prolonging its lifetime. We have implemented RPAC in real system and evaluated it by many workloads. Compared to traditional cache algorithms, it improve I/O throughput by up to 53% and reduce cache replacements of SSD up to 98.5%.

关键词： SSD Regional Popularity cache algorithm Lifetime

来源：评论

学校读者我要写书评

暂无评论

Dynamic File cache Optimization for Hybrid SSDs with High-Density and Low-Cost Flash Memory 39

Dynamic File Cache Optimization for Hybrid SSDs with High-De...

引用

39th IEEE International Conference on Computer Design ICCD)

作者： Gu, Ben Luo, Longfei Lv, Yina Li, Changlong Shi, Liang Minist Educ Software Hardware Codesign Engn Res Ctr Shanghai Peoples R China East China Normal Univ Sch Comp Sci & Technol Shanghai Peoples R China

ISBN: (纸本)9781665432191

Over the last few years, hybrid solid-state drives (SSDs) have been widely adopted due to their high performance and high capacity. Devices equipped with hybrid SSDs call be utilized to cache files from the network for performance improvement. However, this paper finds an interesting observation, that is, the efficiency of hybrid SSDs is significantly degraded instead of improved when too much data is cached. This is because the internal mode switching between different types of Hash memory is affected by the device utilization. This paper proposes a dynamic file cache optimization scheme for hybrid SSDs, DFcache, which optimizes the device's efficiency and limits unreasonable space consumption. DFcache includes two key ideas, dynamic cache space management, and intelligent cache file sifting. DFcache is implemented in Linux kernel and tested under real hybrid SSDs. Experimental results show that the I/O performance outperforms the state-of the-art by up to 3.7x.

关键词： flash storage hybrid SSD cache algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient SSD cache for Cloud Block Storage via Leveraging Block Reuse Distances

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2020年第11期31卷 2496-2509页

作者： Zhou, Ke Zhang, Yu Huang, Ping Wang, Hua Ji, Yongguang Cheng, Bin Liu, Yang Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Wuhan 430074 Hubei Peoples R China Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Hubei Peoples R China Tencent Corp Shenzhen 518054 Guangdong Peoples R China

Solid State Drives (SSDs) are popularly used for caching in large scale cloud storage systems nowadays. Traditionally, most cache algorithms make replacement upon each miss when cache space is full. However, we observe that in a typical Cloud Block Storage (CBS) system, there is a great percentage of blocks with large reuse distances, which would result in large number of blocks being evicted out of the cache before they ever have a chance to be referenced while they are cached, significantly jeopardizing the cache efficiency. In this article, we propose LEA, Lazy Eviction cache algorithm, for cloud block storage to efficiently remedy the cache inefficiencies caused by cache blocks with large reuse distances. LEA mainly employs two lists, Lazy Eviction List (LEL) and Block Identity List (BIL), which keep track of two types of victim blocks respectively based on their cache duration when replacements occur, to improve cache efficiency. When a cache miss happens, if the victim block has not resided in cache for longer than its reuse distance, LEA inserts the missed block identity into BIL. Otherwise, it inserts the missed block entry into LEL. We have evaluated LEA by using IO traces collected from Tencent, one of the largest network service providers in the world, and several open source traces. Experimental results show that LEA not only outperforms most of the state-of-the-art cache algorithms in hit ratio, but also greatly reduces the number of SSD writes.

关键词： Cloud computing Servers Routing Distributed databases Indexes Virtual machine monitors Reliability Cloud block storage cache algorithm SSD reuse distance

来源：评论

学校读者我要写书评

暂无评论

Wireless edge caching based on content similarity in dynamic environments

引用

JOURNAL OF SYSTEMS ARCHITECTURE 2021年 115卷 102000-102000页

作者： Wei, Xianglin Liu, Jianwei Wang, Yangang Tang, Chaogang Hu, Yongyang Natl Univ Def Technol Res Inst 63 Nanjing 210007 Peoples R China China Univ Min & Technol Sch Comp Sci & Tech Xuzhou 221116 Jiangsu Peoples R China

Edge caching could greatly relieve the burden of the backbone network and reduce the content request latency experienced by end-user devices. This makes edge caching a promising technology for enabling data-intensive and latency-sensitive applications on the eve of the large-scale commercial operation of 5G. However, the slow-start phenomenon incurred by existing request history-based caching strategies limits the performance of wireless edge caching, especially in the dynamic scenario where both mobile devices and contents arrive and leave periodically. On the other hand, it is also a hard task for deep reinforcement learning-based methods to adapt to the dynamics of the environment. In this backdrop, a new caching algorithm, called Similarity-Aware Popularity-based Caching (SAPoC), is presented in this paper to promote the performance of wireless edge caching in dynamic scenarios through utilizing the similarity among contents. In SAPoC algorithm, a content?s popularity is determined by not only its requests history but also its similarity with existing popular ones to enable a quick-start of newly arrived contents. A series of simulation experiments are conducted to evaluate SAPoC algorithm?s performance. Results have shown that SAPoC outperforms several typical proposals in both cache hit ratio and energy consumption.

关键词： Mobile edge computing Dynamic caching cache algorithm Wireless network

来源：评论

学校读者我要写书评

暂无评论

引用

17th ACM International Conference on Computing Frontiers (CF)

作者： Wei, Xianglin Liu, Jianwei Wang, Junwei Wang, Yangang Fan, Jianhua Natl Univ Def Technol Res Inst 63 Nanjing 210007 Peoples R China

ISBN: (纸本)9781450379564

Mobile edge computing (MEC) can greatly reduce the latency experienced by mobile devices and their energy consumption through bringing data processing, computing, and caching services closer to the source of data generation. However, existing edge caching mechanisms usually focus on predicting the popularity of contents or data chunks based on their request history. This will lead to a slow start problem for the newly arrived contents and fail to fulfill MEC's context-aware requirements. Moreover, the dynamic nature of contents as well as mobile devices has not been fully studied. Both of them hinder the further promotion and application of MEC caching. In this backdrop, this paper aims to tackle the caching problem in wireless edge caching scenarios, and a new dynamic caching architecture is proposed. The mobility of users and the dynamics nature of contents are considered comprehensively in our caching architecture rather than adopting a static assumption as that in many current efforts. Based on this framework, a Similarity-Aware Popularity-based Caching (SAPoC) algorithm is proposed which considers a content's freshness, short-term popularity, and the similarity between contents when making caching decisions. Extensive simulation experiments have been conducted to evaluate SAPoC's performance, and the results have shown that SAPoC outperforms several typical proposals in both cache hit ratio and energy consumption.

关键词： Mobile Edge Computing Dynamic Caching cache algorithm Wireless Network

来源：评论

学校读者我要写书评

暂无评论

Reliability-Oriented Networking Planning for Meshed VSC-HVDC Grids

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2019年第2期34卷 1342-1351页

作者： Xie, Haipeng Bie, Zhaohong Li, Gengfeng Xi An Jiao Tong Univ State Key Lab Elect Insulat & Power Equipment Xian 710049 Shaanxi Peoples R China Xi An Jiao Tong Univ Shaanxi Key Lab Smart Grid Xian 710049 Shaanxi Peoples R China

This paper proposes a reliability-oriented planning method to design reliable topologies for meshed high-voltage direct-current (HVdc) grids. Based on the proposed steady-state model for HVdc grids, a bi-level and multiobjective planning problem is formulated. The optimization model not only regards reliability as an independent objective, but also takes the power flow controllers (PFCs) into account. Compared with conventional methods, it overcomes the curse of dimensionality and solves the optimal allocation of PFCs. Then, the nondominated sorting genetic algorithm II is employed to solve the upper-level problem. For lower-level problems, an algorithm based on minimum spanning trees is proposed to optimally allocate PFCs, and an improved least frequently used cache algorithm and an optimum-test algorithm are developed to promote the computing efficiency of reliability evaluation. The European Supergrid and a Chinese ultra-HVdc system are adopted as test systems to validate the proposed method. Case studies prove that the proposed method provides an effective tool for the planning of HVdc grids. Also, results show that the cache technique and the optimum-test algorithm can reduce more than 70% of the total elapsed time.

关键词： HVDCgrid networking planning reliability evaluation power flow controller cache algorithm multi-objective optimization expansion planning

来源：评论

学校读者我要写书评

暂无评论

Adaptive probabilistic caching technique for caching networks with dynamic content popularity

引用

COMPUTER COMMUNICATIONS 2019年第May期139卷 1-15页

作者： Tarnoi, Saran Kumwilaisak, Wuttipong Suppakitpaisarn, Vorapong Fukuda, Kensuke Ji, Yusheng Natl Inst Informat Tokyo Japan King Mongkuts Univ Technol Thonburi Dept Elect & Telecommun Engn Bangkok Thailand Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

This paper presents a new adaptive probabilistic cache algorithm (AProb) for modern caching networks. AProb is based on three main techniques: (1) dynamic probabilistic caching;(2) ghost list;and (3) adaptive probing and protection. It enables caching systems to quickly adjust their cached data to dynamic content popularity without intervention of network administrators and synchronization. The criteria of this adjustment are based on hit events occurring in AProb data structures. By using AProb, a caching system continuously adapts a caching probability and the ratio between probing and protection partitions of its cache. AProb has constant time complexity and its space overhead is minimal. Extensive computer simulations, which consider various network topologies and traffic traces, show that AProb offers improvement in terms of server-hit ratio, footprint distance, and caching time compared with those provided by several existing cache algorithms.

关键词： cache algorithm Dynamic content popularity Caching network Information-centric networking Probabilistic caching

来源：评论

学校读者我要写书评

暂无评论

LEA: A Lazy Eviction algorithm for SSD cache in Cloud Block Storage 36

LEA: A Lazy Eviction Algorithm for SSD Cache in Cloud Block ...

引用

36th IEEE International Conference on Computer Design (ICCD)

作者： Zhou, Ke Zhang, Yu Huang, Ping Wang, Hua Ji, Yongguang Cheng, Bin Liu, Ying Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Key Lab Informat Storage Syst Intelligent Cloud Storage Joint Res Ctr HUST & Te Wuhan Hubei Peoples R China Temple Univ Philadelphia PA 19122 USA Tencent Technol Shenzhen Co Ltd Shenzhen Peoples R China

ISBN: (纸本)9781538684771

Solid State Drives (SSDs) are popularly used for caching in large scale cloud storage systems nowadays. Traditionally, most cache algorithms make replacement at each miss when cache space is full. However, we observe that in a typical Cloud Block Storage (CBS), there is a great percentage of blocks with large reuse distances, which would result in large number of blocks being evicted out of the cache before they ever have a chance to be referenced while they are cached, significantly jeopardizing the cache efficiency. In this paper, we propose LEA, Lazy Eviction cache algorithm, for cloud block storage to efficiently remedy the cache inefficiencies caused by cache blocks with large reuse distances. Specifically, LEA uses two lists, Lazy Eviction List (LEL) and Block Identity List (BIL). When a cache miss happens, if the candidate evicted-block has not resided in cache for longer than its reuse distance, LEA inserts the missed block identity into BIL. Otherwise, it inserts the missed block entry into LEL. We have evaluated LEA by using IO traces collected from Tencent, one of the largest network service providers in the world, and several open source traces. Experimental results show that LEA not only outperforms most of the state-of-the-art cache algorithms in hit ratio, but also reduces the number of SSD writes greatly.

关键词： Cloud Block Storage cache algorithm SSD Reuse Distance

来源：评论

学校读者我要写书评

暂无评论

Exploring the Potential of Coupled Array of SSD and HDD for Multi-Tenant 3

Exploring the Potential of Coupled Array of SSD and HDD for ...

引用

3rd IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA)

作者： Wu, Wei Xia, Wei Yu, Zibin Liu, Qingbin China Ship Dev & Design Ctr Wuhan Hubei Peoples R China Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Wuhan Hubei Peoples R China

ISBN: (纸本)9781538643013

With the gaining popularity of the virtual storage system, multiple users are served by the same storage resource. Thus, addressing the mixed requests with high performance is challenging. In this paper, we propose SAP, which explores potential Sequential Access Patterns in multi-tenant scenarios to boost performance of coupled array of SSD and HDD. Finally, based on a platform of server-class hardware, we have implemented a prototype, and evaluation results under real-world workloads show that our method can improve the storage system performance by up to 45%.

关键词： multi-tenant cache algorithm array SSD HDD

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：