default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Hao
Person information
Other persons with a similar name
- Tan Zhi Hao Eric
- Eric Khoo Yin Hao
- Eric Yin Hao Khoo
- Hao Eric Liu
- Chih-hao Eric Sun
- Kuo-Hao Tang (aka: Kuo-Hao Eric Tang)
- Hao Wang 0049
![[0000-0002-3243-487X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-3243-487X")
(aka: Eric Hao Wang) — Zhejiang University, College of Control Science and Engineering, Hangzhou, China - Eric Hao Xu
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c8]David R. Ditzel, Roger Espasa, Nivard Aymerich, Allen Baum, Tom Berg, Jim Burr, Eric Hao, Jayesh Iyer, Miquel Izquierdo, Shankar Jayaratnam, Darren Jones, Chris Klingner, Jin Kim, Stephen Lee, Marc Lupon, Grigorios Magklis, Bojan Maric, Rajib Nath, Mike Neilly, J. Duane Northcutt, Bill Orner, Jose Renau, Gerard Reves, Xavier Reves, Tom Riordan, Pedro Sanchez, Sridhar Samudrala, Guillem Sole, Raymond Tang, Tommy Thorn, Francisco Torres, Sebastia Tortella, Daniel Yau:
Accelerating ML Recommendation with over a Thousand RISC-V/Tensor Processors on Esperanto's ET-SoC-1 Chip. HCS 2021: 1-23
1990 – 1999
- 1998
- [j3]Eric Hao, Po-Yung Chang, Marius Evers, Yale N. Patt:
Increasing the Instruction Fetch Rate via Block-Structured Instruction Set Architectures. Int. J. Parallel Program. 26(4): 449-478 (1998) - 1997
- [b1]Eric Hao:
Block enlargement optimizations for increasing the instruction fetch rate in block-structured instruction set architectures. University of Michigan, USA, 1997 - [c7]Po-Yung Chang, Eric Hao, Yale N. Patt:
Target Prediction for Indirect Jumps. ISCA 1997: 274-283 - 1996
- [j2]Po-Yung Chang, Eric Hao, Tse-Yu Yeh, Yale N. Patt:
Branch Classification: New Mechanism for Improving Branch Predictor Performance. Int. J. Parallel Program. 24(2): 133-158 (1996) - [j1]Po-Yung Chang, Eric Hao, Yale N. Patt, Pohua P. Chang:
Using Predicated Execution to Improve the Performance of a Dynamically Scheduled Machine with Speculative Execution. Int. J. Parallel Program. 24(3): 209-234 (1996) - [c6]Eric Hao, Po-Yung Chang, Marius Evers, Yale N. Patt:
Increasing the Instruction Fetch Rate via Block-structured Instruction Set Architectures. MICRO 1996: 191-200 - 1995
- [c5]Po-Yung Chang, Eric Hao, Yale N. Patt, Pohua P. Chang:
Using predicated execution to improve the performance of a dynamically scheduled machine with speculative execution. PACT 1995: 99-108 - [c4]Po-Yung Chang, Eric Hao, Yale N. Patt:
Alternative implementations of hybrid branch predictors. MICRO 1995: 252-257 - 1994
- [c3]Po-Yung Chang, Eric Hao, Tse-Yu Yeh, Yale N. Patt:
Branch classification: a new mechanism for improving branch predictor performance. MICRO 1994: 22-31 - [c2]Eric Hao, Po-Yung Chang, Yale N. Patt:
The effect of speculatively updating branch history on branch prediction accuracy, revisited. MICRO 1994: 228-232 - 1993
- [c1]Daniel Windheiser, Eric L. Boyd, Eric Hao, Santosh G. Abraham, Edward S. Davidson:
KSR 1 Multiprocessor: Analysis of Latency Hiding Techniques in a Sparse Solver. IPPS 1993: 454-461
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-04-24 23:14 CEST 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:
