24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)最新文献

筛选
英文 中文
Hybrid Host/Network Topologies for Massive Storage Clusters 海量存储集群的主机/网络混合拓扑
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.19
Asha Andrade, Ungzu Mun, D. Chung, A. Mohr
{"title":"Hybrid Host/Network Topologies for Massive Storage Clusters","authors":"Asha Andrade, Ungzu Mun, D. Chung, A. Mohr","doi":"10.1109/MSST.2007.19","DOIUrl":"https://doi.org/10.1109/MSST.2007.19","url":null,"abstract":"The high demand for large scale storage capacity calls for the availability of massive storage solutions with high performance interconnects. Although cluster file systems are rapidly improving and have the potential to allow extremely large numbers of commodity storage nodes to be pooled into a single large file-system, the number of ports on individual switches has not been increasing as quickly - the largest switches available today support fewer than 2,000 Gigabit Ethernet ports. Our goal, therefore, is to develop a new interconnect topology that can connect hundreds of thousands of nodes and achieve performance comparable to a single switch of equivalent size. At the same time, such a new topology should be readily buildable using inexpensive components. Our proposed architecture exploits the multiple Ethernet ports that are now standard on servers and combines host- based routing and forwarding with network-based switching to allow massively large storage clusters to be built. Simulation results have shown that our proposed design achieves 72% to 90% of the performance of a single switch capable of accommodating all storage nodes, but our approach scales to hundreds of thousands of nodes. Furthermore, we use common off-the-shelf layer-2 switches rather than more expensive models that support layer-3 routing. Finally, our approach is resilient to network faults because it maintains multiple paths between storage nodes.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"15 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114029803","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
Using Comprehensive Analysis for Performance Debugging in Distributed Storage Systems 综合分析在分布式存储系统性能调试中的应用
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.36
A. Leung, E. Lalonde, Jacob Telleen, James Davis, C. Maltzahn
{"title":"Using Comprehensive Analysis for Performance Debugging in Distributed Storage Systems","authors":"A. Leung, E. Lalonde, Jacob Telleen, James Davis, C. Maltzahn","doi":"10.1109/MSST.2007.36","DOIUrl":"https://doi.org/10.1109/MSST.2007.36","url":null,"abstract":"Achieving performance, reliability, and scalability presents a unique set of challenges for large distributed storage. To identify problem areas, there must be a way for developers to have a comprehensive view of the entire storage system. That is, users must be able to understand both node specific behavior and complex relationships between nodes. We present a distributed file system profiling method that supports such analysis. Our approach is based on combining node-specific metrics into a single cohesive system image. This affords users two views of the storage system: a micro, per-node view, as well as, a macro, multi- node view, allowing both node-specific and complex inter- nodal problems to be debugged. We visualize the storage system by displaying nodes and intuitively animating their metrics and behavior allowing easy analysis of complex problems.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"554 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":"123929432","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}
引用次数: 3
Inter-node Communication in Peer-to-Peer Storage Clusters 存储集群节点间通信
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.22
A. Brinkmann, S. Effert
{"title":"Inter-node Communication in Peer-to-Peer Storage Clusters","authors":"A. Brinkmann, S. Effert","doi":"10.1109/MSST.2007.22","DOIUrl":"https://doi.org/10.1109/MSST.2007.22","url":null,"abstract":"Storage clusters try to transfer the idea of cluster computing into the storage domain and to scale capacity and performance by simply adding new cluster components. This paper presents analytical considerations on the scalability of storage clusters and presents a storage cluster architecture based on peer-to-peer computing that is able to scale up to hundreds of servers and clients. The resulting storage cluster environment has been successfully implemented and tested on a Linux based HPC-cluster. The measurement results presented in this paper demonstrate the feasibility and scalability of this architecture.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"73 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":"126151034","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
Enabling database-aware storage with OSD 通过OSD启用数据库感知存储
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.15
A. Raghuveer, S. Schlosser, S. Iren
{"title":"Enabling database-aware storage with OSD","authors":"A. Raghuveer, S. Schlosser, S. Iren","doi":"10.1109/MSST.2007.15","DOIUrl":"https://doi.org/10.1109/MSST.2007.15","url":null,"abstract":"The ANSI object-based storage device (OSD) standard is a major step toward enabling explicit application-awareness in storage systems behind a standard, fully- interoperable interface [3]. In this paper, we explore a particular flavor of application-awareness, that of database applications. We describe the design and implementation of a database-aware storage system that uses the OSD interface not only as a means to access data, but also to permit explicit communication between the application and the storage system. This communication is significant, as it enables our storage system to transparently optimize data placement and request scheduling. We demonstrate that OSD makes it practical to improve storage performance in these ways without exposing proprietary disk drive parameters to application code, and without labor-intensive, fragile parameter measurement.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 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":"121858883","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}
引用次数: 6
CASTOR: A Distributed Storage Resource Facility for High Performance Data Processing at CERN CASTOR: CERN用于高性能数据处理的分布式存储资源设施
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.7
G. Presti, O. Bärring, A. Earl, R. M. G. Rioja, S. Ponce, Giulia Taurelli, Dennis Waldron, M. Santos
{"title":"CASTOR: A Distributed Storage Resource Facility for High Performance Data Processing at CERN","authors":"G. Presti, O. Bärring, A. Earl, R. M. G. Rioja, S. Ponce, Giulia Taurelli, Dennis Waldron, M. Santos","doi":"10.1109/MSST.2007.7","DOIUrl":"https://doi.org/10.1109/MSST.2007.7","url":null,"abstract":"Mass storage systems at CERN have evolved over time to meet growing requirements, in terms of both scalability and fault resiliency. The CERN advanced storage system (CASTOR) and its new disk cache management layer (CASTOR2) have been developed to meet the challenges raised by the experiments using the new accelerator that CERN is building: the large hadron collider (LHC) [4]. This system must be able to cope with hundreds of millions of files, tens of petabytes of storage and handle a constant throughput of several gigabytes per second. In this paper, we detail CASTOR's architecture and implementation and present some operational aspects. We finally list the performance levels achieved by the current version both in a production environment and during internal tests.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"44 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":"116607425","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}
引用次数: 49
Cost Analysis of the X-code Double Parity Array x码双奇偶校验阵列的成本分析
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.9
Alexander Thomasian, Jun Xu
{"title":"Cost Analysis of the X-code Double Parity Array","authors":"Alexander Thomasian, Jun Xu","doi":"10.1109/MSST.2007.9","DOIUrl":"https://doi.org/10.1109/MSST.2007.9","url":null,"abstract":"The popular RAID5 disk arrays tolerate a single disk failure by using a parity code to reconstruct the contents of a failed disk on demand, but are susceptible to data loss if a second disk fails. The rebuild process which systematically reconstructs the contents of a failed disk on a spare disk may be unsuccessful due to media failures or a second disk failure. Two disk failure tolerant arrays dealing with both problems can be implemented using Reed-Solomon codes or multiple parity schemes such as EVENODD, RDP, X- code, and RM2. All methods incur the minimum level of redundancy in disk accesses and also capacity overhead (except RM2). An appropriate choice of symbol sizes in EVENODD and RDP results in the same access pattern as RAID6 and little disk load imbalance in degraded mode. In this study we consider the load increase and imbalance of the X-code method, since other methods were investigated in previous studies. We derive a general expression for disk loads and present graphs to quantify the load imbalance.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"3 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":"134098098","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
Preservation DataStores: Architecture for Preservation Aware Storage 保存数据存储:保存感知存储的体系结构
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.27
M. Factor, D. Naor, S. Rabinovici-Cohen, Leeat Ramati, Petra Reshef, J. Satran, D. Giaretta
{"title":"Preservation DataStores: Architecture for Preservation Aware Storage","authors":"M. Factor, D. Naor, S. Rabinovici-Cohen, Leeat Ramati, Petra Reshef, J. Satran, D. Giaretta","doi":"10.1109/MSST.2007.27","DOIUrl":"https://doi.org/10.1109/MSST.2007.27","url":null,"abstract":"The volumes of digital information are growing continuously and most of today's information is \"born digital\". Alongside this trend, business, scientific, artistic and cultural needs require much of this information to be kept for decades, centuries or longer. The convergence of these two trends implies the need for storage systems that support very long term preservation for digital information. We describe Preservation DataStores, a novel storage architecture to support digital preservation. It is a layered architecture that builds upon open standards, along with the OAIS, XAM and OSD standards. This new architecture transforms the logical information-object, a basic concept in preservation systems, into a physical storage object. The transformation allows more robust and optimized implementations for preservation aware storage. The architecture of Preservation DataStores is being developed as an infrastructure component of the CASPAR project and will be tested in the context of this project using scientific, cultural, and artistic data.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 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":"121452017","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}
引用次数: 21
Early Experiences in Managing Inter-Site Storage Area Networks Using Secure Web Services 使用安全Web服务管理站点间存储区域网络的早期经验
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.13
B. Kobler, Fritz McCall, Mike Van Opstal, H. Thompson, Kirk Hunter
{"title":"Early Experiences in Managing Inter-Site Storage Area Networks Using Secure Web Services","authors":"B. Kobler, Fritz McCall, Mike Van Opstal, H. Thompson, Kirk Hunter","doi":"10.1109/MSST.2007.13","DOIUrl":"https://doi.org/10.1109/MSST.2007.13","url":null,"abstract":"The NASA Goddard Space Flight Center and the University of Maryland Institute for advanced computer studies have deployed a pilot system for managing distributed IP-based storage area networks of dynamically allocated SAN extensions in the advanced virtual engine test cell (AVETEC) data intensive computing environment (DICE). The system implements the framework for managing inter-site storage area networks using grid and web services technologies presented at MSST06. It includes several new components including a basic registry and a java-based command line interface. The test-bed provides some early experiences with the reliability, usability, and security of the system, as well as some performance testing of the web services.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"5 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":"123139678","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
E-Beam Hard Disk Drive Using Gated Carbon Nano Tube Source and Phase Change Media 采用门控碳纳米管源和相变介质的电子束硬盘驱动器
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.12
W. Oakley
{"title":"E-Beam Hard Disk Drive Using Gated Carbon Nano Tube Source and Phase Change Media","authors":"W. Oakley","doi":"10.1109/MSST.2007.12","DOIUrl":"https://doi.org/10.1109/MSST.2007.12","url":null,"abstract":"A novel high speed, high capacity electron-beam recording technique using nano technology in a hard disk drive form factor is described. The e-beam source is a carbon nanotube (CNT) emitter and can be gated at rates up to several gigahertz. The planned recording media is phase change with sub-nano second response times, and data read-out by secondary electron emission is anticipated. The key parameters for generating the recording beam are described and a preliminary design is discussed in which the CNT based read/write head replaces the magnetic head in a standard hard disk drive (HDD). The technique sidesteps limits associated with HDD technology and potentially provides far higher recording densities and higher data rates than possible with conventional magnetic-recording. The NS3 nanotech disk (NTD) approach may provide a path forward for HDD's to the low nanometer mark scale.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"42 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":"126304090","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}
引用次数: 3
Trustworthy Migration and Retrieval of Regulatory Compliant Records 法规遵从记录的可信迁移和检索
24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007) Pub Date : 2007-09-24 DOI: 10.1109/MSST.2007.35
Soumyadeb Mitra, M. Winslett, W. Hsu, Xiaonan Ma
{"title":"Trustworthy Migration and Retrieval of Regulatory Compliant Records","authors":"Soumyadeb Mitra, M. Winslett, W. Hsu, Xiaonan Ma","doi":"10.1109/MSST.2007.35","DOIUrl":"https://doi.org/10.1109/MSST.2007.35","url":null,"abstract":"Compliance storage servers are designed to meet organizational needs for trustworthy records retention, largely mandated by recent legislations such as HIPAA, SEC Rule 17a, and the Sarbanes-Oxley Act. These devices export a file-system-level interface, and enforce write-once read- many (WORM) semantics for file access. Compliance storage protects records from alteration, as long as they remain on the same storage server. However, the decades-long records retention requirements of recent legislation mean that a compliance storage server will often be obsolete long before the documents it contains can be destroyed. Unfortunately, records will be vulnerable to change during migration to a new server. Records are also vulnerable during retrieval, when they are taken off the server and \"migrated\" to the person or organization who needs them. In this paper, we propose techniques for trustworthy document migration and retrieval, by enhancing the storage servers with the capability to sign their files and directories. The proposed techniques can be used to verify that a migration was carried out properly, even across multiple migrations, deletions of expired documents, and changes in the content and structure of migrated directories. In our approach, file writers incur no performance penalty, which is important since compliance workloads are write-intensive. Migration incurs a reasonable 5-10% space overhead and requires 24 msec processing time per file. The result of the migration can be verified at a rate of 24 msec per file by a trustworthy auditor (or ordinary user), who can then generate a certificate attesting to the correctness of the migration.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"231 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":"130621958","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}
引用次数: 3
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学术官方微信