Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Fangliang Xu"'
Publikováno v:
Sensors, Vol 23, Iss 23, p 9340 (2023)
Cell models are one of the most widely used basic models in biological research, and a variety of in vitro cell culture techniques and models have been developed recently to simulate the physiological microenvironment in vivo. However, regardless of
Externí odkaz:
https://doaj.org/article/077eab5d626a4db09219ec7ca4d0007e
Publikováno v:
Future Generation Computer Systems. 102:494-506
Nowadays, cross-datacenter storage is widely used because of its high disaster-tolerance. Moreover, the erasure code is gradually being applied to cross-datacenter storage since it offers the same reliability as replication with a significant decreas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::992bad8dc804770cea9055c512d015ac
https://doi.org/10.1016/j.future.2019.08.027
https://doi.org/10.1016/j.future.2019.08.027
Publikováno v:
Computers & Security. 123:102915
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ab3beddc1dd7d7a8c7f283d11f562dc
https://doi.org/10.1016/j.cose.2022.102915
https://doi.org/10.1016/j.cose.2022.102915
Publikováno v:
Future Generation Computer Systems. 87:527-537
As a storage efficient approach, erasure coding has been adopted by many large-scale cloud storage systems to protect data from server and datacenter failures. To erasure-coded storage systems, it is critical to encode newly written data blocks and g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bb020c5df9b029cb6cefc9d9ef19a886
https://doi.org/10.1016/j.future.2018.04.047
https://doi.org/10.1016/j.future.2018.04.047
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 29:1893-1906
Erasure coding has received considerable attentions due to the better tradeoff between the space efficiency and reliability. The frequent update of the stored data in the distributed storage systems has posed a new challenge for erasure codes: how to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d34c6a805e00844ee7a8a598ed22cf10
https://doi.org/10.1109/tpds.2017.2717981
https://doi.org/10.1109/tpds.2017.2717981
Publikováno v:
Future Generation Computer Systems. 69:24-40
Distributed storage systems usually adopt erasure coding to achieve better tradeoff between the space efficiency and the data reliability. In-place updates are often used to overwrite the existing data rather than append the new data so as to ensure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::180763bda91a0644cd0c85d20e390082
https://doi.org/10.1016/j.future.2016.10.016
https://doi.org/10.1016/j.future.2016.10.016
Publikováno v:
Concurrency and Computation: Practice and Experience. 28:1437-1461
Repairs of multiple failures in distributed storage systems have posed the challenges for erasure coding: how to minimize the repair time with the least extra repair network traffic cost. However, existing repair schemes designed for single failure s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0d0d1c2775438db28f8bb368bd90c8a
https://doi.org/10.1002/cpe.3664
https://doi.org/10.1002/cpe.3664
Publikováno v:
Trustcom/BigDataSE/ISPA
Distributed storage systems usually adopt erasure codes to ensure the data reliability due to the better space efficiency and higher reliability. However, existing data insertion schemes for erasure codes are not appropriate for the continuous online
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c63e9257795949cdc352c4258ea7180
https://doi.org/10.1109/trustcom.2016.0189
https://doi.org/10.1109/trustcom.2016.0189
Publikováno v:
INFOCOM
Erasure coding has received considerable attention due to the better tradeoff between the space efficiency and reliability. However, it consumes large network traffic and long time to complete the update, involving updates of both data nodes and pari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c76a7cc16f49e8e0906782f52482c11
https://doi.org/10.1109/infocom.2016.7524347
https://doi.org/10.1109/infocom.2016.7524347
Publikováno v:
Concurrency and Computation: Practice and Experience. 31:e5031
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c36c57e6f276eb1ea0043a3b9c10776f
https://doi.org/10.1002/cpe.5031
https://doi.org/10.1002/cpe.5031