default search action
Philip G. Emma
Person information
Other persons with a similar name
SPARQL queries
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [c15]Ben Lin, Michael B. Healy, Rustam Miftakhutdinov, Philip G. Emma, Yale N. Patt:
Duplicon Cache: Mitigating Off-Chip Memory Bank and Bank Group Conflicts Via Data Duplication. MICRO 2018: 285-297 - 2014
- [c14]Philip G. Emma, Alper Buyuktosunoglu, Michael B. Healy, Krishnan Kailas, Valentin Puente, Roy Yu, Allan Hartstein, Pradip Bose, Jaime H. Moreno, Eren Kursun:
3D stacking of high-performance processors. HPCA 2014: 500-511
2000 – 2009
- 2009
- [j30]Philip G. Emma, Eren Kursun:
Opportunities and Challenges for 3D Systems and Their Design. IEEE Des. Test Comput. 26(5): 6-14 (2009) - 2008
- [j29]Philip G. Emma, Eren Kursun:
Is 3D chip technology the next growth engine for performance improvement? IBM J. Res. Dev. 52(6): 541-552 (2008) - [j28]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) - [j27]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) - [j26]Philip G. Emma:
A Collaborative IP-Development Session. IEEE Micro 28(1): 110-112 (2008) - [j25]Philip G. Emma:
Guest Editor's Introduction: Existential Architectures: The Metaphysics of Computer Design. IEEE Micro 28(6): 4-6 (2008) - [j24]Philip G. Emma, William R. Reohr, Mesut Meterelliyoz:
Rethinking Refresh: Increasing Availability and Reducing Power in DRAM for Cache Applications. IEEE Micro 28(6): 47-56 (2008) - 2007
- [j23]Philip G. Emma:
Reinventing Entrepreneurial Inventing for the 21st Century. IEEE Micro 27(1): 134-136 (2007) - [j22]Philip G. Emma:
Supercharging Your Creative Skills. IEEE Micro 27(2): 86-88 (2007) - [j21]Philip G. Emma:
Arcane Facts and New Words: Expanding Your Creative Talent. IEEE Micro 27(3): 110-112 (2007) - [j20]Philip G. Emma:
Innovation or Notoriety? IEEE Micro 27(4): 62-64 (2007) - [j19]Philip G. Emma:
You're Invited to a Party! (How To Hold a Collaborative IP-Development Session). IEEE Micro 27(6): 62-64 (2007) - [c13]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 - [c12]Kerry Bernstein, Paul S. Andry, Jerome Cann, Philip G. Emma, David Greenberg, Wilfried Haensch, Mike Ignatowski, Steven J. Koester, John Magerlein, Ruchir Puri, Albert M. Young:
Interconnects in the Third Dimension: Design Challenges for 3D ICs. DAC 2007: 562-567 - [c11]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Viji Srinivasan, Arthur Nadas:
Pipeline spectroscopy. Experimental Computer Science 2007: 15 - [c10]Thomas R. Puzak, Allan Hartstein, Viji Srinivasan, Philip G. Emma, Arthur Nadas:
Pipeline spectroscopy. SIGMETRICS 2007: 351-352 - 2006
- [j18]Philip G. Emma:
How to write a patent. IEEE Micro 26(1): 144 (2006) - [j17]Philip G. Emma:
The best patents of all. IEEE Micro 26(2): 83-84 (2006) - [j16]Philip G. Emma:
Patent Claims Revisited: Examiners and Trolls. IEEE Micro 26(3): 94-96 (2006) - [j15]Philip G. Emma:
The Mechanics of Filing a Patent. IEEE Micro 26(4): 88, 87 (2006) - [j14]Philip G. Emma:
Prosecuting your patent. IEEE Micro 26(5): 88, 87 (2006) - [j13]Philip G. Emma:
Five strategies for overcoming obviousness. IEEE Micro 26(6): 70-72 (2006) - [c9]Allan Hartstein, Viji Srinivasan, Thomas R. Puzak, Philip G. Emma:
Cache miss behavior: is it sqrt(2)? Conf. Computing Frontiers 2006: 313-320 - [c8]Philip G. Emma:
Industrial Perspectives: The Next Roadblocks in SOC Evolution: On-Chip Storage Capacity and Off-Chip Bandwidth. HPCA 2006: 201-201 - [c7]Philip G. Emma:
The End of Scaling? Revolutions in Technology and Microarchitecture as We Pass the 90 Nanometer Node. ISCA 2006: 128 - 2005
- [j12]Philip G. Emma, Allan Hartstein, Thomas R. Puzak, Viji Srinivasan:
Exploring the limits of prefetching. IBM J. Res. Dev. 49(1): 127-144 (2005) - [j11]Philip G. Emma:
Inventions and the creative process. IEEE Micro 25(3): 93-96 (2005) - [j10]Philip G. Emma:
What is patentable? IEEE Micro 25(4): 7-9 (2005) - [j9]Philip G. Emma:
Patents: To file or not to file? IEEE Micro 25(5): 79-81 (2005) - [j8]Philip G. Emma:
Writing the claims for a patent. IEEE Micro 25(6): 79-81 (2005) - [c6]Thomas R. Puzak, Allan Hartstein, Philip G. Emma, Viji Srinivasan:
When prefetching improves/degrades performance. Conf. Computing Frontiers 2005: 342-352 - 2004
- [j7]Victor V. Zyuban, David M. Brooks, Viji Srinivasan, Michael Gschwind, Pradip Bose, Philip N. Strenski, Philip G. Emma:
Integrated Analysis of Power and Performance for Pipelined Microprocessors. IEEE Trans. Computers 53(8): 1004-1016 (2004) - 2003
- [j6]David M. Brooks, Pradip Bose, Viji Srinivasan, Michael Gschwind, Philip G. Emma, Michael G. Rosenfield:
New methodology for early-stage, microarchitecture-level power-performance analysis of microprocessors. IBM J. Res. Dev. 47(5-6): 653-670 (2003) - 2002
- [c5]Viji Srinivasan, David M. Brooks, Michael Gschwind, Pradip Bose, Victor V. Zyuban, Philip N. Strenski, Philip G. Emma:
Optimizing pipelines for power and performance. MICRO 2002: 333-344 - [c4]Pradip Bose, David M. Brooks, Alper Buyuktosunoglu, Peter W. Cook, K. Das, Philip G. Emma, Michael Gschwind, Hans M. Jacobson, Tejas Karkhanis, Prabhakar Kudva, Stanley Schuster, James E. Smith, Viji Srinivasan, Victor V. Zyuban, David H. Albonesi, Sandhya Dwarkadas:
Early-Stage Definition of LPX: A Low Power Issue-Execute Processor. PACS 2002: 1-17
1990 – 1999
- 1997
- [j5]Philip G. Emma:
Understanding some simple processor-performance limits. IBM J. Res. Dev. 41(3): 215-232 (1997) - [j4]Charles F. Webb, Carl J. Anderson, Leon J. Sigal, Kenneth L. Shepard, John S. Liptay, James D. Warnock, Brian W. Curran, Barry Krumm, Mark D. Mayo, Peter J. Camporese, Eric M. Schwarz, Mark S. Farrell, Phillip J. Restle, Robert M. Averill III, Timothy J. Slegel, William V. Huott, Yuen H. Chan, Bruce Wile, Thao N. Nguyen, Philip G. Emma, Daniel K. Beece, Ching-Te Chuang, Cyril Price:
A 4.1-ns compact 54×54-b multiplier utilizing sign-select Booth encoders. IEEE J. Solid State Circuits 32(11): 1676-1682 (1997) - [j3]David R. Kaeli, Philip G. Emma:
Improving the Accuracy of History Based Branch Prediction. IEEE Trans. Computers 46(4): 469-472 (1997) - 1996
- [c3]Pradip Bose, Philip G. Emma:
Computer architecture education in a corporate reengineering program. WCAE@HPCA 1996: 6 - 1992
- [j2]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) - 1991
- [c2]David R. Kaeli, Philip G. Emma:
Branch History Table Prediction of Moving Target Branches due to Subroutine Returns. ISCA 1991: 34-42
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 - 1987
- [j1]Philip G. Emma, Edward S. Davidson:
Characterization of Branch and Data Dependencies in Programs for Evaluating Pipeline Performance. IEEE Trans. Computers 36(7): 859-875 (1987)
Coauthor Index
aka: Viji Srinivasan
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