![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Hu Wan 0001
Person information
- affiliation (since 2017): City University of Hong Kong, Hong Kong, China
- affiliation (2009-2017): Capital Normal University, Beijing, China
- unicode name: 万虎
Other persons with the same name
- Hu Wan 0002
— Huazhong University of Science and Technology, Institute of Systems Engineering, Wuhan, China
- Hu Wan 0003 — Sichuan University, Department of Computer Science, Chengdu, China
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Jinheng Li
, Qiao Li
, Hu Wan
, Chun Jason Xue
:
Binary Folding Compression for Efficient Software Distribution. SAC 2024: 169-176 - 2023
- [j3]Shuhan Bai
, Hu Wan
, Yun Huang
, Xuan Sun
, Fei Wu
, Changsheng Xie
, Hung-Chih Hsieh
, Tei-Wei Kuo
, Chun Jason Xue
:
Pipette: Efficient Fine-Grained Reads for SSDs. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(12): 4721-4734 (2023) - 2022
- [c9]Shuhan Bai
, Hu Wan
, Yun Huang
, Xuan Sun
, Fei Wu, Changsheng Xie, Hung-Chih Hsieh, Tei-Wei Kuo
, Chun Jason Xue:
Pipette: efficient fine-grained reads for SSDs. DAC 2022: 385-390 - [c8]Xuan Sun
, Hu Wan
, Qiao Li
, Chia-Lin Yang, Tei-Wei Kuo
, Chun Jason Xue:
RM-SSD: In-Storage Computing for Large-Scale Recommendation Inference. HPCA 2022: 1056-1070 - 2021
- [c7]Hu Wan
, Xuan Sun
, Yufei Cui
, Chia-Lin Yang, Tei-Wei Kuo
, Chun Jason Xue:
FlashEmbedding: storing embedding tables in SSD for large-scale recommender systems. APSys 2021: 9-16
2010 – 2019
- 2018
- [j2]Zeyi Hou, Hu Wan, Yuanchao Xu:
NMST: 一种基于线段树的持久性内存管理优化方法 (NMST: A Persistent Memory Management Optimization Approach Based on Segment Tree). 计算机科学 45(7): 78-83 (2018) - [c6]Hu Wan
, Fuyang Li
, Zimeng Zhou, Kaisheng Zeng, Jianhua Li, Chun Jason Xue:
NVLH: Crash-Consistent Linear Hashing for Non-Volatile Memory. NVMSA 2018: 117-118 - 2017
- [c5]Yuanchao Xu, Zeyi Hou, Junfeng Yan, Lu Yang, Hu Wan:
i-BEP: A non-redundant and high-concurrency memory persistency model. DATE 2017: 618-621 - [c4]Kaisheng Zeng, Youyou Lu, Hu Wan, Jiwu Shu:
Efficient storage management for aged file systems on persistent memory. DATE 2017: 1769-1774 - 2016
- [j1]Yuanchao Xu, Hu Wan, Keni Qiu, Tao Li, Weigong Zhang:
Reducing Synchronization Cost for Single-Level Store in Mobile Systems. J. Comput. Sci. Technol. 31(4): 836-848 (2016) - [c3]Yuanchao Xu, Hu Wan, Zeyi Hou, Keni Qiu:
Mitigating sync overhead in single-level store systems. Conf. Computing Frontiers 2016: 188-196 - [c2]Hu Wan, Youyou Lu, Yuanchao Xu, Jiwu Shu:
Empirical study of redo and undo logging in persistent memory. NVMSA 2016: 1-6 - 2015
- [c1]Yuanchao Xu, Hu Wan, Lingjun Fan, Junfeng Yan:
Rethinking manycore caches for scale-out applications. IGSC 2015: 1-6
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint