default search action
Hao Luo 0007
Person information
- affiliation: Google Inc., USA
- affiliation: University of Rochester, NY, USA
Other persons with the same name
- Hao Luo — disambiguation page
- Hao Luo 0001
— Zhejiang University, School of Aeronautics and Astronautics, Hangzhou, China (and 1 more)
- Hao Luo 0002
- Hao Luo 0003
- Hao Luo 0004
- Hao Luo 0005
- Hao Luo 0006
- Hao Luo 0008
- Hao Luo 0009 — Twitter Inc., USA (and 1 more)
- Hao Luo 0010 — Beijing University of Posts and Telecommunications, Institute of Network Technology, China
- Hao Luo 0011
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [c9]Pengcheng Li, Hao Luo, Chen Ding:
Timescale functions for parallel memory allocation. ISMM 2019: 64-78 - 2018
- [c8]Hao Luo, Guoyang Chen, Fangzhou Liu
Footprint modeling of cache associativity and granularity. MEMSYS 2018: 232-242 - 2017
- [j4]Pengcheng Li, Xiaoyu Hu, Dong Chen, Jacob Brock, Hao Luo, Eddy Z. Zhang, Chen Ding
LD: Low-Overhead GPU Race Detection Without Access Monitoring. ACM Trans. Archit. Code Optim. 14(1): 9:1-9:25 (2017) - [j3]Chencheng Ye, Chen Ding
Cache Exclusivity and Sharing: Theory and Optimization. ACM Trans. Archit. Code Optim. 14(4): 34:1-34:26 (2017) - [c7]Hao Luo, Pengcheng Li, Chen Ding:
Thread Data Sharing in Cache: Theory and Measurement. PPoPP 2017: 103-115 - 2016
- [c6]Hao Luo, Jacob Brock, Pengcheng Li, Chen Ding, Chencheng Ye:
Compositional model of coherence and NUMA effects for optimizing thread and data placement. ISPASS 2016: 151-152 - [c5]Pengcheng Li, Hao Luo, Chen Ding
Rethinking a heap hierarchy as a cache hierarchy: a higher-order theory of memory demand (HOTM). ISMM 2016: 111-121 - [c4]Hao Luo, Guoyang Chen, Pengcheng Li, Chen Ding, Xipeng Shen:
Data-centric combinatorial optimization of parallel code. PPoPP 2016: 38:1-38:2 - 2014
- [j2]Chen Ding
Performance Metrics and Models for Shared Cache. J. Comput. Sci. Technol. 29(4): 692-712 (2014) - [j1]Jacob Brock, Hao Luo, Chen Ding:
Locality analysis: a nonillion time window problem. SIGMETRICS Perform. Evaluation Rev. 41(4): 102-105 (2014) - [c3]Pengcheng Li, Hao Luo, Chen Ding, Ziang Hu, Handong Ye:
Code Layout Optimization for Defensiveness and Politeness in Shared Cache. ICPP 2014: 151-161 - [c2]Pengcheng Li, Chen Ding, Hao Luo:
Modeling heap data growth using average liveness. ISMM 2014: 71-82 - 2013
- [c1]Xiaoya Xiang, Chen Ding, Hao Luo, Bin Bao:
HOTL: a higher order theory of locality. ASPLOS 2013: 343-356
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-19 21:46 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: