Zobrazeno 1 - 10
of 24
pro vyhledávání: '"Zhihu Tan"'
Autor:
ZHONGHUA WANG, CHEN DING, FENGGUANG SONG, KAI LU, JIGUANG WAN, ZHIHU TAN, CHANGSHENG XIE, GUOKUAN LI
Publikováno v:
ACM Transactions on Architecture & Code Optimization; Jun2024, Vol. 21 Issue 2, p1-25, 25p
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 33:4339-4352
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb77ec09a5d4820bdf6e0fb98aa38956
https://doi.org/10.1109/tpds.2022.3188268
https://doi.org/10.1109/tpds.2022.3188268
Publikováno v:
Proceedings of the 13th Symposium on Cloud Computing.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5107e8db913d0d54c53c38fcca721c3
https://doi.org/10.1145/3542929.3563479
https://doi.org/10.1145/3542929.3563479
Publikováno v:
2022 IEEE 40th International Conference on Computer Design (ICCD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::82a569a62a12baef65689fb4c8e88f50
https://doi.org/10.1109/iccd56317.2022.00036
https://doi.org/10.1109/iccd56317.2022.00036
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39:909-921
3-D triple-level cell (3-D TLC) NAND flash has high storage density and capacity, but degrading data reliability due to high raw bit error rates induced by a certain number of program/erase cycles. To guarantee data reliability, low-density parity-ch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fe389621e6345f102868e29b04dff17
https://doi.org/10.1109/tcad.2019.2897706
https://doi.org/10.1109/tcad.2019.2897706
Autor:
PENG XU, NANNAN ZHAO, JIGUANG WAN, WEI LIU, SHUNING CHEN, YUANHUI ZHOU, HADEEL ALBAHAR, HANYANG LIU, LIU TANG, ZHIHU TAN
Publikováno v:
ACM Transactions on Architecture & Code Optimization; Sep2022, Vol. 19 Issue 3, p1-26, 26p
Publikováno v:
Journal of the Chinese Institute of Engineers. 38:938-946
The performance of flash memory is limited by its “erase-before-write,” and erase operations can only be performed in a much larger unit than write operations. To address these problems, we propose an efficient flash translation layer scheme call
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40df030970f48b860c26cdc98322d97f
https://doi.org/10.1080/02533839.2015.1037353
https://doi.org/10.1080/02533839.2015.1037353
Publikováno v:
Canadian Journal of Electrical and Computer Engineering. 37:113-122
The copy-on-write update policy is a powerful technique for data protection. Unfortunately, it introduces a recursive update problem, which causes several side effects to a storage system, such as WRITE amplification and performance degradation. This
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef1033c9c5c2fb3e7146f2bbe2fa2bbe
https://doi.org/10.1109/cjece.2014.2325568
https://doi.org/10.1109/cjece.2014.2325568
Publikováno v:
International Journal of Computer Mathematics. 91:403-433
There is a notable characteristic of the data access pattern: 80% I/O requests only access 20% data. This feature brings about the concept of hotspot data, which refer to the data in the most frequent requested area. The access to these hotspot data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c28be0d793cb77c91cc605d6185b4e0
https://doi.org/10.1080/00207160.2013.804512
https://doi.org/10.1080/00207160.2013.804512
A reliability optimization method for RAID-structured storage systems based on active data migration
Publikováno v:
Journal of Systems and Software. 86:468-484
Highlights? We allocate reserved space in every disk. ? We arrange to redirect the data in the non-repairable sectors to the reserved space. ? We copy data of the unreliable disk to a new one when disk is in poor reliability. ? Data migration can avo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b95c7bc12f443d1398d5e369390ac755
https://doi.org/10.1016/j.jss.2012.09.023
https://doi.org/10.1016/j.jss.2012.09.023