default search action
Runhui Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j6]Xiaolu Li, Zuoru Yang, Jinhong Li, Runhui Li, Patrick P. C. Lee, Qun Huang, Yuchong Hu:
Repair Pipelining for Erasure-coded Storage: Algorithms and Evaluation. ACM Trans. Storage 17(2): 13:1-13:29 (2021)
2010 – 2019
- 2019
- [c8]Xiaolu Li, Runhui Li, Patrick P. C. Lee, Yuchong Hu:
OpenEC: Toward Unified and Configurable Erasure Coding Management in Distributed Storage Systems. FAST 2019: 331-344 - [i2]Xiaolu Li, Zuoru Yang, Jinhong Li, Runhui Li, Patrick P. C. Lee, Qun Huang, Yuchong Hu:
Repair Pipelining for Erasure-Coded Storage: Algorithms and Evaluation. CoRR abs/1908.01527 (2019) - 2018
- [j5]Mingqiang Li, Runhui Li, Patrick P. C. Lee:
Relieving Both Storage and Recovery Burdens in Big Data Clusters with R-STAIR Codes. IEEE Internet Comput. 22(4): 15-26 (2018) - 2017
- [j4]Runhui Li, Yuchong Hu, Patrick P. C. Lee:
Enabling Efficient and Reliable Transition from Replication to Erasure Coding for Clustered File Systems. IEEE Trans. Parallel Distributed Syst. 28(9): 2500-2513 (2017) - [c7]Eman Ramadan, Arvind Narayanan, Zhi-Li Zhang, Runhui Li, Gong Zhang:
BIG Cache Abstraction for Cache Networks. ICDCS 2017: 742-752 - [c6]Qun Huang, Xin Jin, Patrick P. C. Lee, Runhui Li, Lu Tang, Yi-Chao Chen, Gong Zhang:
SketchVisor: Robust Network Measurement for Software Packet Processing. SIGCOMM 2017: 113-126 - [c5]Runhui Li, Xiaolu Li, Patrick P. C. Lee, Qun Huang:
Repair Pipelining for Erasure-Coded Storage. USENIX ATC 2017: 567-579 - 2015
- [j3]Runhui Li, Jian Lin, Patrick P. C. Lee:
Enabling Concurrent Failure Recovery for Regenerating-Coding-Based Storage Systems: From Theory to Practice. IEEE Trans. Computers 64(7): 1898-1911 (2015) - [c4]Runhui Li, Yuchong Hu, Patrick P. C. Lee:
Enabling Efficient and Reliable Transition from Replication to Erasure Coding for Clustered File Systems. DSN 2015: 148-159 - [c3]Runhui Li, Patrick P. C. Lee:
Making mapreduce scheduling effective in erasure-coded storage clusters. LANMAN 2015: 1-6 - 2014
- [j2]Silei Xu, Runhui Li, Patrick P. C. Lee, Yunfeng Zhu, Liping Xiang, Yinlong Xu, John C. S. Lui:
Single Disk Failure Recovery forX-Code-Based Parallel Storage Systems. IEEE Trans. Computers 63(4): 995-1007 (2014) - [c2]Runhui Li, Patrick P. C. Lee, Yuchong Hu:
Degraded-First Scheduling for MapReduce in Erasure-Coded Storage Clusters. DSN 2014: 419-430 - 2013
- [c1]Runhui Li, Jian Lin, Patrick P. C. Lee:
CORE: Augmenting regenerating-coding-based recovery for single and concurrent failures in distributed storage systems. MSST 2013: 1-6 - [i1]Runhui Li, Jian Lin, Patrick P. C. Lee:
CORE: Augmenting Regenerating-Coding-Based Recovery for Single and Concurrent Failures in Distributed Storage Systems. CoRR abs/1302.3344 (2013) - 2011
- [j1]Liping Xiang, Yinlong Xu, John C. S. Lui, Qian Chang, Yubiao Pan, Runhui Li:
A Hybrid Approach to Failed Disk Recovery Using RAID-6 Codes: Algorithms and Performance Evaluation. ACM Trans. Storage 7(3): 11:1-11:34 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint