2019 IEEE International Conference on Networking, Architecture and Storage (NAS)最新文献

筛选
英文 中文
NAS 2019 Copyright Page NAS 2019版权页
2019 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2019-08-01 DOI: 10.1109/nas.2019.8834709
{"title":"NAS 2019 Copyright Page","authors":"","doi":"10.1109/nas.2019.8834709","DOIUrl":"https://doi.org/10.1109/nas.2019.8834709","url":null,"abstract":"","PeriodicalId":230796,"journal":{"name":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123199679","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
NAS 2019 Program
2019 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2019-08-01 DOI: 10.1109/nas.2019.8834731
{"title":"NAS 2019 Program","authors":"","doi":"10.1109/nas.2019.8834731","DOIUrl":"https://doi.org/10.1109/nas.2019.8834731","url":null,"abstract":"","PeriodicalId":230796,"journal":{"name":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"136 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113970090","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
DV-NVLLC: Efficiently guaranteeing crash consistency in persistent memory via dynamic versioning DV-NVLLC:通过动态版本控制有效地保证持久内存中的崩溃一致性
2019 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2019-08-01 DOI: 10.1109/NAS.2019.8834719
Kai Tang, Wei Tong, Jun Ma, Bo Liu
{"title":"DV-NVLLC: Efficiently guaranteeing crash consistency in persistent memory via dynamic versioning","authors":"Kai Tang, Wei Tong, Jun Ma, Bo Liu","doi":"10.1109/NAS.2019.8834719","DOIUrl":"https://doi.org/10.1109/NAS.2019.8834719","url":null,"abstract":"Byte-addressable persistent memory provides fast access to persistent data, but problems such as system crashes and power failures may cause persistent data corruption. Though using traditional logging or copy-on-write(COW) can guarantee crash consistency, it results in extra storage and performance overheads, and also shortens the lifetime of persistent memory. To reduce the overhead caused by logging and COW, existing mechanisms ensure consistency by leveraging the different versions of data in a non-volatile CPU cache(NV cache) and persistent memory. However, the performance loss is still significant compared with the system that does not enforce crash consistency. To improve the performance, we analyze the overheads of memory transactions quantitatively, including the access pattern of cache and the asymmetry of read and write of persistent memory media. Based on our analysis, we propose DV-NVLLC which uses the NV cache as the last-level cache(NV-LLC). In NVLLC the dynamic versioning method is used to manage different versions of data based on their update frequency. Hot data is updated-of-place in NV-LLC. Cold data is updated by version control between NV-LLC and persistent memory. Therefore, DV-NVLLC can reduce write traffic to persistent memory while guaranteeing crash consistency. Our evaluation shows that DV-NVLLC improves performance by 18% to 57%, and reduces write traffic to persistent memory by 35% to 89% compared with the state-of-the-art design that uses NV cache as the last-level cache.","PeriodicalId":230796,"journal":{"name":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132387966","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
Latency Fairness Scheduling for Shared Storage Systems 共享存储系统时延公平调度
2019 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2019-08-01 DOI: 10.1109/NAS.2019.8834732
Yuhan Peng, Qingyue Liu, P. Varman
{"title":"Latency Fairness Scheduling for Shared Storage Systems","authors":"Yuhan Peng, Qingyue Liu, P. Varman","doi":"10.1109/NAS.2019.8834732","DOIUrl":"https://doi.org/10.1109/NAS.2019.8834732","url":null,"abstract":"Providing latency support is an important problem for clustered storage systems. In this paper, we present Fair-EDF, a framework for latency guarantees in shared storage servers. It provides fairness control while supporting latency guarantees. Fair-EDF extends the pure earliest deadline first (EDF) scheduler by adding a controller to shape the workloads. Under overload it selects a minimal number of requests to drop and to choose the dropped requests in a fair manner. The evaluation results show Fair-EDF provides steady fairness control among a set of clients with different runtime behaviors.","PeriodicalId":230796,"journal":{"name":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131840496","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
Per-File Secure Deletion for Flash-Based Solid State Drives 基于flash的固态硬盘逐文件安全删除
2019 IEEE International Conference on Networking, Architecture and Storage (NAS) Pub Date : 2019-08-01 DOI: 10.1109/NAS.2019.8834725
Tianran Xiao, Wei Tong, Xia Lei, Jingning Liu, Bo Liu
{"title":"Per-File Secure Deletion for Flash-Based Solid State Drives","authors":"Tianran Xiao, Wei Tong, Xia Lei, Jingning Liu, Bo Liu","doi":"10.1109/NAS.2019.8834725","DOIUrl":"https://doi.org/10.1109/NAS.2019.8834725","url":null,"abstract":"File update operations generate many invalid flash pages in Solid State Drives (SSDs) because of the-of-place update feature. If these invalid flash pages are not securely deleted, they will be left in the “missing” state, resulting in leakage of sensitive information. However, deleting these invalid pages in real time greatly reduces the performance of SSD. In this paper, we propose a Per-File Secure Deletion (PSD) scheme for SSD to achieve non-real-time secure deletion. PSD assigns a globally unique identifier (GUID) to each file to quickly locate the invalid data blocks and uses Security-TRIM command to securely delete these invalid data blocks. Moreover, we propose a PSD-MLC scheme for Multi-Level Cell (MLC) flash memory. PSD-MLC distributes the data blocks of a file in pairs of pages to avoid the influence of programming crosstalk between paired pages. We evaluate our schemes on different hardware platforms of flash media, and the results prove that PSD and PSD-MLC only have little impact on the performance of SSD. When the cache is disabled and enabled, compared with the system without the secure deletion, PSD decreases SSD throughput by 1.3% and 1.8%, respectively. PSD-MLC decreases SSD throughput by 9.5% and 10.0%, respectively.","PeriodicalId":230796,"journal":{"name":"2019 IEEE International Conference on Networking, Architecture and Storage (NAS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133831370","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学术文献互助群
群 号:481959085
Book学术官方微信