2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)最新文献_第3页

Indirection systems for shingled-recording disk drives 带状记录磁盘驱动器的间接系统

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496971

Yuval Cassuto, M. Sanvido, Cyril Guyot, David R. Hall, Z. Bandic

{"title":"Indirection systems for shingled-recording disk drives","authors":"Yuval Cassuto, M. Sanvido, Cyril Guyot, David R. Hall, Z. Bandic","doi":"10.1109/MSST.2010.5496971","DOIUrl":"https://doi.org/10.1109/MSST.2010.5496971","url":null,"abstract":"Shingled magnetic recording is a promising technology to increase the capacity of hard-disk drives with no significant cost impact. Its main drawback is that random-write access to the disk is restricted due to overlap in the layout of data tracks. For computing and storage systems to enjoy the increased capacity, it is necessary to mitigate these access restrictions, and present a storage device that serves unrestricted read/write requests with adequate performance. This paper proposes two different indirection systems to mask access restrictions and optimize performance. The first one is a diskcache based architecture that provides unrestricted access with manageable drop in performance. A second, more complex indirection system, utilizes a new storage unit called S-block. It is shown that the S-block architecture allows good sustained random-write performance, a point where the disk-cache architecture fails. The organization and algorithms of both architectures are specified in detail. Each was implemented and simulated as a discrete-event simulation, mimicking its operation on real storage devices. For the performance evaluation both synthetic workloads and traces from real workloads were used.","PeriodicalId":350968,"journal":{"name":"2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121580176","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}

引用次数: 99

Security Aware Partitioning for efficient file system search 安全意识分区，高效的文件系统搜索

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496990

Aleatha Parker-Wood, Christina E. Strong, E. L. Miller, D. Long

{"title":"Security Aware Partitioning for efficient file system search","authors":"Aleatha Parker-Wood, Christina E. Strong, E. L. Miller, D. Long","doi":"10.1109/MSST.2010.5496990","DOIUrl":"https://doi.org/10.1109/MSST.2010.5496990","url":null,"abstract":"Index partitioning techniques-where indexes are broken into multiple distinct sub-indexes-are a proven way to improve metadata search speeds and scalability for large file systems, permitting early triage of the file system. A partitioned metadata index can rule out irrelevant files and quickly focus on files that are more likely to match the search criteria. Also, in a large file system that contains many users, a user's search should not include confidential files the user doesn't have permission to view. To meet these two parallel goals, we propose a new partitioning algorithm, Security Aware Partitioning, that integrates security with the partitioning method to enable efficient and secure file system search. In order to evaluate our claim of improved efficiency, we compare the results of Security Aware Partitioning to six other partitioning methods, including implementations of the metadata partitioning algorithms of SmartStore and Spyglass, two recent systems doing partitioned search in similar environments. We propose a general set of criteria for comparing partitioning algorithms, and use them to evaluate the partitioning algorithms. Our results show that Security Aware Partitioning can provide excellent search performance at a low computational cost to build indexes, O(n). Based on metrics such as information gain, we also conclude that expensive clustering algorithms do not offer enough benefit to make them worth the additional cost in time and memory.","PeriodicalId":350968,"journal":{"name":"2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115675821","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}

引用次数: 14

dedupv1: Improving deduplication throughput using solid state drives (SSD) dedupv1:使用SSD (solid state drives)提高重复数据删除吞吐量

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496992

Dirk Meister, A. Brinkmann

引用次数: 92

High performance solid state storage under Linux Linux下的高性能固态存储

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496976

Eric Seppanen, M. O'Keefe, D. Lilja

引用次数: 61

Scalable storage support for data stream processing 数据流处理的可扩展存储支持

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496977

Zoe Sebepou, K. Magoutis

引用次数: 8

Flat XOR-based erasure codes in storage systems: Constructions, efficient recovery, and tradeoffs

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496983

K. Greenan, Xiaozhou Li, J. Wylie

引用次数: 96

The Linear Tape File System 线性磁带文件系统

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496989

David A. Pease, A. Amir, L. V. Real, B. Biskeborn, Michael Richmond, Atsushi Abe

引用次数: 27

Achieving page-mapping FTL performance at block-mapping FTL cost by hiding address translation 通过隐藏地址转换，以块映射FTL为代价实现页映射FTL性能

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496970

Yang Hu, Hong Jiang, D. Feng, Lei Tian, Shu Ping Zhang, Jingning Liu, Wei Tong, Yi Qin, Liuzheng Wang

{"title":"Achieving page-mapping FTL performance at block-mapping FTL cost by hiding address translation","authors":"Yang Hu, Hong Jiang, D. Feng, Lei Tian, Shu Ping Zhang, Jingning Liu, Wei Tong, Yi Qin, Liuzheng Wang","doi":"10.1109/MSST.2010.5496970","DOIUrl":"https://doi.org/10.1109/MSST.2010.5496970","url":null,"abstract":"Flash Translation Layer (FTL) is one of the most important components of SSD, whose main purpose is to perform logical to physical address translation in a way that is suitable to the unique physical characteristics of the Flash memory technology. The pure page-mapping FTL scheme, arguably the best FTL scheme due to its ability to map any logical page number (LPN) to any physical page number (PPN) to minimize erase operations, cannot be practically deployed since it consumes a prohibitively large RAM (SRAM or DRAM) space to store the page-mapping table for an SSD of moderate to large size. Alternatives to the pure page-mapping FTL, such as block-mapping FTLs, hybrid FTLs (e.g., FAST) and the latest demand-based page-mapping FTLs (e.g., DFTL), require significantly less RAM space but suffer from a few performance issues. Block-mapping FTLs perform poorly with higher erasure counts, particularly under random write workloads. Hybrid FTL schemes incur costly merge operations that hurt performance and increase the erasure counts. Performances of demand-based FTLs heavily depend on workload characteristics such as access locality, read/write ratio and request arrival interval time. This paper proposes a new FTL scheme, called HAT, to achieve the performance of a pure page-mapping FTL at the RAM cost of a block-mapping FTL while consuming lower energy, by hiding the address translation (HAT). The basic idea behind our scheme is to create a separate access path to read/write the address mapping information to significantly Hide the Address-Translation latency by incorporating a low energy-consuming solid-state memory device that stores the entire page mapping table. We implement an SSD simulator, SSDsim, to validate our HAT design and evaluate its performance. The extensive trace-driven simulation results show that the performance of HAT is within 0.8% of the pure page-mapping FTL, while consuming about 50% of the energy.","PeriodicalId":350968,"journal":{"name":"2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115320770","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}

引用次数: 57

Automated lookahead data migration in SSD-enabled multi-tiered storage systems 支持ssd的多层存储系统中的自动前瞻数据迁移

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-03 DOI: 10.1109/MSST.2010.5496999

Gong Zhang, Lawrence Chiu, Clem Dickey, Ling Liu, P. Muench, S. Seshadri

{"title":"Automated lookahead data migration in SSD-enabled multi-tiered storage systems","authors":"Gong Zhang, Lawrence Chiu, Clem Dickey, Ling Liu, P. Muench, S. Seshadri","doi":"10.1109/MSST.2010.5496999","DOIUrl":"https://doi.org/10.1109/MSST.2010.5496999","url":null,"abstract":"The significant IO improvements of Solid State Disks (SSD) over traditional rotational hard disks makes it an attractive approach to integrate SSDs in tiered storage systems for performance enhancement. However, to integrate SSD into multi-tiered storage system effectively, automated data migration between SSD and HDD plays a critical role. In many real world application scenarios like banking and supermarket environments, workload and IO profile present interesting characteristics and also bear the constraint of workload deadline. How to fully release the power of data migration while guaranteeing the migration deadline is critical to maximizing the performance of SSD-enabled multi-tiered storage system. In this paper, we present an automated, deadline-aware, lookahead migration scheme to address the data migration challenge. We analyze the factors that may impact on the performance of lookahead migration efficiency and develop a greedy algorithm to adaptively determine the optimal lookahead window size to optimize the effectiveness of lookahead migration, aiming at improving overall system performance and resource utilization while meeting workload deadlines. We compare our lookahead migration approach with the basic migration model and validate the effectiveness and efficiency of our adaptive lookahead migration approach through a trace driven experimental study.","PeriodicalId":350968,"journal":{"name":"2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114024570","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}

引用次数: 33

S2-RAID: A new RAID architecture for fast data recovery S2-RAID:一种新的RAID架构，实现快速数据恢复

2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2010-05-01 DOI: 10.1109/MSST.2010.5496980

Ji-guang Wan, Jibin Wang, Qing Yang, C. Xie

{"title":"S2-RAID: A new RAID architecture for fast data recovery","authors":"Ji-guang Wan, Jibin Wang, Qing Yang, C. Xie","doi":"10.1109/MSST.2010.5496980","DOIUrl":"https://doi.org/10.1109/MSST.2010.5496980","url":null,"abstract":"As disk volume grows rapidly with terabyte disk becoming a norm, RAID reconstruction time in case of a failure takes prohibitively long time. This paper presents a new RAID architecture, S2-RAID, allowing the disk array to reconstruct very quickly in case of a disk failure. The idea is to form skewed sub RAIDs (S2-RAID) in the RAID structure so that reconstruction can be done in parallel dramatically speeding up data reconstruction time and hence minimizing the chance of data loss. To make such parallel reconstruction conflict-free, each sub-RAID is formed by selecting one logic partition from each disk group with size being a prime number. We have implemented a prototype S2-RAID system in Linux operating system for the purpose of evaluating its performance potential. SPC IO traces and standard benchmarks have been used to measure the performance of S2-RAID as compared to existing baseline software RAID, MD. Experimental results show that our new S2-RAID speeds up data reconstruction time by a factor of 3 to 6 compared to the traditional RAID. At the same time, S2-RAID shows similar or better production performance than baseline RAID while online RAID reconstruction is in progress.","PeriodicalId":350968,"journal":{"name":"2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502554","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}

引用次数: 16