2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)最新文献

筛选
英文 中文
REAL: A retention error aware LDPC decoding scheme to improve NAND flash read performance REAL:一种可感知保留错误的LDPC解码方案,用于提高NAND闪存读取性能
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897085
Meng Zhang, Fei Wu, Xubin He, Ping Huang, Shunzhuo Wang, C. Xie
{"title":"REAL: A retention error aware LDPC decoding scheme to improve NAND flash read performance","authors":"Meng Zhang, Fei Wu, Xubin He, Ping Huang, Shunzhuo Wang, C. Xie","doi":"10.1109/MSST.2016.7897085","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897085","url":null,"abstract":"Continuous technology scaling makes NAND flash cells much denser. As a result, NAND flash is becoming more prone to various interference errors. Due to the hardware circuit design mechanisms of NAND flash, retention errors have been recognized as the most dominant errors, which affect the data reliability and flash lifetime. Furthermore, after experiencing a large number of programm/erase (P/E) cycles, flash memory would suffer a much higher error rate, rendering traditional ECC codes (typically BCH codes) insufficient to ensure data reliability. Therefore, low density parity check (LDPC) codes with stronger error correction capability are used in NAND flash-based storage devices. However, directly using LDPC codes with belief propagation (BP) decoding algorithm introduces non-trivial overhead of decoding latency and hence significantly degrades the read performance of NAND flash. It has been observed that flash retention errors show the so-called numerical-correlation characteristic (i.e., the 0–1 bits stored in the flash cell affect each other with the leakage of the charge) in each flash cell. In this paper, motivated by the observed characteristic, we propose REAL: a retention error aware LDPC decoding scheme to improve NAND flash read performance. The developed REAL scheme incorporates the numerical-correlation characteristic of retention errors into the process of LDPC decoding, and leverages the characteristic as additional bits decision information to improve its error correction capabilities and decrease the decoding latency. Our simulation results show that the proposed REAL scheme can reduce the LDPC decoding latency by 26.44% and 33.05%, compared with the Logarithm Domain Min-Sum (LD-MS) and Probability Domain BP (PD-BP) schemes, respectively.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114733859","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}
引用次数: 34
Reducing write amplification of flash storage through Cooperative Data Management with NVM 通过与NVM的协同数据管理减少闪存的写放大
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1145/3060146
Eunji Lee, Julie Kim, H. Bahn, S. Noh
{"title":"Reducing write amplification of flash storage through Cooperative Data Management with NVM","authors":"Eunji Lee, Julie Kim, H. Bahn, S. Noh","doi":"10.1145/3060146","DOIUrl":"https://doi.org/10.1145/3060146","url":null,"abstract":"Write amplification is a critical factor that limits the stable performance of flash-based storage systems. To reduce write amplification, this paper presents a new technique that cooperatively manages data in flash storage and nonvolatile memory (NVM). Our scheme basically considers NVM as the cache of flash storage, but allows the original data in flash storage to be invalidated if there is a cached copy in NVM, which can temporarily serve as the original data. This scheme eliminates the copy-out operation for a substantial number of cached data, thereby enhancing garbage collection efficiency. Experimental results show that the proposed scheme reduces the copy-out overhead of garbage collection by 51.4% and decreases the standard deviation of response time by 35.4% on average.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132188676","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}
引用次数: 36
Understanding I/O performance behaviors of cloud storage from a client's perspective 从客户端的角度理解云存储的I/O性能行为
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1145/3078838
Binbing Hou, Feng Chen, Zhonghong Ou, Ren Wang, M. Mesnier
{"title":"Understanding I/O performance behaviors of cloud storage from a client's perspective","authors":"Binbing Hou, Feng Chen, Zhonghong Ou, Ren Wang, M. Mesnier","doi":"10.1145/3078838","DOIUrl":"https://doi.org/10.1145/3078838","url":null,"abstract":"Cloud storage has gained increasing popularity in the past few years. In cloud storage, data is stored in the service provider's data centers, and users access data via the network. For such a new storage model, our prior wisdom about conventional storage may not remain valid nor applicable to the emerging cloud storage. In this paper, we present a comprehensive study and attempt to gain insight into the unique characteristics of cloud storage, primarily from the client's perspective. Through extensive experiments and quantitative analysis, we have acquired several interesting, and in some cases unexpected, findings. (1) Parallelizing I/Os and increasing request sizes are keys to improving the performance, but optimal bandwidth may only be achieved with a proper combination of parallelism and request size. (2) Client capabilities, including CPU, memory, and storage, play an unexpectedly important role in determining the achievable performance. (3) A geographically long distance affects client-perceived performance but does not always result in lower bandwidth and longer latency. Based on our experimental studies, we further present a case study on appropriate chunking and parallelization in a cloud storage client. Our studies show that specific attention should be paid to fully exploiting the capabilities of clients and the great potential of cloud storage services.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132578807","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}
引用次数: 20
An Overlay File System for cloud-assisted mobile applications 用于云辅助移动应用程序的覆盖文件系统
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897093
Jianchen Shan, N. R. Paiker, Xiaoning Ding, N. Gehani, Reza Curtmola, C. Borcea
{"title":"An Overlay File System for cloud-assisted mobile applications","authors":"Jianchen Shan, N. R. Paiker, Xiaoning Ding, N. Gehani, Reza Curtmola, C. Borcea","doi":"10.1109/MSST.2016.7897093","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897093","url":null,"abstract":"With cloud assistance, a mobile application can offload its resource-demanding computation tasks to the cloud (public cloud, cloudlet, or personal cloud, etc). This leads to a scenario where computation tasks in the same application run concurrently on both the mobile device and the cloud. These tasks need to save, read, and write files on both the mobile device and the cloud. An important challenge is to ensure that the tasks are able to access and share the files in a manner that is efficient, consistent, and transparent to locations. The paper addresses this issue by designing an application-level file system called Overlay File System (OFS). To improve efficiency, OFS maintains and buffers local copies of data sets on both the cloud and the mobile device. OFS ensures consistency and guarantees that all the reads get the latest data. It combines write-invalidate and write-update policies to effectively reduce the network traffic incurred by invalidating/updating stale data copies and to reduce the application delay when the latest data cannot be accessed locally. To guarantee location transparency, OFS creates an unified view of the data that is location independent and is accessible as local storage. Our experiments show that OFS can effectively support task offloading and efficient execution of offloaded tasks by significantly decreasing both file access latency and network traffic incurred by file accesses.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131285362","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
Effects of prolonged media usage and long-term planning on archival systems 长期使用媒体和长期规划对档案系统的影响
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897083
Preeti Gupta, Avani Wildani, E. L. Miller, D. Rosenthal, D. Long
{"title":"Effects of prolonged media usage and long-term planning on archival systems","authors":"Preeti Gupta, Avani Wildani, E. L. Miller, D. Rosenthal, D. Long","doi":"10.1109/MSST.2016.7897083","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897083","url":null,"abstract":"In archival systems, storage media are often replaced much earlier than their expected service life in exchange for other benefits of new media, such as higher capacity, bandwidth, and I/O operations per second, or lower costs. In an era of decreasing media density growth rates, retiring media early by considering only short-term benefits while discarding potential long-term cost benefits could have a negative long-term impact on an archival system's economics. To extend an archival system's life, at low cost, while limiting performance degradation, we suggest extending media lifetime past manufacturer recommendations as well as increasing the horizon for planning and provisioning future media purchases. We present a cost-benefit analysis of the impact of prolonged media usage and long-term planning. Through Monte Carlo simulation, we simulate the behavior of an archival system using tapes, hard disk drives (HDDs), solid state devices (SSDs), and Blu-ray discs. We show that leaving older media in the archival system makes economic sense for SSDs without significantly affecting reliability; we show cost improvements of approximately 10% for SSDs for a low annual media density growth rate, such as 5%, which would have been a loss of 35%, for a high annual media density rate, such as 20%. We show that, for SSDs and hard disks, the optimal planning time of an archival system is at least as long as the media service life. Combining prolonged media usage with an extended planning horizon reduced costs by 15% for a system using SSDs.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116484969","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
A long-term user-centric analysis of deduplication patterns 以用户为中心的重复数据删除模式的长期分析
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897080
Zhen Sun, G. Kuenning, Sonam Mandal, Philip Shilane, Vasily Tarasov, Nong Xiao, E. Zadok
{"title":"A long-term user-centric analysis of deduplication patterns","authors":"Zhen Sun, G. Kuenning, Sonam Mandal, Philip Shilane, Vasily Tarasov, Nong Xiao, E. Zadok","doi":"10.1109/MSST.2016.7897080","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897080","url":null,"abstract":"Deduplication has become essential in disk-based backup systems, but there have been few long-term studies of backup workloads. Most past studies either were of a small static snapshot or covered only a short period that was not representative of how a backup system evolves over time. For this paper, we collected 21 months of data from a shared user file system; 33 users and over 4,000 snapshots are covered. We analyzed the data set for a variety of essential characteristics. However, our primary focus was individual user data. Despite apparently similar roles and behavior in all of our users, we found significant differences in their deduplication ratios. Moreover, the data that some users share with others had a much higher deduplication ratio than average. We analyze this behavior and make recommendations for future deduplication systems design.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"18 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132913746","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}
引用次数: 37
Manylogs: Improved CMR/SMR disk bandwidth and faster durability with scattered logs 多日志:提高了CMR/SMR磁盘带宽和分散日志的更快持久性
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897075
Tiratat Patana-anake, V. Martin, Nora Sandler, Cheng Wu, Haryadi S. Gunawi
{"title":"Manylogs: Improved CMR/SMR disk bandwidth and faster durability with scattered logs","authors":"Tiratat Patana-anake, V. Martin, Nora Sandler, Cheng Wu, Haryadi S. Gunawi","doi":"10.1109/MSST.2016.7897075","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897075","url":null,"abstract":"We introduce manylogs, a simple and novel concept of logging that deploys many scattered logs on disk such that small random writes can be appended into any log near the current disk head position (e.g., the location of last large I/O). The benefit is two-fold: the small writes attain fast durability while the large I/Os still sustain large bandwidth.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"23 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125891365","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
Lazy exact deduplication 惰性精确重复数据删除
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1145/3078837
Jingwei Ma, Rebecca J. Stones, Yuxiang Ma, Jingui Wang, Junjie Ren, G. Wang, X. Liu
{"title":"Lazy exact deduplication","authors":"Jingwei Ma, Rebecca J. Stones, Yuxiang Ma, Jingui Wang, Junjie Ren, G. Wang, X. Liu","doi":"10.1145/3078837","DOIUrl":"https://doi.org/10.1145/3078837","url":null,"abstract":"During data deduplication, on-disk fingerprint lookups lead to high disk traffic, resulting in a bottleneck. In this paper, we propose a “lazy” data deduplication method which buffers incoming fingerprints and performs on-disk lookups in batches, aiming to reduce the disk bottleneck. In deduplication in general, prefetching is used to improve the cache hit rate by exploiting locality within the incoming fingerprint stream. For lazy deduplication, we design a buffering strategy that preserves locality in order to similarly facilitate prefetching. Experimental results indicate that the lazy method improves fingerprint identification performance by over 50% compared with an “eager” method with the same data layout","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123995446","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
Fast and failure-consistent updates of application data in non-volatile main memory file system 在非易失性主存文件系统中快速和故障一致地更新应用程序数据
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897078
Jiaxin Ou, J. Shu
{"title":"Fast and failure-consistent updates of application data in non-volatile main memory file system","authors":"Jiaxin Ou, J. Shu","doi":"10.1109/MSST.2016.7897078","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897078","url":null,"abstract":"Modern applications have their own update protocols to remain failure consistency. However, these protocols are implemented without a comprehensive understanding of the persistence properties of the underlying file systems and typically optimized for disk-based storage. As a result, they are complex, error-prone, and exhibit disappointing performance on emerging fast non-volatile memories (NVMs) due to excessive data copies.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130911112","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
Impact of data placement on resilience in large-scale object storage systems 大规模对象存储系统中数据放置对弹性的影响
2016 32nd Symposium on Mass Storage Systems and Technologies (MSST) Pub Date : 2016-05-02 DOI: 10.1109/MSST.2016.7897091
P. Carns, K. Harms, John Jenkins, M. Mubarak, R. Ross, C. Carothers
{"title":"Impact of data placement on resilience in large-scale object storage systems","authors":"P. Carns, K. Harms, John Jenkins, M. Mubarak, R. Ross, C. Carothers","doi":"10.1109/MSST.2016.7897091","DOIUrl":"https://doi.org/10.1109/MSST.2016.7897091","url":null,"abstract":"Distributed object storage architectures have become the de facto standard for high-performance storage in big data, cloud, and HPC computing. Object storage deployments using commodity hardware to reduce costs often employ object replication as a method to achieve data resilience. Repairing object replicas after failure is a daunting task for systems with thousands of servers and billions of objects, however, and it is increasingly difficult to evaluate such scenarios at scale on real-world systems. Resilience and availability are both compromised if objects are not repaired in a timely manner. In this work we leverage a high-fidelity discrete-event simulation model to investigate replica reconstruction on large-scale object storage systems with thousands of servers, billions of objects, and petabytes of data. We evaluate the behavior of CRUSH, a well-known object placement algorithm, and identify configuration scenarios in which aggregate rebuild performance is constrained by object placement policies. After determining the root cause of this bottleneck, we then propose enhancements to CRUSH and the usage policies atop it to enable scalable replica reconstruction. We use these methods to demonstrate a simulated aggregate rebuild rate of 410 GiB/s (within 5% of projected ideal linear scaling) on a 1,024-node commodity storage system. We also uncover an unexpected phenomenon in rebuild performance based on the characteristics of the data stored on the system.","PeriodicalId":299251,"journal":{"name":"2016 32nd Symposium on Mass Storage Systems and Technologies (MSST)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123898202","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
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学术文献互助群
群 号:481959085
Book学术官方微信