2011 IEEE Sixth International Conference on Networking, Architecture, and Storage最新文献_第4页

Traffic-Aware Spectrum Assignment in Wireless Networks 无线网络中业务感知频谱分配

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.19

Zhang Long, Pan Dashan, Li Yang, Fang Tao, Liang Chao, Li Li

引用次数: 0

QMDS: A File System Metadata Management Service Supporting a Graph Data Model-Based Query Language QMDS:支持基于图数据模型的查询语言的文件系统元数据管理服务

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1080/17445760.2012.658802

S. Ames, M. Gokhale, C. Maltzahn

{"title":"QMDS: A File System Metadata Management Service Supporting a Graph Data Model-Based Query Language","authors":"S. Ames, M. Gokhale, C. Maltzahn","doi":"10.1080/17445760.2012.658802","DOIUrl":"https://doi.org/10.1080/17445760.2012.658802","url":null,"abstract":"File system metadata management has become a bottleneck for many data-intensive applications that rely on high-performance file systems. Part of the bottleneck is due to the limitations of an almost 50 year old interface standard with metadata abstractions that were designed at a time when high-end file systems managed less than 100 MB. Today's high-performance file systems store 7 to 9 orders of magnitude more data, resulting in numbers of data items for which these metadata abstractions are inadequate, such as directory hierarchies unable to handle complex relationships among data. Users of file systems have attempted to work around these inadequacies by moving application-specific metadata management to relational databases to make metadata searchable. Splitting file system metadata management into two separate systems introduces inefficiencies and systems management problems. To address this problem, we propose QMDS: a file system metadata management service that integrates all file system metadata and uses a graph data model with attributes on nodes and edges. Our service uses a query language interface for file identification and attribute retrieval. We present our metadata management service design and architecture and study its performance using a text analysis benchmark application. Results from our QMDS prototype show the effectiveness of this approach. Compared to the use of a file system and relational database, the QMDS prototype shows superior performance for both ingest and query workloads.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131235265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Research on Energy Consumption of General Network Storage System 通用网络存储系统能耗研究

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.34

Li Kai, Xiaofang Zhang, Xiao Zhang

引用次数: 1

PDRS: A New Recovery Scheme Application for Vertical RAID-6 Code PDRS:一种新的垂直RAID-6代码恢复方案

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.36

Shiyi Li, Q. Cao, Jianzhong Huang, Shenggang Wan, C. Xie

{"title":"PDRS: A New Recovery Scheme Application for Vertical RAID-6 Code","authors":"Shiyi Li, Q. Cao, Jianzhong Huang, Shenggang Wan, C. Xie","doi":"10.1109/NAS.2011.36","DOIUrl":"https://doi.org/10.1109/NAS.2011.36","url":null,"abstract":"As the technique developing, some important problems in storage systems have been solved appropriately. A good example is the development of RAID-6 code techinque, the appear of it has greatly improved the reliability, availability of modern storage systems. Some best known vertical RAID-6 code like P-code and X-code has acquire optimal or near optimal performance in encoding, decoding and update. But they do not detailedly analysis the status of reconstruction with single-disk failure. In the status, there are many paths to perform reconstructing. But the path you choice will greatly affect the performance of whole storage system. Based the phenomenon found above, we present a fast and effcient scheme, Path Directed Recovery Scheme (PDRS for short), to find a optimal path to reconstruct single-disk failure in P-code and X-code. Using PDRS, we will acquire some benefits: (1) it can decrease the disk I/O complexity caused by reconstruction and therefore accelerating the speed of reconstruction, (2) it can balance the load on each disk, consequently can avoid the hot problem in a degree. We perform theoretical analysis and evaluation of the PDRS when applied in P-code with (p-1)-disk and X-code with p-disk. Our theoretical analysis shows that PDRS applied in P-code with (p-1)-disk can acquire up to 25% performance improvement. To verify the effectiveness of PDRS, we have conducted intenvice simulation. The simulation results shows that PDRS applied in P-code with (p-1)-disk can speedup the recovery duration by up to 23.6% under spare-rebuilding mode. Overall, PDRS is a efficient and useful recovery scheme that can applied to all of the vertical RAID-6 code.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132918885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

A Processor-DMA-Based Memory Copy Hardware Accelerator 一个基于处理器- dma的内存复制硬件加速器

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.15

Wen Su, Ling Wang, Menghao Su, Su Liu

引用次数: 10

Performance, Reliability, and Performability Aspects of Hierarchical RAID 分级RAID的性能、可靠性和可执行性

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.45

Alexander Thomasian, Yujie Tang

引用次数: 8

Azor: Using Two-Level Block Selection to Improve SSD-Based I/O Caches Azor:使用两级块选择来改进基于ssd的I/O缓存

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.50

Yannis Klonatos, Thanos Makatos, M. Marazakis, Michail Flouris, A. Bilas

{"title":"Azor: Using Two-Level Block Selection to Improve SSD-Based I/O Caches","authors":"Yannis Klonatos, Thanos Makatos, M. Marazakis, Michail Flouris, A. Bilas","doi":"10.1109/NAS.2011.50","DOIUrl":"https://doi.org/10.1109/NAS.2011.50","url":null,"abstract":"Flash-based solid state drives (SSDs) exhibit potential for solving I/O bottlenecks by offering superior performance over hard disks for several workloads. In this work we design Azor, an SSD-based I/O cache that operates at the block-level and is transparent to existing applications, such as databases. Our design provides various choices for associativity, write policies and cache line size, while maintaining a high degree of I/O concurrency. Our main contribution is that we explore differentiation of HDD blocks according to their expected importance on system performance. We design and analyze a two-level block selection scheme that dynamically differentiates HDD blocks, and selectively places them in the limited space of the SSD cache. We implement Azor in the Linux kernel and evaluate its effectiveness experimentally using a server-type platform and large problem sizes with three I/O intensive workloads: TPC-H, SPECsfs 2008, and Hammerora. Our results show that as the cache size increases, Azor enhances I/O performance by up to 14.02×, 1.63×, and 1.55× for each workload respectively. Additionally, our two-level block selection scheme further enhances I/O performance compared to a typical SSD cache by up to 95%, 16%, and 34% for each workload, respectively.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134501050","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Using Eager Strategies to Improve NFS I/O Performance 使用Eager策略提高NFS I/O性能

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1080/17445760.2012.658801

Stephen A. Rago, A. Bohra, C. Ungureanu

{"title":"Using Eager Strategies to Improve NFS I/O Performance","authors":"Stephen A. Rago, A. Bohra, C. Ungureanu","doi":"10.1080/17445760.2012.658801","DOIUrl":"https://doi.org/10.1080/17445760.2012.658801","url":null,"abstract":"Typical NFS clients write in a lazy fashion: they leave dirty pages in the page cache and defer writing to the server until later. This reduces network traffic when applications repeatedly modify the same set of pages. However, this approach can lead to memory pressure, when the number of available pages on the client system is so low that the system must work harder to reclaim dirty pages. System performance is poor under memory pressure. We show examples of this problem and present two mechanisms to solve it: eager write back and eager page laundering. These mechanisms change the client's data management policy from lazy to eager, resulting in higher throughput for sequential writes. In addition, we show that NFS servers suffer from out-of-order file operations, which further reduce performance. We introduce request ordering, a server mechanism to process operations (as much as possible) in the order they were sent by the client, which improves read performance substantially. We have implemented these techniques in the Linux operating system. I/O performance is improved, with the most pronounced improvement visible for sequential access to large files. We see about 33% improvement in the performance of streaming write workloads and more than triple the performance of streaming read workloads. We evaluate several nonsequential workloads and show that these techniques do not degrade performance, and can sometimes improve performance. We also design and evaluate an adversarial workload to show that the eager policies can perform worse in some pathological cases.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125136168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Secure Fragment Allocation in a Distributed Storage System with Heterogeneous Vulnerabilities 异构漏洞分布式存储系统中的安全分片分配

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.14

Yun Tian, Shu Yin, Jiong Xie, Ji Zhang, X. Qin, Mohammed I. Alghamdi, Meikang Qiu, Yiming Yang

{"title":"Secure Fragment Allocation in a Distributed Storage System with Heterogeneous Vulnerabilities","authors":"Yun Tian, Shu Yin, Jiong Xie, Ji Zhang, X. Qin, Mohammed I. Alghamdi, Meikang Qiu, Yiming Yang","doi":"10.1109/NAS.2011.14","DOIUrl":"https://doi.org/10.1109/NAS.2011.14","url":null,"abstract":"There is a growing demand for large-scale distributed storage systems to support resource sharing and fault tolerance. Although heterogeneity issues of distributed systems have been widely investigated, little attention has yet been paid to security solutions designed for distributed storage systems with heterogeneous vulnerabilities. This fact motivates us to investigate a fragment allocation scheme called S-FAS to improve security of a distributed system where storage sites have a wide variety of vulnerabilities. In the S-FAS approach, we integrate file fragmentation with the secret sharing technique in a distributed storage system with heterogeneous vulnerabilities. Storage sites in a distributed systems are classified into a variety of different server types based on vulnerability characteristics. Given a file and a distributed system, S-FAS allocates fragments of the file to as many different types of nodes as possible in the system. Data confidentiality is preserved because fragments of a file are allocated to multiple storage nodes. We develop storage assurance and dynamic assurance models to evaluate the quality of security offered by S-FAS. Analysis results show that fragment allocations made by S-FAS lead to enhanced security because of the consideration of heterogeneous vulnerabilities in distributed storage systems.","PeriodicalId":263887,"journal":{"name":"2011 IEEE Sixth International Conference on Networking, Architecture, and Storage","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129945318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

EthSpeeder: A High-performance Scalable Fault-Tolerant Ethernet Network Architecture for Data Center EthSpeeder:一种用于数据中心的高性能可扩展容错以太网网络架构

2011 IEEE Sixth International Conference on Networking, Architecture, and Storage Pub Date : 2011-07-28 DOI: 10.1109/NAS.2011.44

Dawei Wang, Xian-He Sun, Nongda Hu, Ninghui Sun

引用次数: 1