default search action
Guangyu Zhu 0003
Person information
- affiliation: Chung-Ang University, School of Computer Science and Engineering, Seoul, Korea
Other persons with the same name
- Guangyu Zhu (aka: GuangYu Zhu, Guang-yu Zhu, Guang-Yu Zhu) — disambiguation page
- Guangyu Zhu 0001 (aka: GuangYu Zhu 0001, Guang-yu Zhu 0001) — Beijing Jiaotong University, School of Traffic and Transportation, Beijing Research Center of Urban Traffic Information Sensing and Service Technologies, Beijing, China (and 2 more)
- Guangyu Zhu 0002 — National University of Singapore, Electrical and Computer Engineering, Singapore (and 1 more)
- Guangyu Zhu 0004 — University of Maryland, Language and Media Processing Laboratory, Institute for Advanced Computer Studies, MD, USA
- Guangyu Zhu 0005 (aka: GuangYu Zhu 0005, Guang-Yu Zhu 0005) — Fuzhou University, School of Mechanical Engineering and Automation, School of Advanced Manufacturing, China
- Guangyu Zhu 0006 — University of Florida, Department of Electrical and Computer Engineering, Gainesville, FL, USA
- Guangyu Zhu 0007 — Beijing University of Posts and Telecommunications, BUPT, School of Artificial Intelligence, Key Laboratory of Universal Wireless Communications, Beijing, China
- Guangyu Zhu 0008 — University of Rhode Island, Department of Computer Science and Statistics, Kingston, RI, USA (and 1 more)
- Guangyu Zhu 0009 (aka: Guang-Yu Zhu 0009) — Zhejiang University, College of Information Science and Electronic Engineering, Hangzhou, China (and 1 more)
- Guangyu Zhu 0010 — Beijing University of Posts and Telecommunications, School of Information and Communication Engineering, China
- Guangyu Zhu 0011 — Ryerson University, Department of Electrical and Computer Engineering, Toronto, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j2]Jaehyun Han, Guangyu Zhu, Eunseo Lee, Yongseok Son:
Design and implementation of an efficient and parallel bad block checker for parallelism of storage devices. Clust. Comput. 26(5): 2615-2627 (2023) - 2022
- [c5]Guangyu Zhu, Sangjin Lee, Yongseok Son:
An efficient log-structured scheme for disk arrays. SAC 2022: 1197-1204 - [c4]Guangyu Zhu, Jeongeun Lee, Yongseok Son:
An efficient and parallel file defragmentation scheme for flash-based SSDs. SAC 2022: 1208-1211 - 2021
- [c3]Jaehyun Han, Guangyu Zhu, Eunseo Lee, Sangmook Lee, Yongseok Son:
An Empirical Evaluation and Analysis of Performance of Multiple Optane SSDs. ICOIN 2021: 541-545 - [c2]Guangyu Zhu, Jaehyun Han, Sangjin Lee, Yongseok Son:
An Empirical Evaluation of NVM-aware File Systems on Intel Optane DC Persistent Memory Modules. ICOIN 2021: 559-564 - 2020
- [j1]Guangyu Zhu, Jaehyun Han, Yongseok Son:
A Preliminary Study: Towards Parallel Garbage Collection for NAND Flash-Based SSDs. IEEE Access 8: 223574-223587 (2020) - [c1]Jaehyun Han, Guangyu Zhu, Eunseo Lee, Yongseok Son:
An Efficient and Parallel Bad Block Checker for Parallelism of Storage Devices. ACSOS Companion 2020: 13-18
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-11-11 21:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint