{"title":"Snapshots and Continuous Data Replication in Cluster Storage Environments","authors":"A. Brinkmann, S. Effert","doi":"10.1109/SNAPI.2007.13","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.13","url":null,"abstract":"Snapshots are an elegant means to derive instant, virtual copies of storage devices. For copy-on-write snapshots, data has only to be physically copied, if either the content of the original device or the content of the snapshot device changes. The online process of copying data between the devices can have a severe impact on application performance, especially if more than a single snapshot is derived from the original volume. This performance decrease becomes even worse, if the storage device is composed from individual storage bricks, working together as peer-to-peer storage cluster. This paper presents the architecture, the used data structures, and corresponding performance results for a snapshot implementation that is able to support an arbitrary number of snapshots from an original volume in a storage cluster environment, enabling it to perform (near) continuous data protection.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"9 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":"122501857","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}
{"title":"Disk Tree: A Fat-Tree Based Heterogeneous Multi-tier Storage Architecture","authors":"Zhikun Wang, Ke Zhou, D. Feng, Junping Liu","doi":"10.1109/SNAPI.2007.9","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.9","url":null,"abstract":"Traditional disk arrays have the internal bus bottleneck and can not scale well. This paper proposes Disk Tree, a novel Fat-tree based heterogeneous multi-tier storage architecture. Disk Tree is built from a collection of storage nodes, small storage appliances containing commodity disks, CPU, RAM and interconnection interfaces. Each node provides moderate levels of reliability, availability, and performance. We examine four possible configurations: striping, mirroring, logging and caching Disk Tree. We have implemented a three-tier and seven-node Disk Tree prototype and carried out extensive performance evaluations using popular benchmark for these four configurations. Depending on different I/O workloads, these four configurations perform quite differently. In general, mirroring and striping disk tree performs well on read-intensive applications while logging and caching disk tree performs well on write-intensive applications.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"6 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":"114379113","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}
{"title":"iSER Storage Target for Object-Based Storage Devices","authors":"D. Dalessandro, A. Devulapalli, P. Wyckoff","doi":"10.1109/SNAPI.2007.10","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.10","url":null,"abstract":"In order to increase client capacity and performance, storage systems have begun to utilize the advantages offered by modern interconnects. Previously storage has been transported over costly fibre channel networks or ubiquitous but low performance Ethernet networks. However, with the adoption of the iSCSI extensions for RDMA (iSER) it is now possible to use RDMA based interconnects for storage while leveraging existing iSCSI tools and deployments. Building on previous work with an object-based storage device emulator using the iSCSI transport, we extend its functionality to include iSER. Using an RDMA transport brings with it many design issues including the need register memory to be used by the network, and how to bridge the quite different RDMA completion semantics with existing event management based on file descriptors. Experiments demonstrate reduced latency and greatly increased throughput compared to iSCSI implementations both on gigabit ethernet and on IP over InfiniBand.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"29 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":"124142065","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}
{"title":"Parity Redundancy in a Clustered Storage System","authors":"Sumit Narayan, J. Chandy","doi":"10.1109/SNAPI.2007.18","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.18","url":null,"abstract":"Distributed storage systems must provide highly available access to data while maintaining high performance and maximum scalability. In addition, reliability in a storage system is of the utmost importance and the correctness and availability of data must be guaranteed. Adding parity redundancy to distributed storage systems has been problematic because of the impact on performance. In this paper, we investigate mechanisms to add redundancy to the Lustre cluster file system with minimal effect on overall system performance. With data spread across multiple nodes, ensuring the consistency of the data requires special techniques. We describe fault tolerant algorithms to maintain the consistency and reliability of the data. We show how these techniques guarantee data integrity and availability of systems for read and write even under failure mode scenarios.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"1 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":"129090234","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}
Bin Yan, Hongyi Wang, Youhui Zhang, Chuanyi Liu, Dongsheng Wang
{"title":"Teleport: Load Balancing with Dynamic Adjustment Strategy Based on OSD Storage System","authors":"Bin Yan, Hongyi Wang, Youhui Zhang, Chuanyi Liu, Dongsheng Wang","doi":"10.1109/SNAPI.2007.22","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.22","url":null,"abstract":"The development of object-based storage devices (OSDs), widely regarded as a promising storage standard, is sprouting up these days. In this paper, we bring forward a new framework of resource allocation to achieve load balancing for OSD storage systems. Compared with traditional researches that schedule requests passively, we exploit the intelligence of object storage target (OST) to generate local resource information, which is combines with the global information synthesized by the Metadata Server (MDS) to balance workloads and tune the performance. To attain this goal, a dynamic adjustment strategy is proposed to calculate some resource-related factors by MDS as well as OST, which guide each OST to adjust the data distribution and assign which OST should process a new request. Moreover, how to extend the object attributes of OSD standard to achieve this strategy is also introduced. At last, the experimental results demonstrate that this method can balance the load among OSTs fairly.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"1 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":"132912409","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}
{"title":"Enhancing the Performance of NFSv4 with RDMA","authors":"R. Noronha, Lei Chai, S. Shepler, D. Panda","doi":"10.1109/SNAPI.2007.21","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.21","url":null,"abstract":"NFS is a widely deployed storage technology. It has gone through several revisions. One of the latest revisions, v4 has started to become deployed. NFSv4 on OpenSolaris uses TCP as the underlying transport. This has limited its performance. In this paper, we take on the challenge of designing an RDMA transport for NFSv4. Challenges include COMPOUND procedures, which might potentially have unbounded request and reply sizes. Performance evaluation shows that NFSv4 can achieve an IOzone Read throughput of over 700 MB/s and an IOzone Write bandwidth of over 500 MB/s. It also significantly outperforms NFSv4/TCP","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"76 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":"114863968","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}
{"title":"Direct-Attached Disk Subsystem Performance Assessment","authors":"R. Chamberlain, B. Shands","doi":"10.1109/SNAPI.2007.23","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.23","url":null,"abstract":"Direct-attached storage has historically had the reputation of being less capable than equivalently sized SAN installations. Here, we empirically demonstrate the performance achievable in multiple-terabyte, direct-attached disk subsystems. A number of parameters are explored, including file system, number of logical drives, and RAID configuration.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"37 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":"122453086","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}
{"title":"A Benchmark Suite for Unstructured Data Processing","authors":"C. Smullen, S. Tarapore, S. Gurumurthi","doi":"10.1109/SNAPI.2007.8","DOIUrl":"https://doi.org/10.1109/SNAPI.2007.8","url":null,"abstract":"A large fraction of the data that will stored and accessed in future systems is expected to be unstructured, in the form of images, audio files, etc. Therefore, it is very important to design future I/O subsystems to provide efficient storage, and access to these vast and continuously growing repositories of unstructured data. To facilitate system design and evaluation, we first need benchmarks that capture the processing and I/O access characteristics of applications that operate on unstructured data. In this paper, we present an unstructured data processing benchmark suite that we have developed. We provide detailed descriptions of the workloads in the benchmark suite and discuss the larger space of application characteristics that each of them capture.","PeriodicalId":347839,"journal":{"name":"Fourth International Workshop on Storage Network Architecture and Parallel I/Os (SNAPI 2007)","volume":"39 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":"122735160","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}