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

20th IEEE International Conference on High Performance Computing and Communications (HPCC) / 16th IEEE International Conference on Smart City (SmartCity) / 4th IEEE International Conference on Data Science and Systems (DSS)

作者： Niu, Junpeng Xu, Jun Mackey, Grant Xie, Lihua Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore Western Digital Corp WDLabs Singapore Singapore Western Digital Corp WDLabs Irvine CA USA

ISBN: (纸本)9781538666142

Hybrid storage system is popular nowadays in modern data center storage. In a typical hybrid system, SSDs act as the performance tier, while HDDs provide cost effective storage tier. However, the various usages of SSDs, such as global cache or tier, or distributed as cache or tier in each storage node, etc. are not fully considered. The impacts of the network components in the storage systems on the overall performance are also not studied in detail. In this paper, we study the characteristics of SSDs utilized as either a cache or as a storage tier for hot data, as well as the impact of network communication between hot and cold pools of storage. Meanwhile, a novel networked storage system simulator is developed to evaluate the performance of various types of hybrid storage architectures. The simulation results can be utilized to analyze the benefits and drawbacks of various types of architecture designs, and the performance impacts of the network architecture.

关键词： Networked storage system cache algorithm distributed system

来源：评论

学校读者我要写书评

暂无评论

Traffic Load Reduction of Multi-owner, Multi-keywords and Multi-user Searches Using Parallel Searching and cache Trapdoors 11

Traffic Load Reduction of Multi-owner, Multi-keywords and Mu...

引用

11th International Conference on Developments in eSystems Engineering (DeSE)

作者： Al-Maytami, Belal Ali Hussain, Abir Southwest Jiaotong Univ Inst Mobile Commun Chengdu Sichuan Peoples R China IBB Univ Ibb Yemen Liverpool John Moores Univ Dept Comp Sci Liverpool Merseyside England

ISBN: (纸本)9781538667125

With the development of cloud computing, sensitive information of outsourced data is at the risk of unauthorized accesses and the cost of implementation Several approaches have been provided to enable searching the encrypted data to protect data privacy but can't handle the problems of traffic load and searching time cost. To combat this issue, this paper presents a cache algorithm for query in the user part to reduce communication cost between the user and cloud provider. Also we propose a parallel searching algorithm to reduce the computation, time of searching and traffic overload in cloud server.

关键词： Parallel search Cloud computing Data mining privacy cache algorithm Queries processing Cloud security

来源：评论

学校读者我要写书评

暂无评论

Access time-aware cache algorithm for SATA hard disks

引用

IEICE ELECTRONICS EXPRESS 2012年第21期9卷 1707-1713页

作者： Arfan, Abdul Kim, Young-Jin Kwon, Jin Baek Ajou Univ Suwon 443749 South Korea SunMoon Univ Asan 336708 South Korea

SATA has been widely used as the dominant hard disk storage technology. We tried to optimize the performance of SATA disks by devising a new cache algorithm that is aware of disk access time. To validate and test it, we implemented a simple but practical hard disk simulator. Real trace-driven simulations show that the proposed cache algorithm achieves up to 35 percent of improvement compared to LRU.

关键词： cache algorithm SATA hard disk native command queuing access time simulator performance

来源：评论

学校读者我要写书评

暂无评论

Improving Flash-Based Disk cache with Lazy Adaptive Replacement

引用

ACM TRANSACTIONS ON STORAGE 2016年第2期12卷 8-8页

作者： Huang, Sai Wei, Qingsong Feng, Dan Chen, Jianxi Chen, Cheng Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Comp Wuhan 430074 Peoples R China ASTAR Data Storage Inst Wuhan Peoples R China Huazhong Univ Sci & Technol 1037 Luoyu Rd Wuhan 430074 Peoples R China Data Storage Inst 2 Fusionopolis Way08-01 Innovis Singapore 138634 Singapore

For years, the increasing popularity of flash memory has been changing storage systems. Flash-based solid-state drives (SSDs) are widely used as a new cache tier on top of hard disk drives (HDDs) to speed up data-intensive applications. However, the endurance problem of flash memory remains a concern and is getting worse with the adoption of MLC and TLC flash. In this article, we propose a novel cache management algorithm for flash-based disk cache named Lazy Adaptive Replacement cache (LARC). LARC adopts the idea of selective caching to filter out seldom accessed blocks and prevent them from entering cache. This avoids cache pollution and preserves popular blocks in cache for a longer period of time, leading to a higher hit rate. Meanwhile, by avoiding unnecessary cache replacements, LARC reduces the volume of data written to the SSD and yields an SSD-friendly access pattern. In this way, LARC improves the performance and endurance of the SSD at the same time. LARC is self-tuning and incurs little overhead. It has been extensively evaluated by both trace-driven simulations and synthetic benchmarks on a prototype implementation. Our experiments show that LARC outperforms state-of-art algorithms for different kinds of workloads and extends SSD lifetime by up to 15.7 times.

