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

{"title":"The RAM Enhanced Disk Cache Project (REDCAP)","authors":"Pilar González-Férez, J. Piernas, Toni Cortes","doi":"10.1109/MSST.2007.32","DOIUrl":"https://doi.org/10.1109/MSST.2007.32","url":null,"abstract":"This paper presents the RAM enhanced disk cache project, REDCAP, a new cache of disk blocks which reduces the read I/O time by using a small portion of the main memory. The essential ideas behind REDCAP are to enlarge the built-in cache of the disk drive, imitate its behavior, and take advantage of its read-ahead mechanism by prefetching disk blocks. REDCAP is intended to be I/O- time efficient, and implements an activation-deactivation algorithm which turns its cache on and off dynamically depending on the I/O time improvement achieved. REDCAP has been implemented in the Linux kernel. The experimental results show that our proposal reduces the application time by up to 80% for workloads which exhibit some spatial locality, while it has the same performance as a traditional system for those workloads which have a random access pattern, or perform large sequential reads.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"35 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":"132677696","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":"Storage Resource Managers: Recent International Experience on Requirements and Multiple Co-Operating Implementations","authors":"L. Abadie, P. Badino, J. Baud, Ezio Corso, M. Crawford, S. D. Witt, F. Donno, A. Forti, Á. Frohner, P. Fuhrmann, G. Grosdidier, Junmin Gu, J. Jensen, B. Koblitz, S. Lemaitre, M. Litmaath, D. Litvintsev, G. Presti, L. Magnoni, T. Mkrtchyan, A. Moibenko, Rémi Mollon, V. Natarajan, G. Oleynik, T. Perelmutov, D. Petravick, A. Shoshani, A. Sim, David E. Smith, M. Sponza, P. Tedesco, R. Zappi","doi":"10.1109/MSST.2007.31","DOIUrl":"https://doi.org/10.1109/MSST.2007.31","url":null,"abstract":"Storage management is one of the most important enabling technologies for large-scale scientific investigations. Having to deal with multiple heterogeneous storage and file systems is one of the major bottlenecks in managing, replicating, and accessing files in distributed environments. Storage resource managers (SRMs), named after their Web services control protocol, provide the technology needed to manage the rapidly growing distributed data volumes, as a result of faster and larger computational facilities. SRMs are grid storage services providing interfaces to storage resources, as well as advanced functionality such as dynamic space allocation and file management on shared storage systems. They call on transport services to bring files into their space transparently and provide effective sharing of files. SRMs are based on a common specification that emerged over time and evolved into an international collaboration. This approach of an open specification that can be used by various institutions to adapt to their own storage systems has proven to be a remarkable success - the challenge has been to provide a consistent homogeneous interface to the grid, while allowing sites to have diverse infrastructures. In particular, supporting optional features while preserving interoperability is one of the main challenges we describe in this paper. We also describe using SRM in a large international high energy physics collaboration, called WLCG, to prepare to handle the large volume of data expected when the Large Hadron Collider (LHC) goes online at CERN. This intense collaboration led to refinements and additional functionality in the SRM specification, and the development of multiple interoperating implementations of SRM for various complex multi- component storage systems.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 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":"129327092","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":"Implementing and Evaluating Security Controls for an Object-Based Storage System","authors":"Zhongying Niu, Ke Zhou, D. Feng, Hong Jiang, Frank Wang, Hua Chai, Wei Xiao, Chunguang Li","doi":"10.1109/MSST.2007.21","DOIUrl":"https://doi.org/10.1109/MSST.2007.21","url":null,"abstract":"This paper presents the implementation and performance evaluation of a real, secure object-based storage system compliant to the T10 OSD standard. In contrast to previous work, our system implements the entire three security methods of the OSD security protocol defined in the standard, namely CAPKEY, CMDRSP and ALLDATA, and an Oakley-based authentication protocol by which the Metadata Server (MDS) and client can be sure of each other's identities. Moreover, our system supports concurrent operations from multiple clients to multiple OSDs. The MDS, a combination of security manager and storage/policy manager, performs access control, global namespace management, and concurrency control. We also evaluate the performance and scalability of our implementation and compare it with iSCSI, NFS and Lustre storage configurations. The overhead of access control is small: compared with the same system without any security mechanism, bandwidth for reads and writes with the CAPKEY and CMDRSP methods decreases by less than 5%, while latency for metadata operations with any of the security methods increases by less than 0.3 ms (5%). The system with the ALLDATA method suffers a higher performance penalty: large sequential accesses run at 46% and 52% of the maximum bandwidth of unsecured storage for reads and writes respectively. The aggregate throughput scales with the number of OSDs (up to 8 in our experiments). The overhead of the SET KEY commands for partition and working keys refreshed frequently is less than 2 ms.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 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":"134351529","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":"Tornado Codes for MAID Archival Storage","authors":"M. Woitaszek, H. Tufo","doi":"10.1109/MSST.2007.33","DOIUrl":"https://doi.org/10.1109/MSST.2007.33","url":null,"abstract":"This paper examines the application of Tornado codes, a class of low density parity check (LDPC) erasure codes, to archival storage systems based on massive arrays of idle disks (MAID). We present a log- structured extent-based archival file system based on Tornado Coded stripe storage. The file system is combined with a MAID simulator to emulate the behavior of a large-scale storage system with the goal of employing Tornado Codes to provide fault tolerance and performance in a power-constrained environment. The effect of power conservation constraints on system throughput is examined, and a policy of placing multiple data nodes on a single device is shown to increase read throughput at the cost of a measurable, but negligible, decrease in fault tolerance. Finally, a system prototype is implemented on a 100 TB Lustre storage cluster, providing GridFTP accessible storage with higher reliability and availability than the underlying storage architecture.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"2015 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":"134364710","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":"Quota enforcement for high-performance distributed storage systems","authors":"Kristal T. Pollack, D. Long, Richard A. Golding, R. Becker-Szendy, B. Reed","doi":"10.1109/MSST.2007.29","DOIUrl":"https://doi.org/10.1109/MSST.2007.29","url":null,"abstract":"Storage systems manage quotas to ensure that no one user can use more than their share of storage, and that each user gets the storage they need. This is difficult for large, distributed systems, especially those used for high- performance computing applications, because resource allocation occurs on many nodes concurrently. While quota management is an important problem, no robust scalable solutions have been proposed to date. We present a solution that has less than 0.2% performance overhead while the system is below saturation, compared with not enforcing quota at all. It provides byte-level accuracy at all times, in the absence of failures and cheating. If nodes fail or cheat, we recover within a bounded period. In our scheme quota is enforced asynchronously by intelligent storage servers: storage clients contact a shared management service to obtain vouchers, which the clients can spend like cash at participating storage servers to allocate storage space. Like a digital cash system, the system periodically reconciles voucher usage to ensure that clients do not cheat by spending the same voucher at multiple storage servers. We report on a simulation study that validates this approach and evaluates its performance.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"93 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":"129652689","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":"Attribute Storage Design for Object-based Storage Devices","authors":"A. Devulapalli, D. Dalessandro, P. Wyckoff, N. Ali","doi":"10.1109/MSST.2007.4","DOIUrl":"https://doi.org/10.1109/MSST.2007.4","url":null,"abstract":"As storage systems grow larger and more complex, the traditional block-based design of current disks can no longer satisfy workloads that are increasingly metadata intensive. A new approach is offered by object-based storage devices (OSDs). By moving more of the responsibility of storage management onto each OSD, improvements in performance, scalability and manageability are possible. Since this technology is new, no physical object-based storage device is currently available. In this work we describe a software emulator for an object-based disk. We focus on the design of the attribute storage, which is used to hold metadata associated with particular data objects. Alternative designs are discussed, and performance results for an SQL implementation are presented.","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":"127393896","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":"Flushing Policies for NVCache Enabled Hard Disks","authors":"Timothy Bisson, S. Brandt","doi":"10.1109/MSST.2007.16","DOIUrl":"https://doi.org/10.1109/MSST.2007.16","url":null,"abstract":"One of the goals of upcoming hybrid hard disks is to reduce power consumption by adding a small amount of non-volatile flash memory (NVCache) to the drive itself. By using the NVCache to satisfy writes while the rotating media is spun-down, hard disk power consumption can be decreased by lengthening low-power periods. However, the NVCache must eventually be flushed back to the rotating media in order to cache additional data. In this paper we explore two questions: when and how should NVCache content be flushed to rotating media in order to minimize the overhead of data synchronization. We show that by using traditional I/O mechanisms such as merging and reordering, combined with a \"flush only when full\" policy, flushing performance improves significantly.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"13 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":"128528062","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":"TPT-RAID: a High Performance Box-Fault Tolerant Storage System","authors":"Y. Birk, E. Zilber","doi":"10.1109/MSST.2007.34","DOIUrl":"https://doi.org/10.1109/MSST.2007.34","url":null,"abstract":"TPT-RAID is a multi-box RAID wherein each ECC group comprises at most one block from any given storage box, and can thus tolerate a box failure. It extends the idea of an out-of band SAN controller into the RAID: data is sent directly between hosts and targets and among targets, and the RAID controller supervises ECC calculation by the targets. By preventing a communication bottleneck in the controller, excellent scalability is achieved while retaining the simplicity of centralized control. TPT-RAID, whose controller can be a software module within an out-of-band SAN controller, moreover conforms to a conventional switched network architecture, whereas an in-band RAID controller would either constitute a communication bottleneck or would have to also be a full-fledged router. The design is validated in an InfiniBand-based prototype using /SCSI and /SER, and required changes to relevant protocols are introduced.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"12 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":"131741168","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":"Design and Implementation of a Network Aware Object-based Tape Device","authors":"Dingshan He, N. Mandagere, D. Du","doi":"10.1109/MSST.2007.11","DOIUrl":"https://doi.org/10.1109/MSST.2007.11","url":null,"abstract":"Data storage requirements have constantly evolved over time. In recent times, the rate of increase in volume of data has been exponential, partly because of regulations and partly because of increase in richness of data. This trend has led to an equally explosive increase in cost of management. Intelligent storage devices built using object- based storage (OSD) interfaces have gained increased acceptance due to the benefits of reduced management costs. The command set of the current OSD standard does not work well with tape-based storage solutions. In this work we propose a few extensions to the OSD standard in order to facilitate easier integration of tape devices into the object storage ecosystem. Further, we propose an intelligent buffering mechanism to maximize the utility of network attached tape devices, and we also propose mechanisms to make tape cartridges more portable within any object storage ecosystem. Our results for the intelligent buffering mechanism show that our scheme adapts better to mismatches in network and tape drive bandwidths. Specifically, our scheme helps minimize the repositioning of the tape, leading to better utilization and increased lifetime of the tape.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"55 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":"130167978","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":"Grid-Enabled Standards-based Data Management","authors":"L. Abadie, P. Badino, J. Baud, J. Casey, Á. Frohner, G. Grosdidier, S. Lemaitre, G. McCance, Rémi Mollon, K. Nienartowicz, David E. Smith, P. Tedesco","doi":"10.1109/MSST.2007.18","DOIUrl":"https://doi.org/10.1109/MSST.2007.18","url":null,"abstract":"The world's largest scientific machine - the large hadron collider (LHC), situated outside Geneva, Switzerland - will generate some 15PB of data at rates up to 1.5 GB/s (in the case of the heavy-ion experiment, ALICE) to tape per year of operation. The processing of this data will be performed using a world-wide grid, the (worldwide) LHC computing grid built on top of the enabled grid for e-science and open science grid infrastructures. The LHC computing grid, which has offered a service for over two years now, is based upon a tier model comprising some 150 sites in tens of countries. In this paper, we describe the data management middleware stack - one of the key services provided by data grids. We give an overview of the different services implemented, a disk-based storage system which can support encryption, tools to manage the storage system and access files, the LCG file catalogue, and the file transfer service. We also review the relationship between these services.","PeriodicalId":109619,"journal":{"name":"24th IEEE Conference on Mass Storage Systems and Technologies (MSST 2007)","volume":"8 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":"132987002","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}