静态分配并非一成不变:通过提升静态策略优化固态硬盘地址分配

IF 5.6 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS IEEE Transactions on Parallel and Distributed Systems Pub Date : 2024-03-30 DOI:10.1109/TPDS.2024.3407367
Yang Zhou;Fang Wang;Zhan Shi;Dan Feng
{"title":"静态分配并非一成不变:通过提升静态策略优化固态硬盘地址分配","authors":"Yang Zhou;Fang Wang;Zhan Shi;Dan Feng","doi":"10.1109/TPDS.2024.3407367","DOIUrl":null,"url":null,"abstract":"The address allocation policy in SSD aims to translate the logical address of I/O requests into a physical address, and the static address allocation is widely used in modern SSD. Through extensive experiments, we find that there are significant differences in the utilization of SSD parallelism among different static address allocation policies. We also observe that the fixed address allocation design prevents SSDs from continuing to meet the challenges posed by cloud workloads and misses the possibility of further optimization. These situations stem from our excessive reliance on SSD parallelism over time. In this paper, we propose \n<monospace>HsaP</monospace>\n, a \n<underline>h</u>\nybrid \n<underline>s</u>\ntatic address \n<underline>a</u>\nllocation \n<underline>p</u>\nolicy, that adaptively chooses the best static allocation policy to meet the SSD performance at runtime. \n<monospace>HsaP</monospace>\n is a \n<italic>dynamic</i>\n scheduling scheme based on \n<italic>static</i>\n address allocation policy. The static policy ensures that \n<monospace>HsaP</monospace>\n has stable performance and light-weight overhead, while dynamic scheduling can effectively combine different allocation policies, selecting the best-performing static mapping mode for a given SSD state. Meanwhile, \n<monospace>HsaP</monospace>\n can further improve the read and write performance of SSDs simultaneously through plane reallocation and data rewrite. Experimental results show that \n<monospace>HsaP</monospace>\n achieves significant read and write performance gain of a wide range of the latest cloud block storage traces compared to several state-of-the-art address allocation approaches.","PeriodicalId":13257,"journal":{"name":"IEEE Transactions on Parallel and Distributed Systems","volume":"35 8","pages":"1373-1386"},"PeriodicalIF":5.6000,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Static Allocation is Not a Static: Optimizing SSD Address Allocation Through Boosting Static Policy\",\"authors\":\"Yang Zhou;Fang Wang;Zhan Shi;Dan Feng\",\"doi\":\"10.1109/TPDS.2024.3407367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The address allocation policy in SSD aims to translate the logical address of I/O requests into a physical address, and the static address allocation is widely used in modern SSD. Through extensive experiments, we find that there are significant differences in the utilization of SSD parallelism among different static address allocation policies. We also observe that the fixed address allocation design prevents SSDs from continuing to meet the challenges posed by cloud workloads and misses the possibility of further optimization. These situations stem from our excessive reliance on SSD parallelism over time. In this paper, we propose \\n<monospace>HsaP</monospace>\\n, a \\n<underline>h</u>\\nybrid \\n<underline>s</u>\\ntatic address \\n<underline>a</u>\\nllocation \\n<underline>p</u>\\nolicy, that adaptively chooses the best static allocation policy to meet the SSD performance at runtime. \\n<monospace>HsaP</monospace>\\n is a \\n<italic>dynamic</i>\\n scheduling scheme based on \\n<italic>static</i>\\n address allocation policy. The static policy ensures that \\n<monospace>HsaP</monospace>\\n has stable performance and light-weight overhead, while dynamic scheduling can effectively combine different allocation policies, selecting the best-performing static mapping mode for a given SSD state. Meanwhile, \\n<monospace>HsaP</monospace>\\n can further improve the read and write performance of SSDs simultaneously through plane reallocation and data rewrite. Experimental results show that \\n<monospace>HsaP</monospace>\\n achieves significant read and write performance gain of a wide range of the latest cloud block storage traces compared to several state-of-the-art address allocation approaches.\",\"PeriodicalId\":13257,\"journal\":{\"name\":\"IEEE Transactions on Parallel and Distributed Systems\",\"volume\":\"35 8\",\"pages\":\"1373-1386\"},\"PeriodicalIF\":5.6000,\"publicationDate\":\"2024-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Parallel and Distributed Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10542449/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Parallel and Distributed Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10542449/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

固态硬盘中的地址分配策略旨在将 I/O 请求的逻辑地址转换为物理地址,而静态地址分配在现代固态硬盘中得到了广泛应用。通过大量实验,我们发现不同静态地址分配策略对固态硬盘并行性的利用率存在显著差异。我们还发现,固定地址分配设计阻碍了固态硬盘继续应对云工作负载带来的挑战,并错失了进一步优化的可能性。这些情况都源于我们长期以来对固态硬盘并行性的过度依赖。在本文中,我们提出了混合静态地址分配策略HsaP,它能自适应地选择最佳静态分配策略,以满足运行时的固态硬盘性能。HsaP 是一种基于静态地址分配策略的动态调度方案。静态策略确保了 HsaP 性能稳定、开销轻巧,而动态调度能有效结合不同的分配策略,为给定的固态硬盘状态选择性能最佳的静态映射模式。同时,HsaP 还能通过平面重新分配和数据重写,进一步同时提高固态硬盘的读写性能。实验结果表明,与几种最先进的地址分配方法相比,HsaP 在各种最新的云块存储跟踪中实现了显著的读写性能提升。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Static Allocation is Not a Static: Optimizing SSD Address Allocation Through Boosting Static Policy
The address allocation policy in SSD aims to translate the logical address of I/O requests into a physical address, and the static address allocation is widely used in modern SSD. Through extensive experiments, we find that there are significant differences in the utilization of SSD parallelism among different static address allocation policies. We also observe that the fixed address allocation design prevents SSDs from continuing to meet the challenges posed by cloud workloads and misses the possibility of further optimization. These situations stem from our excessive reliance on SSD parallelism over time. In this paper, we propose HsaP , a h ybrid s tatic address a llocation p olicy, that adaptively chooses the best static allocation policy to meet the SSD performance at runtime. HsaP is a dynamic scheduling scheme based on static address allocation policy. The static policy ensures that HsaP has stable performance and light-weight overhead, while dynamic scheduling can effectively combine different allocation policies, selecting the best-performing static mapping mode for a given SSD state. Meanwhile, HsaP can further improve the read and write performance of SSDs simultaneously through plane reallocation and data rewrite. Experimental results show that HsaP achieves significant read and write performance gain of a wide range of the latest cloud block storage traces compared to several state-of-the-art address allocation approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems 工程技术-工程:电子与电气
CiteScore
11.00
自引率
9.40%
发文量
281
审稿时长
5.6 months
期刊介绍: IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers. Particular areas of interest include, but are not limited to: a) Parallel and distributed algorithms, focusing on topics such as: models of computation; numerical, combinatorial, and data-intensive parallel algorithms, scalability of algorithms and data structures for parallel and distributed systems, communication and synchronization protocols, network algorithms, scheduling, and load balancing. b) Applications of parallel and distributed computing, including computational and data-enabled science and engineering, big data applications, parallel crowd sourcing, large-scale social network analysis, management of big data, cloud and grid computing, scientific and biomedical applications, mobile computing, and cyber-physical systems. c) Parallel and distributed architectures, including architectures for instruction-level and thread-level parallelism; design, analysis, implementation, fault resilience and performance measurements of multiple-processor systems; multicore processors, heterogeneous many-core systems; petascale and exascale systems designs; novel big data architectures; special purpose architectures, including graphics processors, signal processors, network processors, media accelerators, and other special purpose processors and accelerators; impact of technology on architecture; network and interconnect architectures; parallel I/O and storage systems; architecture of the memory hierarchy; power-efficient and green computing architectures; dependable architectures; and performance modeling and evaluation. d) Parallel and distributed software, including parallel and multicore programming languages and compilers, runtime systems, operating systems, Internet computing and web services, resource management including green computing, middleware for grids, clouds, and data centers, libraries, performance modeling and evaluation, parallel programming paradigms, and programming environments and tools.
期刊最新文献
Ripple: Enabling Decentralized Data Deduplication at the Edge Balanced Splitting: A Framework for Achieving Zero-Wait in the Multiserver-Job Model EdgeHydra: Fault-Tolerant Edge Data Distribution Based on Erasure Coding Real Relative Encoding Genetic Algorithm for Workflow Scheduling in Heterogeneous Distributed Computing Systems DyLaClass: Dynamic Labeling Based Classification for Optimal Sparse Matrix Format Selection in Accelerating SpMV
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1