关键词： algorithms Design Performance cache algorithm endurance flash memory solid-state drive

来源：评论

学校读者我要写书评

暂无评论

"Stubborn" Strategy to Mitigate Remaining cache Misses 34

"Stubborn" Strategy to Mitigate Remaining Cache Misses

引用

34th IEEE International Conference on Computer Design (ICCD)

作者： Nomura, Hayato Katchi, Hiroyuki Irie, Hidetsugu Sakai, Shuichi Univ Tokyo Grad Sch Informat Sci & Technol Tokyo Japan

ISBN: (纸本)9781509051427

The capacity of cache memory has reached the megabytes magnitude and various smart cache algorithms have been introduced. However, cache systems still suffer from plenty of cache misses, especially for memory-intensive applications. In this paper, we reveal that a vast majority of the remaining cache misses on LLC are caused by long interval, unpredictable re-reference accesses. Based on the analysis, we propose a "Stubborn" strategy to mitigate misses caused by long re-reference interval accesses. Our strategy simply enhances existing smart algorithms by mixing the cache lines that do not evict their holding content for longer than a 10 to 100 mega-instruction interval. We evaluate the strategy that is mixed with 2MB LLC based on LRU or DRRIP. The results show that our Stubborn strategy achieves a reduction in long interval re-reference misses, as expected. It outperforms LRU and DRRIP on the IPC metric showing increases of 24% and 6%, respectively.

关键词： cache algorithm Replacement Policy Re-reference Interval cache Access Patterns

来源：评论

学校读者我要写书评

暂无评论

TECHNOLOGIES FOR LARGE DATA MANAGEMENT IN SCIENTIFIC COMPUTING

引用

INTERNATIONAL JOURNAL OF MODERN PHYSICS C 2014年第2期25卷

作者： Pace, Alberto CERN IT Dept Data & Storage Serv Grp CH-1211 Geneva Switzerland

In recent years, intense usage of computing has been the main strategy of investigations in several scientific research projects. The progress in computing technology has opened unprecedented opportunities for systematic collection of experimental data and the associated analysis that were considered impossible only few years ago. This paper focuses on the strategies in use: it reviews the various components that are necessary for an effective solution that ensures the storage, the long term preservation, and the worldwide distribution of large quantities of data that are necessary in a large scientific research project. The paper also mentions several examples of data management solutions used in High Energy Physics for the CERN Large Hadron Collider (LHC) experiments in Geneva, Switzerland which generate more than 30,000 terabytes of data every year that need to be preserved, analyzed, and made available to a community of several tenth of thousands scientists worldwide.

关键词： Data management storage data scientific computing big-data cloud cloud storage cloud computing data analysis data technologies hierarchical storage CERN LHC Large Hadron Collider ATLAS CMS ALICE LHCB data reliability data availability metadata management data preservation quality of service storage pools data replication data syncing data integrity erasure codes error correction data encryption data security name server identity federations data confidentiality access control quota data mining cache algorithm DHT Distributed hash tables storage federations

来源：评论

学校读者我要写书评

暂无评论

Improving Flash-based Disk cache with Lazy Adaptive Replacement

Improving Flash-based Disk Cache with Lazy Adaptive Replacem...

引用

29th IEEE Symposium on Massive Storage Systems and Technologies (MSST) - Research Track

作者： Huang, Sai Wei, Qingsong Chen, Jianxi Chen, Cheng Feng, Dan ASTAR Data Storage Inst Singapore Singapore Huazhong Univ Sci & Technol Sch Comp Wuhan Natl Lab Optoelect Wuhan 430074 Peoples R China

ISBN: (纸本)9781479902170;9781479902187

