发布求助
文献互助 智能选刊 最新文献

Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)最新文献

筛选
英文 中文
Coding and Scheduling Considerations for Peer-to-Peer Storage Backup Systems 点对点存储备份系统的编码和调度考虑
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.19
Y. Birk, T. Kol
{"title":"Coding and Scheduling Considerations for Peer-to-Peer Storage Backup Systems","authors":"Y. Birk, T. Kol","doi":"10.1109/SNAPI.2007.19","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.19","url":null,"abstract":"Peer-to-peer storage- and in particular backup-system architectures have recently attracted much interest due to their use of \"free \" resources, with disk spindles and communication bandwidth being at least as important as storage space. This paper complements most of the works on this topic, whose focus was on metadata, security, locating the stored data, etc., by focusing on the data itself. It offers important design considerations and insights pertaining to the composition of erasure-correction code (ECC) groups, their size and the level of redundancy. Dynamic issues such as the co-scheduling of the concurrent reconstruction of multiple ECC groups are also explored. Finally, we identify an interesting natural match between asymmetric communication bandwidth (e.g., ADSL) and a hierarchical reconstruction architecture aimed at alleviating bottlenecks at the reconstructing node.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130257012","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}
引用次数: 5
A Packet Forwarding Method for the ISCSI Virtualization Switch 一种ISCSI虚拟化交换机的报文转发方法
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.25
Y. Chung, S. Lee, C. Chen
{"title":"A Packet Forwarding Method for the ISCSI Virtualization Switch","authors":"Y. Chung, S. Lee, C. Chen","doi":"10.1109/SNAPI.2007.25","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.25","url":null,"abstract":"We present a packet forwarding method for the implementation of the iSCSI virtualization switch used in the SANs. Using the existing virtualization software plus network protocol stacks, first we build up a network-based storage virtualization switch model in the architecture of the symmetric approach. In compliance with the same functionality, our method can reduce the overheads of protocol processing by using a packet forwarding method based on caching the structure ID of the iSCSI session. With the Address Translator and Duplicating Handler, our design can also achieve the feature of storage virtualization management. From the result of our performance experiment, our forwarding system can achieve a higher performance on the READ/WRITE operations by 25% ~30% and reduce the CPU utilization by 10% ~15% compared to the conventional virtualization switch.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132725677","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
OPAL: An Open-Source MPI-IO Library over Cray XT OPAL:基于Cray XT的开源MPI-IO库
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.15
Weikuan Yu, J. Vetter, R. S. Canon
{"title":"OPAL: An Open-Source MPI-IO Library over Cray XT","authors":"Weikuan Yu, J. Vetter, R. S. Canon","doi":"10.1109/SNAPI.2007.15","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.15","url":null,"abstract":"Parallel I/O over Cray XT is supported by a vendor-supplied MPI-IO package. This package contains a proprietary ADIO implementation built on top of the sysio library. While it is reasonable to maintain a stable code base for users' convenience, it is also very important for the system developers and researchers to analyze and assess the effectiveness of parallel I/O software, and accordingly, tune and optimize the MPI-IO implementation. A proprietary parallel I/O code base relinquishes such flexibilities. On the other hand, a generic UFS-based MPI-IO implementation is typically used on many Linux-based platforms, which lacks of the capability of utilizing Lustre specific features. We have developed an open- source MPI-IO package over Lustre, referred to as OPAL (Opportunistic and Adaptive MPI-IO Library over Lustre). OPAL provides a single source-code base for MPI-IO over Lustre on both the Cray XT and Linux platforms. It provides a number of good features, including arbitrary specification of striping patterns and Lustre-stripe aligned file domain partitioning. This paper presents the performance comparisons between OPAL and Cray's proprietary implementation. Our evaluation demonstrates that OPAL achieves the performance comparable to the Cray implementation. We also exemplify the benefits of OPAL in profiling the internal time breakdown of the collective I/O protocol over Cray XT.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133209729","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}
引用次数: 11
On RDBMS-Integrated Disk-Based Architecture for Managing Massive Dormant Data in a Compressed Format 基于rdbms集成磁盘的压缩格式海量休眠数据管理体系结构研究
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.16
M. Dzakovic, C. Ellison
{"title":"On RDBMS-Integrated Disk-Based Architecture for Managing Massive Dormant Data in a Compressed Format","authors":"M. Dzakovic, C. Ellison","doi":"10.1109/SNAPI.2007.16","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.16","url":null,"abstract":"Managing dormant data in very large databases (VLDB) is about striking a balance between cost and performance. While magnetic tapes have long been a standard answer, the downsides limit the applicability for all VLDB. This paper describes a class of engineering and scientific data management applications that need a cost-effective solution with better support for updating and lower granularity of data access. To meet the needs of such applications, it then introduces an architectural extension to RDBMS. In the architecture, data is compressed using custom compression techniques, stored outside an RDBMS, and made available through views using SQL Table functions. This architecture is applicable to many industrial RDBMS, and it offers both linear speed-up and scale-out. The paper then discusses preliminary findings from a prototype implementation on Oracle RDBMS.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124427896","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}
引用次数: 0
Implementation and Performance Evaluation of an Object-Based Storage Device 对象存储设备实现与性能评估
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.11
Shuibing He, D. Feng
{"title":"Implementation and Performance Evaluation of an Object-Based Storage Device","authors":"Shuibing He, D. Feng","doi":"10.1109/SNAPI.2007.11","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.11","url":null,"abstract":"Object-based storage system (OBSS) has led to a new wave in network storage area . Object-based storage device (OSD) which is the cornerstone of OBSS plays a decisive role in the performance of the whole OBSS. This paper describes how we implemented an object-based storage device which adopts a unique hardware architecture based on switching fabric supporting parallel data transfer in multiple I/O channels, and a new object-based storage device file system (HustOSDFS) that can reduce the software overloads to achieve high performance. The experimental evaluation results show that the OSD performs well for system performance. Furthermore, the OSD provides characteristic of large capacity and low cost.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115452152","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}
引用次数: 7
WPAR: A Weight-Based Metadata Management Strategy for Petabyte-Scale Object Storage Systems WPAR: pb级对象存储系统中基于权重的元数据管理策略
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.14
Wujuan Lin, Q. Wei, B. Veeravalli
{"title":"WPAR: A Weight-Based Metadata Management Strategy for Petabyte-Scale Object Storage Systems","authors":"Wujuan Lin, Q. Wei, B. Veeravalli","doi":"10.1109/SNAPI.2007.14","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.14","url":null,"abstract":"In an object-based network storage system, metadata access is decoupled from the data transferring path to improve system performance, scalability, and management. Designing an efficient metadata management scheme in such a system is critically important to the overall system performance and poses lots of challenges to the system designers. Traditional metadata management schemes, either partitioning the metadata statically, or using pure hashing methods, are not able to adapt to the dynamic metadata workload, and hence suffer from scalability and hotspot problems. In this paper, we propose a new metadata management strategy, referred to as Weighted Partitioning and Adaptive Replication (WPAR) scheme, taking into account the weight (CPUpower, memory capacity, network bandwidth, etc.) of each metadata server. Our objective is to efficiently distribute and dynamically replicate the metadata, based on the weights, to balance the workload and reduce hotspots within the metadata server cluster.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125293315","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
Outshining Mirrors: MTTDL of Fixed-Order Spiral Layouts 超越镜面:固定顺序螺旋布局的MTTDL
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.20
A. Amer, Jehan-Francois Pâris, T. Schwarz
{"title":"Outshining Mirrors: MTTDL of Fixed-Order Spiral Layouts","authors":"A. Amer, Jehan-Francois Pâris, T. Schwarz","doi":"10.1109/SNAPI.2007.20","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.20","url":null,"abstract":"We evaluate the reliability of storage system schemes consisting of n data disks and n parity disks where each parity disk contains the exclusive or (XOR) of two of the n data disks. These schemes are instances of the so-called SSPiRAL (survivable storage using parity in redundant array layouts). Even though they offer the simplicity of mirroring and parity schemes, we show that they approach the performance of much more complex schemes based on erasure coding. In particular, we show that a SSPiRAL scheme defined across six disks offers an MTTDL superior that of three pairs of mirrored disks. Our scheme also offers a higher MTTDL than any scheme capable of surviving the loss of two disks.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128778939","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}
引用次数: 13
Controlling Network Bandwidth to Support Storage QoS 控制网络带宽，支持存储QoS
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.24
Junkil Ryu, Chanik Park
{"title":"Controlling Network Bandwidth to Support Storage QoS","authors":"Junkil Ryu, Chanik Park","doi":"10.1109/SNAPI.2007.24","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.24","url":null,"abstract":"In network storage environments, it is difficult that a network storage system satisfies each client's service requirements because the specification of QoS requirements is presented as {request size, IOPS, response time ...}, which is used in the existing storage QoS area. Since network storage system has two resources: storage and network, storage QoS requirements to manage two resources effectively, must be specified. In particular, our study considers the TCP/IP-based network. In this paper, to support each client's storage QoS requirements easily, the specification of each client's storage QoS requirements will be presented in terms of bandwidth. The network bandwidth of a storage server must be managed because the storage service can be affected by the network bandwidth. This paper presents the QoS framework regulating the network bandwidth of the storage server to realize the storage performance isolation among the clients. The proposed framework monitors the network resource and the storage resource periodically, identifies the bottleneck resource, selects victims among clients competing for the bottleneck resource and regulates the network bandwidth given to victims to satisfy a client's storage QoS requirements. We implemented the QoS-enabled network storage using the iSCSIprotocol.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123149950","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}
引用次数: 1
QoS-Aware Striping with Replication Model for Object-Based Multimedia Storage 基于对象的多媒体存储qos感知条带化与复制模型
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.12
Q. Wei, Wujuan Lin, B. Veeravalli, Lingfang Zeng
{"title":"QoS-Aware Striping with Replication Model for Object-Based Multimedia Storage","authors":"Q. Wei, Wujuan Lin, B. Veeravalli, Lingfang Zeng","doi":"10.1109/SNAPI.2007.12","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.12","url":null,"abstract":"This paper presents a QoS-aware striping with replication model for object-based multimedia storage and retrieval. The model takes consideration of both the availability and continuity requirements of multimedia application, and expresses these constraints as function of object size and replica number. With this model, optimal object size and replica number suitable for application requirements thus can be calculated and determined. Based on the model, this paper further proposes an adaptive replica-based parallel retrieval mechanism, which decides whether, how many and which replicas will participate in parallel transfer according to performance requirement. Experimental results demonstrate that the proposed model can perform well for quality of service in terms of performance and availability.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116685794","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}
引用次数: 1
Characteristics Analysis of Aggregate Workload on Storage System 存储系统总体负载特征分析
Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007) Pub Date : 2007-09-24 DOI: 10.1109/SNAPI.2007.17
Min Wang, Lu Xu
{"title":"Characteristics Analysis of Aggregate Workload on Storage System","authors":"Min Wang, Lu Xu","doi":"10.1109/SNAPI.2007.17","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.17","url":null,"abstract":"In this paper we analyze aggregate workload characteristics of multiple I/O streams in shared storage environment such as storage area network (SAN). In these shared storage environments, independent and separate user data spaces make the access streams interleaved and localized. To evaluate overall storage performance or optimize data layout, it is important to understand aggregate workload characteristics of these streams which mutually influence and affect the overall system performance. We analyze access pattern and arrival pattern of aggregate workload by mathematics methods for the first time. The Poisson model is adopted for single stream since it is concise and straightforward. We validated that the mathematic analysis is accurate enough under our assumptions by simulation experiments using synthetic workload generator.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132392080","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}
引用次数: 2
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信