default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLin Wu 0002
Person information
- affiliation: Chongqing University, Department of Computer Science, China
Other persons with the same name
- Lin Wu — disambiguation page
- Lin Wu 0001
![[0000-0001-6119-058X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6119-058X")
(aka: Lin Yuanbo Wu) — Swansea University, UK (and 6 more) - Lin Wu 0003 — Chinese Academy of Sciences, Institute of Geodesy and Geophysics, Wuhan, China
- Lin Wu 0004 — Henan University, College of Computer and Information Engineering / College of Environment and Planning, Kaifeng, China
- Lin Wu 0005 — Joseph Fourier University, Grenoble, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j6]Lin Wu, Qingfeng Zhuge, Edwin Hsing-Mean Sha, Xianzhang Chen, Linfeng Cheng:
DWARM: A wear-aware memory management scheme for in-memory file systems. Future Gener. Comput. Syst. 88: 1-15 (2018)- [j5]Weiwen Jiang, Edwin Hsing-Mean Sha, Xianzhang Chen, Lin Wu, Qingfeng Zhuge:
Synthesizing distributed pipelining systems with timing constraints via optimal functional unit assignment and communication selection. J. Comput. Sci. 26: 332-343 (2018) - [j4]Xianzhang Chen, Edwin Hsing-Mean Sha, Qingfeng Zhuge, Ting Wu, Weiwen Jiang, Xiaoping Zeng, Lin Wu:
UMFS: An efficient user-space file system for non-volatile memory. J. Syst. Archit. 89: 18-29 (2018) - [j3]Qiang Sun, Qingfeng Zhuge, Xianzhang Chen, Edwin H.-M. Sha, Lin Wu:
带磨损均衡的小粒度非易失性内存管理机制 (In-page Wear-leveling Memory Management Based on Non-volatile Memory). 计算机科学 45(11A): 505-510 (2018) - [c5]Yuansong Zeng, Edwin Hsing-Mean Sha, Qingfeng Zhuge, Xianzhang Chen, Zhulin Ma, Lin Wu:
An Efficient File System for Hybrid In-Memory NVM and Block Devices. NVMSA 2018: 43-48 - [c4]Yanbo Zhou, Shouzhen Gu, Lixia Zheng, Edwin Hsing-Mean Sha, Qingfeng Zhuge, Lin Wu:
Write-Aware Data Allocation on Heterogeneous Memory Architecture with Minimum Cost. RTCSA 2018: 32-41 - 2017
- [j2]Lin Wu, Qingfeng Zhuge, Edwin Hsing-Mean Sha, Xianzhang Chen, Linfeng Cheng:
BOSS: An Efficient Data Distribution Strategy for Object Storage Systems With Hybrid Devices. IEEE Access 5: 23979-23993 (2017) - [j1]Weiwen Jiang, Edwin Hsing-Mean Sha, Qingfeng Zhuge, Lin Wu:
Efficient assignment algorithms to minimize operation cost for supply chain networks in agile manufacturing. Comput. Ind. Eng. 108: 225-239 (2017) - [c3]Xianzhang Chen, Edwin Hsing-Mean Sha, Ahmad Abdullah, Qingfeng Zhuge, Lin Wu, Chaoshu Yang, Weiwen Jiang:
UDORN: A design framework of persistent in-memory key-value database for NVM. NVMSA 2017: 1-6 - 2016
- [c2]Weiwen Jiang, Edwin Hsing-Mean Sha, Xianzhang Chen, Qingfeng Zhuge, Lin Wu:
Optimal Functional Assignment and Communication Selection under Timing Constraint for Self-Timed Pipelines. ICESS 2016: 87-92 - 2015
- [c1]Lin Wu, Qingfeng Zhuge, Edwin Hsing-Mean Sha, Zhilong Sun:
Efficient Scheduling with Intensive In-Memory File Accesses Considering Bandwidth Constraint on Memory Bus. ICA3PP (2) 2015: 567-580
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-11-14 00:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