The increasing popularity of flash memory has changed storage systems. Flash-based solid state drive(SSD) is now widely deployed as cache for magnetic hard disk drives(HDD) to speed up data intensive applications. However, existing cache algorithms focus exclusively on performance improvements and ignore the write endurance of SSD. In this paper, we proposed a novel cache management algorithm for flash-based disk cache, named Lazy Adaptive Replacement cache(LARC). LARC can filter out seldom accessed blocks and prevent them from entering cache. This avoids cache pollution and keeps popular blocks in cache for a longer period of time, leading to higher hit rate. Meanwhile, LARC reduces the amount of cache replacements thus incurs less write traffics to SSD, especially for read dominant workloads. In this way, LARC improves performance and extends SSD lifetime at the same time. LARC is self-tuning and low overhead. It has been extensively evaluated by both trace-driven simulations and a prototype implementation in flashcache. Our experiments show that LARC outperforms state-of-art algorithms and reduces write traffics to SSD by up to 94.5% for read dominant workloads, 11.2-40.8% for write dominant workloads.

关键词： Flash Solid State Drive cache algorithm Endurance

来源：评论

学校读者我要写书评

暂无评论

Caching in Information-Centric Networking: from a content delivery path perspective

Caching in Information-Centric Networking: from a content de...

引用

9th Annual International Conference on Innovations in Information Technology (IIT)

作者： Chen, Xiaohu Fan, Qilin Yin, Hao Tsinghua Univ Dept Comp Sci & Technol Tsinghua Natl Lab Informat Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)9781467362030

One of the defining characters of Information-Centric Networking(ICN) is in-network caching which enables content retrieval shift its emphasis from the exact content providers to the content that customers mostly care about. Undoubtedly, how to cache effectively is of primary concern in ICN. However, caching strategies such as Least Recently Used(LRU) are not tailored for the characteristics of content retrieval in ICN, thus compromising the capability of in-network storage. In this paper, we propose a new caching strategy called LUV-Path, in which all the routers along the delivery path will implicitly cooperate in deciding whether to cache the content and each content cached will be assigned a value that combines Least Unified Value(LUV) with router's distance from provider to reflect its relative importance. We evaluate LUV-Path with cache algorithms including LRU, FIFO under various network topology such as highly structured string and tree topologies and irregularly structured Abilene network. Our results suggest that LUV-Path significantly outperforms other caching strategies in reducing customer delay and network traffic as well as alleviating provider pressure across various network topologies with different structural property consistently.

关键词： Information-Centric Networking cache algorithm LRU

来源：评论

学校读者我要写书评

暂无评论

An Auto-adjustment cache algorithm in Handheld Learning devices

An Auto-adjustment Cache Algorithm in Handheld Learning devi...

引用

IEEE International Conference on Intelligent Computing and Intelligent Systems

作者： Peng Liang Xu Yan-li Harbin Normal Univ Off Acad Affairs Harbin Peoples R China Harbin Normal Univ Sch Management Harbin Peoples R China

ISBN: (纸本)9781424447541

There are many challenges of using all kinds of handheld devices as learning tools, that can connect to the Remote Learning System by cable or wireless network and then browser the downloaded course contents First of all, network connection, especially wireless link, is usually not persistent and wireless coverage is often limited In this case, the handheld learning devices become useless and the learning activities are interfered Secondly, the learning resource size become more and more large, so that the time to wait for these resources downloaded from the remote learning system would be more and more long Thirdly, computing power and storages ability of the device is too weak to save or perform plentiful downloaded learning resource In order to solute the mentioned problems, an auto-adjustment cache algorithm is purposed in a Remote Learning System

关键词： handheld devices auto-adjustment cache algorithm remote learning system

来源：评论

学校读者我要写书评

暂无评论

A weighted segment-based caching algorithm for video streaming objects over heterogeneous networking environments

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第4期38卷 3467-3476页

作者： Hsu, Tz-Heng Li, Yueh-Heng So Taiwan Univ Dept Comp Sci & Informat Engn Tainan Taiwan

Traditional caching technology is not applicable to cache video streaming objects over heterogeneous networking environments. The popularity of mobile devices in the heterogeneous networking environments make the access of Internet content become a common phenomenon. To support different mobile devices in the heterogeneity networking environments, a transcoding proxy is used to transcode different versions of the streaming videos according to clients' requests. In this paper, we propose a weighted caching replace strategy for video streaming objects over heterogeneous networking environments. A new caching algorithm with static weight transcoding graph and dynamic caching relation tree is introduced. The proposed algorithm is compared with LRU, LFU, CP and PF cache algorithms in three parts: hit ratio, byte hit ratio, and average transmission delay. Experimental results show that the proposed algorithm outperforms than traditional LRU, LFU, CP and PF cache algorithms. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： cache algorithm Transcoding proxy cache relation tree

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：