发布求助
文献互助 智能选刊 最新文献

Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems最新文献

筛选
英文 中文
Infusing pub-sub storage with transactions 向发布-子存储中注入事务
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539739
Liana V. Rodriguez, John Bent, Tim Shaffer, R. Rangaswami
{"title":"Infusing pub-sub storage with transactions","authors":"Liana V. Rodriguez, John Bent, Tim Shaffer, R. Rangaswami","doi":"10.1145/3538643.3539739","DOIUrl":"https://doi.org/10.1145/3538643.3539739","url":null,"abstract":"The need to support new features in existing storage systems is an ongoing concern for storage developers. So is the desire to develop next generation storage systems that can adopt newly developed feature improvements with relative ease. Extending storage systems is challenging because of the inherent complexity of their codebases and the need to ensure that the storage state does not become corrupt or inconsistent when enabling new features. In this work, we examine a new storage architecture, FDMI, that uses the well-established publish-subscribe model for extending the feature set of a host storage system using plugins. A central mechanism in FDMI is transactional coupling. With transactional coupling, the subscribed plugin can either create new transactions that execute asynchronously following the successful completion of the precipitating event or can participate in the pending transaction and control whether the precipitating event itself will or will not be committed. We further create a classification of transactional mechanisms as well as possible desired plugin functionality and explore the matrix of these two classifications to create a new model for faster, safer distributed storage development.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129759165","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
ScalaRAID ScalaRAID
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539740
Shushu Yi, Yanning Yang, Yunxiao Tang, Zixuan Zhou, Junzhe Li, Chen Yue, Myoungsoo Jung, Jie Zhang
{"title":"ScalaRAID","authors":"Shushu Yi, Yanning Yang, Yunxiao Tang, Zixuan Zhou, Junzhe Li, Chen Yue, Myoungsoo Jung, Jie Zhang","doi":"10.1145/3538643.3539740","DOIUrl":"https://doi.org/10.1145/3538643.3539740","url":null,"abstract":"RAID has been widely adopted to enhance the performance, capacity, and reliability of the existing storage systems. However, we observe that the Linux software RAID (mdraid) suffers from its poor implementation of the lock mechanism. To address this, we propose ScalaRAID, which refines the role domain of locks and designs a new data structure to prevent different threads from preempting the RAID resources. By doing so, ScalaRAID can maximize the thread-level parallelism and reduce the time consumption of I/O request handling. Our evaluation results reveal that ScalaRAID can improve throughput by 89.4% while decreasing 99.99th percentile latency by 85.4% compared to mdraid.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134038858","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
File fragmentation from the perspective of I/O control 从I/O控制的角度看文件碎片
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539746
Jonggyu Park, Y. Eom
{"title":"File fragmentation from the perspective of I/O control","authors":"Jonggyu Park, Y. Eom","doi":"10.1145/3538643.3539746","DOIUrl":"https://doi.org/10.1145/3538643.3539746","url":null,"abstract":"File fragmentation has been widely studied for several decades due to its detrimental effects on I/O activities. However, most of the previous research focuses on its performance aspect in a single application. In this paper, we analyze the effect of fragmentation on I/O control in a consolidated system where multiple applications run simultaneously. Our evaluation demonstrates that all of the weight-based I/O control mechanisms supported by the Linux kernel fail to achieve fair I/O sharing for different reasons when they meet fragmentation. Also, we show that defragmentation can promptly antidote such failures by preventing request splitting and device-level resource conflicts.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115229376","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}
引用次数: 1
LambdaObjects
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539751
Kai Mast, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
{"title":"LambdaObjects","authors":"Kai Mast, A. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau","doi":"10.1145/3538643.3539751","DOIUrl":"https://doi.org/10.1145/3538643.3539751","url":null,"abstract":"Existing cloud computing (or serverless) architectures provide convenient abstractions for application developers, but exhibit high latencies and do not support strong consistency guarantees. These limitations stem not only from the overheads due to virtualization, but also because storage and compute layers are disaggregated. We introduce LAMBDAOBJECTS; a new abstraction for server-less systems where data and compute are co-located. Data is encapsulated into objects, each associated with a set of methods that allow accessing and modifying the data. Functions then execute directly at the nodes the data is stored at. Our early results demonstrate that this architecture provides lower latencies, while sacrificing some elasticity offered by conventional serverless systems. In addition, LAMBDAOBJECTS provide strong consistency and enable efficient caching mechanisms and fault-tolerance with low overhead.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116533267","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
Generating realistic wear distributions for SSDs 为ssd生成真实的磨损分布
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539757
Ziyang Jiao, B. Kim
{"title":"Generating realistic wear distributions for SSDs","authors":"Ziyang Jiao, B. Kim","doi":"10.1145/3538643.3539757","DOIUrl":"https://doi.org/10.1145/3538643.3539757","url":null,"abstract":"We present FF-SSD, a machine learning-based SSD aging framework that generates representative future wear-out states. FF-SSD is accurate (up to 99% similarity), efficient (accelerates simulation time by 2×), and modular (can be integrated with existing simulators and emulators).","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133175762","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}
引用次数: 1
PiF: in-flash acceleration for data-intensive applications PiF:用于数据密集型应用程序的flash加速
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539742
Myoungjun Chun, Jae Yong Lee, Sanggu Lee, Myungsuk Kim, Jihong Kim
{"title":"PiF: in-flash acceleration for data-intensive applications","authors":"Myoungjun Chun, Jae Yong Lee, Sanggu Lee, Myungsuk Kim, Jihong Kim","doi":"10.1145/3538643.3539742","DOIUrl":"https://doi.org/10.1145/3538643.3539742","url":null,"abstract":"To minimize unnecessary data movements from storage to a host, processing-in-storage (PiS) techniques, which move a compute unit to storage, have been proposed. In this position paper, we propose an extreme version of PiS solutions, called a processing-in-flash (PiF) scheme, that moves computation inside flash chips where data are physically present. As a key building block of a PiF solution, we present a novel flash chip architecture, CoX. Using a prototype PiF SSD based on CoX chips, we demonstrate that PiF-based SSDs are promising in accelerating data-intensive applications.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"71 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120822783","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}
引用次数: 1
Alohomora
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539749
Sanggu Lee, Yoona Kim, Dusol Lee, In-Seok Choi, Jihong Kim
{"title":"Alohomora","authors":"Sanggu Lee, Yoona Kim, Dusol Lee, In-Seok Choi, Jihong Kim","doi":"10.1145/3538643.3539749","DOIUrl":"https://doi.org/10.1145/3538643.3539749","url":null,"abstract":"We propose a novel whitelist-based anti-ransomware solution called alohomora. Alohomora is based on our observation that an I/O activity of an application can be an effective abstraction level for managing I/O whitelisting. In alohomora, when a write request is sent to an SSD, its program context value (which is supported by a host CPU register) is passed to the SSD. The SSD checks if the request was pre-approved using the program context value, thus preventing ransomware from modifying files in the SSD. Our experimental results using a prototype alohomora system show that alohomora can achieve a strong security level against sophisticated ransomware attacks without degrading I/O performance.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115852461","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}
引用次数: 1
Cache-coherent accelerators for persistent memory crash consistency 用于持久内存崩溃一致性的缓存一致加速器
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539752
Ankit Bhardwaj, Todd Thornley, Vinita Pawar, Reto Achermann, Gerd Zellweger, Ryan Stutsman
{"title":"Cache-coherent accelerators for persistent memory crash consistency","authors":"Ankit Bhardwaj, Todd Thornley, Vinita Pawar, Reto Achermann, Gerd Zellweger, Ryan Stutsman","doi":"10.1145/3538643.3539752","DOIUrl":"https://doi.org/10.1145/3538643.3539752","url":null,"abstract":"Building persistent memory (PM) data structures is difficult because crashes interrupt operations, leaving data structures in an inconsistent state. Solving this requires augmenting code that modifies PM state to ensure that interrupted operations can be completed or undone. Today, this is done using careful, hand-crafted code, a compiler pass, or page faults. We propose a new, easy way to transform volatile data structure code to work with PM that uses a cache-coherent accelerator to do this augmentation, and we show that it may outperform existing approaches for building PM structures.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123146848","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
Lifetime-leveling LSM-tree compaction for ZNS SSD ZNS SSD终身级lsm树压缩
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539741
Jeeyoon Jung, Dongkun Shin
{"title":"Lifetime-leveling LSM-tree compaction for ZNS SSD","authors":"Jeeyoon Jung, Dongkun Shin","doi":"10.1145/3538643.3539741","DOIUrl":"https://doi.org/10.1145/3538643.3539741","url":null,"abstract":"The Log-Structured Merge (LSM) tree is considered well-suited to zoned namespace (ZNS) storage devices since the write requests to LSM-tree is sequential. However, zones can be partially invalidated and be fragmented during LSM-tree compaction. The partially-invalid zones cannot be utilized and thus space amplification becomes significant. To reclaim the invalid space, host-managed garbage collection (GC) is required, which increases the write amplification of ZNS storage and degrades I/O performance. We introduce a lifetime-leveling compaction (LL-compaction) tailored for ZNS SSD, which can alleviate space amplification without GC by making the sorted string tables in a zone have similar lifetimes. In our experiments using LevelDB, the LL-compaction achieved 1.7x better performance by removing GCs.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124724726","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}
引用次数: 9
Fair I/O scheduler for alleviating read/write interference by forced unit access in flash memory 公平I/O调度器，用于减轻由强制单元访问在闪存中的读/写干扰
Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems Pub Date : 2022-06-27 DOI: 10.1145/3538643.3539753
Jieun Kim, Dohyun Kim, Y. Won
{"title":"Fair I/O scheduler for alleviating read/write interference by forced unit access in flash memory","authors":"Jieun Kim, Dohyun Kim, Y. Won","doi":"10.1145/3538643.3539753","DOIUrl":"https://doi.org/10.1145/3538643.3539753","url":null,"abstract":"For the past few years, the enterprise Solid State Drives that employ NVM Express are widely used due to their high performance. It is common for multiple tenants and processes to share a single SSD. Providing fair SSD performance for multiple applications has become an important issue. We observe that the write request with FUA flag delays the processing of read request due to SSD internal read/write interference. To alleviate the performance degradation of the read requests, we propose TABS, per-Type fAir Bandwidth I/O Scheduler for NVMe SSDs. TABS determines the fair bandwidth proportional to the maximum bandwidth and I/O issue rate for each type of request. (i) Two-phase Dynamic Scheduling sets fairness goals dynamically according to the I/O patterns of workload. Then, it throttles the FUA write requests to meet the pre-measured fairness goal. (ii) Software-based feedback makes more accurate scheduling possible. By using these techniques, TABS can guarantee fairness between the read and FUA flagged write requests. Finally, compared with the fairness goals, TABS achieves 76% fairness on average and up to 99.5% fairness, while the noop scheduler, the default Linux scheduler, shows 18% fairness.","PeriodicalId":159120,"journal":{"name":"Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134011555","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
下一页 尾页
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学术官方微信