default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas R. Puzak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j6]Allan Hartstein, Vijayalakshmi Srinivasan, Thomas R. Puzak, Philip G. Emma:
On the Nature of Cache Miss Behavior: Is It √2? J. Instr. Level Parallelism 10 (2008)- [j5]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Vijayalakshmi Srinivasan, Arthur Nadas:
Analyzing the Cost of a Cache Miss Using Pipeline Spectroscopy. J. Instr. Level Parallelism 10 (2008) - 2007
- [c10]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Viji Srinivasan, Jim Mitchell:
An analysis of the effects of miss clustering on the cost of a cache miss. Conf. Computing Frontiers 2007: 3-12 - [c9]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Viji Srinivasan, Arthur Nadas:
Pipeline spectroscopy. Experimental Computer Science 2007: 15 - [c8]Thomas R. Puzak, Allan Hartstein, Viji Srinivasan, Philip G. Emma, Arthur Nadas:
Pipeline spectroscopy. SIGMETRICS 2007: 351-352 - 2006
- [c7]Allan Hartstein, Viji Srinivasan, Thomas R. Puzak, Philip G. Emma:
Cache miss behavior: is it sqrt(2)? Conf. Computing Frontiers 2006: 313-320 - 2005
- [j4]Philip G. Emma, Allan Hartstein, Thomas R. Puzak, Viji Srinivasan:
Exploring the limits of prefetching. IBM J. Res. Dev. 49(1): 127-144 (2005) - [c6]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Viji Srinivasan:
When prefetching improves/degrades performance. Conf. Computing Frontiers 2005: 342-352 - 2004
- [j3]Allan Hartstein, Thomas R. Puzak:
The optimum pipeline depth considering both power and performance. ACM Trans. Archit. Code Optim. 1(4): 369-388 (2004) - 2003
- [c5]Allan Hartstein, Thomas R. Puzak:
Optimum Power/Performance Pipeline Depth. MICRO 2003: 117-128 - 2002
- [c4]Allan Hartstein, Thomas R. Puzak:
The Optimum Pipeline Depth for a Microprocessor. ISCA 2002: 7-13 - 2001
- [c3]Viji Srinivasan, Edward S. Davidson, Gary S. Tyson, Mark J. Charney, Thomas R. Puzak:
Branch History Guided Instruction Prefetching. HPCA 2001: 291-300 - [c2]Wei-Fen Lin, Steven K. Reinhardt, Doug Burger, Thomas R. Puzak:
Filtering Superfluous Prefetches Using Density Vectors. ICCD 2001: 124-132
1990 – 1999
- 1997
- [j2]Mark J. Charney, Thomas R. Puzak:
Prefetching and memory system behavior of the SPEC95 benchmark suite. IBM J. Res. Dev. 41(3): 265-286 (1997) - 1992
- [j1]David R. Kaeli, Philip G. Emma, Joshua W. Knight, Thomas R. Puzak:
Contrasting instruction-fetch time and instruction-decode time branch prediction mechanisms: Achieving synergy through their cooperative operation. Microprocess. Microprogramming 35(1-5): 401-408 (1992)
1980 – 1989
- 1989
- [c1]Philip G. Emma, Joshua W. Knight, James H. Pomerence, Thomas R. Puzak, Rudolph N. Rechtschaffen:
Simulation and analysis of a pipeline processor. WSC 1989: 1047-1057
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:19 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:
