default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGang-Ryung Uh
- > Home > Persons > Gang-Ryung Uh
Publications
- 2023
[c15]Abigail Mortensen, Scott Pomerville, David B. Whalley, Soner Önder, Gang-Ryung Uh:
Facilitating the Bootstrapping of a New ISA. LCTES 2023: 2-12- 2015
- [c14]B. Davis, Ryan Baird, Peter Gavin, Magnus Själander
, Ian Finlayson, F. Rasapour, G. Cook, Gang-Ryung Uh, David B. Whalley, Gary S. Tyson:
Scheduling instruction effects for a statically pipelined processor. CASES 2015: 167-176 - [c13]Ryan Baird, Peter Gavin, Magnus Själander, David B. Whalley, Gang-Ryung Uh:
Optimizing Transfers of Control in the Static Pipeline Architecture. LCTES 2015: 1:1-1:10 - 2013
- [c12]Ian Finlayson, Brandon Davis, Peter Gavin, Gang-Ryung Uh, David B. Whalley, Magnus Själander, Gary S. Tyson:
Improving processor efficiency by statically pipelining instructions. LCTES 2013: 33-44 - 2012
- [j6]Ian Finlayson, Gang-Ryung Uh, David B. Whalley, Gary S. Tyson:
An Overview of Static Pipelining. IEEE Comput. Archit. Lett. 11(1): 17-20 (2012) - 2011
- [c11]Ian Finlayson, Gang-Ryung Uh, David B. Whalley, Gary S. Tyson:
Improving Low Power Processor Efficiency with Static Pipelining. Interaction between Compilers and Computer Architectures 2011: 17-24 - 2005
- [j5]William C. Kreahling, David B. Whalley, Mark W. Bailey, Xin Yuan, Gang-Ryung Uh, Robert van Engelen:
Branch elimination by condition merging. Softw. Pract. Exp. 35(1): 51-74 (2005) - [j4]Gang-Ryung Uh, Yuhong Wang, David B. Whalley, Sanjay Jinturkar, Yunheung Paek, Vincent Cao, Chris Burns:
Compiler transformations for effectively exploiting a zero overhead loop buffer. Softw. Pract. Exp. 35(4): 393-412 (2005) - 2004
- [c8]Wankang Zhao, Prasad A. Kulkarni, David B. Whalley, Christopher A. Healy, Frank Mueller, Gang-Ryung Uh:
Tuning the WCET of Embedded Applications. IEEE Real-Time and Embedded Technology and Applications Symposium 2004: 472-481 - 2003
- [c7]William C. Kreahling, David B. Whalley, Mark W. Bailey, Xin Yuan, Gang-Ryung Uh, Robert van Engelen:
Branch Elimination via Multi-variable Condition Merging. Euro-Par 2003: 261-270 - 2002
- [j2]Minghui Yang, Gang-Ryung Uh, David B. Whalley:
Efficient and effective branch reordering using profile data. ACM Trans. Program. Lang. Syst. 24(6): 667-697 (2002) - 2000
- [c4]Gang-Ryung Uh, Yuhong Wang, David B. Whalley, Sanjay Jinturkar, Chris Burns, Vincent Cao:
Techniques for Effectively Exploiting a Zero Overhead Loop Buffer. CC 2000: 157-172 - 1999
- [j1]Gang-Ryung Uh, David B. Whalley:
Effectively Exploiting Indirect Jumps. Softw. Pract. Exp. 29(12): 1061-1101 (1999) - [c3]Gang-Ryung Uh, Yuhong Wang, David B. Whalley, Sanjay Jinturkar, Chris Burns, Vincent Cao:
Effective Exploitation of a Zero Overhead Loop Buffer. Workshop on Languages, Compilers, and Tools for Embedded Systems 1999: 10-19 - 1998
- [c2]Minghui Yang, Gang-Ryung Uh, David B. Whalley:
Improving Performance by Branch Reordering. PLDI 1998: 130-141 - 1997
- [c1]Gang-Ryung Uh, David B. Whalley:
Coalescing Conditional Branches into Efficient Indirect Jumps. SAS 1997: 315-329
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:09 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:
