![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Augustus K. Uht
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j15]Mustafa Cavus, Mohammed Shatnawi, Resit Sendag, Augustus K. Uht:
Fast Key-Value Lookups with Node Tracker. ACM Trans. Archit. Code Optim. 18(3): 34:1-34:26 (2021) - 2020
- [j14]Mustafa Cavus
, Mohammed Shatnawi
, Resit Sendag
, Augustus K. Uht
:
Exploring Prefetching, Pre-Execution and Branch Outcome Streaming for In-Memory Database Lookups. IEEE Comput. Archit. Lett. 19(1): 5-8 (2020) - 2007
- [j13]Resit Sendag, Ayse Yilmazer
, Joshua J. Yi, Augustus K. Uht:
The impact of wrong-path memory references in cache-coherent multiprocessor systems. J. Parallel Distributed Comput. 67(12): 1256-1269 (2007) - 2005
- [j12]Augustus K. Uht:
Uniprocessor Performance Enhancement through Adaptive Clock Frequency Control. IEEE Trans. Computers 54(2): 132-140 (2005) - 2004
- [j11]Augustus K. Uht:
Going Beyond Worst-Case Specs with TEAtime. Computer 37(3): 51-56 (2004) - 2003
- [j10]Augustus K. Uht, David Morano, Alireza Khalafi, David R. Kaeli:
Levo - A Scalable Processor With High IPC. J. Instr. Level Parallelism 5 (2003) - [j9]David Morano, Alireza Khalafi, David R. Kaeli, Augustus K. Uht:
Realizing high IPC through a scalable memory-latency tolerant multipath microarchitecture. SIGARCH Comput. Archit. News 31(1): 16-25 (2003) - 2002
- [j8]Augustus K. Uht:
Disjoint Eager Execution: what it is / what it is not. SIGARCH Comput. Archit. News 30(1): 12-14 (2002) - 2000
- [j7]Augustus K. Uht, Jien-Chung Lo, Ying Sun, James C. Daly, James Kowalski:
Building Real Computer Systems. IEEE Micro 20(3): 48-56 (2000) - 1997
- [j6]Augustus K. Uht, Vijay Sindagi, Sajee Somanathan:
Branch Effect Reduction Techniques. Computer 30(5): 71-81 (1997) - 1993
- [j5]Augustus K. Uht:
Extraction of massive instruction level parallelism. SIGARCH Comput. Archit. News 21(1): 12-14 (1993) - [j4]Augustus K. Uht:
Extraction of massive instruction level parallelism. SIGARCH Comput. Archit. News 21(3): 5-12 (1993) - 1992
- [j3]Augustus K. Uht:
Concurrency Extraction via Hardware Methods Executing the Static Instruction Stream. IEEE Trans. Computers 41(7): 826-841 (1992) - [j2]Augustus K. Uht:
Requirements for Optimal Execution of Loops with Tests. IEEE Trans. Parallel Distributed Syst. 3(5): 573-581 (1992) - 1991
- [j1]Augustus K. Uht:
A Theory of Reduced and Minimal Procedural Dependencies. IEEE Trans. Computers 40(6): 681-692 (1991)
Conference and Workshop Papers
- 2009
- [c15]Michael Kadin, Sherief Reda, Augustus K. Uht:
Central vs. distributed dynamic thermal management for multi-core processors: which one is better? ACM Great Lakes Symposium on VLSI 2009: 137-140 - 2006
- [c14]Resit Sendag, Ayse Yilmazer
, Joshua J. Yi, Augustus K. Uht:
Quantifying and reducing the effects of wrong-path memory references in cache-coherent multiprocessor systems. IPDPS 2006 - 2002
- [c13]Augustus K. Uht, Alireza Khalafi, David Morano, Marcos de Alba, David R. Kaeli:
Realizing High IPC Using Time-Tagged Resource-Flow Computing. Euro-Par 2002: 490-499 - 1998
- [c12]Augustus K. Uht:
The integrated computer engineering design (ICED) curriculum. WCAE@HPCA 1998: 2 - [c11]Augustus K. Uht:
The integrated computer engineering design (ICED) curriculum. WCAE@ISCA 1998: 4 - 1995
- [c10]Augustus K. Uht, Vijay Sindagi, Kelley Hall:
Disjoint eager execution: an optimal form of speculative execution. MICRO 1995: 313-325 - 1992
- [c9]Augustus K. Uht, Darin B. Johnson:
Data path issues in a highly concurrent machine. ISCA 1992: 431 - [c8]Augustus K. Uht, Darin B. Johnson:
Data path issues in a highly concurrent machine. MICRO 1992: 115-118 - 1990
- [c7]S. ShouHan Wang, Augustus K. Uht:
Ideograph/Ideogram: framework/hardware for eager evaluation. MICRO 1990: 125-134 - 1989
- [c6]S. ShouHan Wang, Augustus K. Uht:
Program Optimization with Ideograph. ICPP (2) 1989: 153-159 - 1988
- [c5]Augustus K. Uht:
Requirements for optimal execution ofL oops with tests. ICS 1988: 230-237 - [c4]J. H. Jacobs, Augustus K. Uht, R. C. Ord:
Modeling the effects of instruction queue loading on a static instruction stream micro-architecture. MICRO 1988: 11-20 - 1987
- [c3]Augustus K. Uht:
Incremental Performance Contributions of Hardware Concurrency Extraction Techniques. ICS 1987: 355-376 - [c2]Augustus K. Uht, Constantine D. Polychronopoulos, John F. Kolen:
On the combination of hardware and software concurrency extraction methods. MICRO 1987: 133-141 - 1986
- [c1]Augustus K. Uht, Robert G. Wedig:
Hardware Extraction of Low-Level Concurrency from Serial Instruction Streams. ICPP 1986: 729-736
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint