default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew I. Frank
2010 – 2019
- 2011
[c21]Joseph L. Greathouse, Zhiqiang Ma, Matthew I. Frank, Ramesh Peri, Todd M. Austin:
Demand-driven software race detection using hardware performance counters. ISCA 2011: 165-176- 2010
- [j5]John H. Kelm, Daniel R. Johnson, Steven S. Lumetta, Sanjay J. Patel, Matthew I. Frank:
A Task-Centric Memory Model for Scalable Accelerator Architectures. IEEE Micro 30(1): 29-39 (2010)
2000 – 2009
- 2009
- [c20]John H. Kelm, Daniel R. Johnson, Steven S. Lumetta, Matthew I. Frank, Sanjay J. Patel:
A Task-Centric Memory Model for Scalable Accelerator Architectures. PACT 2009: 77-87 - [c19]Nicholas Weaver, John H. Kelm, Matthew I. Frank:
Emµcode: Masking hard faults in complex functional units. DSN 2009: 458-467 - [c18]Mayank Agarwal, Matthew I. Frank:
SPARTAN: A software tool for Parallelization Bottleneck Analysis. IWMSE@ICSE 2009: 56-63 - [c17]John H. Kelm, Daniel R. Johnson, Matthew R. Johnson, Neal Clayton Crago, William Tuohy, Aqeel Mahesri, Steven S. Lumetta, Matthew I. Frank, Sanjay J. Patel:
Rigel: an architecture and scalable programming interface for a 1000-core accelerator. ISCA 2009: 140-151 - [p1]Michael B. Taylor, Walter Lee, Jason E. Miller, David Wentzlaff, Ian Bratt, Ben Greenwald, Henry Hoffmann, Paul R. Johnson, Jason Sungtae Kim, James Psota, Arvind Saraf, Nathan Shnidman, Volker Strumpen, Matthew I. Frank, Saman P. Amarasinghe, Anant Agarwal:
Tiled Multicore Processors. Multicore Processors and Systems 2009: 1-33 - 2008
- [c16]Kshitiz Malik, Mayank Agarwal, Vikram Dhar, Matthew I. Frank:
PaCo: Probability-based path confidence prediction. HPCA 2008: 50-61 - [c15]Kshitiz Malik, Mayank Agarwal, Sam S. Stone, Kevin M. Woley, Matthew I. Frank:
Branch-mispredict level parallelism (BLP) for control independence. HPCA 2008: 62-73 - [c14]Mayank Agarwal, Nitin Navale, Kshitiz Malik, Matthew I. Frank:
Fetch-Criticality Reduction through Control Independence. ISCA 2008: 13-24 - 2007
- [j4]Shane Ryoo, Sain-Zee Ueng, Christopher I. Rodrigues, Robert E. Kidd, Matthew I. Frank, Wen-mei W. Hwu:
Automatic Discovery of Coarse-Grained Parallelism in Media Applications. Trans. High Perform. Embed. Archit. Compil. 1: 194-213 (2007) - [c13]Wen-mei W. Hwu, Shane Ryoo, Sain-Zee Ueng, John H. Kelm, Isaac Gelado, Sam S. Stone, Robert E. Kidd, Sara S. Baghsorkhi, Aqeel Mahesri, Stephanie C. Tsao, Nacho Navarro, Steven S. Lumetta, Matthew I. Frank, Sanjay J. Patel:
Implicitly Parallel Programming Models for Thousand-Core Microprocessors. DAC 2007: 754-759 - [c12]Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam S. Stone, Matthew I. Frank:
Exploiting Postdominance for Speculative Parallelization. HPCA 2007: 295-305 - 2005
- [c11]Sam S. Stone, Kevin M. Woley, Matthew I. Frank:
Address-Indexed Memory Disambiguation and Store-to-Load Forwarding. MICRO 2005: 171-182 - 2004
- [c10]Michael B. Taylor, Walter Lee, Jason E. Miller, David Wentzlaff, Ian Bratt, Ben Greenwald, Henry Hoffmann, Paul R. Johnson, Jason Sungtae Kim, James Psota, Arvind Saraf, Nathan Shnidman, Volker Strumpen, Matthew I. Frank, Saman P. Amarasinghe, Anant Agarwal:
Evaluation of the Raw Microprocessor: An Exposed-Wire-Delay Architecture for ILP and Streams. ISCA 2004: 2-13 - 2003
- [b1]Matthew I. Frank:
SUDS: automatic parallelization for raw processors. Massachusetts Institute of Technology, Cambridge, MA, USA, 2003 - 2002
- [j3]Michael B. Taylor, Jason Sungtae Kim, Jason E. Miller, David Wentzlaff, Fae Ghodrat, Ben Greenwald, Henry Hoffmann, Paul R. Johnson, Jae W. Lee, Walter Lee, Albert Ma, Arvind Saraf, Mark Seneski, Nathan Shnidman, Volker Strumpen, Matthew I. Frank, Saman P. Amarasinghe, Anant Agarwal:
The Raw Microprocessor: A Computational Fabric for Software Circuits and General-Purpose Programs. IEEE Micro 22(2): 25-35 (2002) - 2001
- [j2]Csaba Andras Moritz, Matthew I. Frank:
LoGPC: Modeling Network Contention in Message-Passing Programs. IEEE Trans. Parallel Distributed Syst. 12(4): 404-415 (2001) - 2000
- [c9]Csaba Andras Moritz, Matthew I. Frank, Saman P. Amarasinghe:
FlexCache: A Framework for Flexible Compiler Generated Data Caching. Intelligent Memory Systems 2000: 135-146
1990 – 1999
- 1999
- [c8]Jonathan Babb, Martin C. Rinard, Csaba Andras Moritz, Walter Lee, Matthew I. Frank, Rajeev Barua, Saman P. Amarasinghe:
Parallelizing Applications into Silicon. FCCM 1999: 70- - 1998
- [c7]Walter Lee, Rajeev Barua, Matthew I. Frank, Devabhaktuni Srikrishna, Jonathan Babb, Vivek Sarkar, Saman P. Amarasinghe
:
Space-Time Scheduling of Instruction-Level Parallelism on a Raw Machine. ASPLOS 1998: 46-57 - [c6]Kenneth Mackenzie, John Kubiatowicz, Matthew I. Frank, Walter Lee, Victor Lee, Anant Agarwal, M. Frans Kaashoek:
Exploiting Two-Case Delivery for Fast Protected Messaging. HPCA 1998: 231-242 - [c5]Csaba Andras Moritz, Matthew I. Frank:
LoGPC: Modeling Network Contention in Message-Passing Programs. SIGMETRICS 1998: 254-263 - 1997
- [j1]Elliot Waingold, Michael B. Taylor, Devabhaktuni Srikrishna, Vivek Sarkar, Walter Lee, Victor Lee, Jang Kim, Matthew I. Frank, Peter Finch, Rajeev Barua, Jonathan Babb, Saman P. Amarasinghe, Anant Agarwal:
Baring It All to Software: Raw Machines. Computer 30(9): 86-93 (1997) - [c4]Jonathan Babb, Matthew I. Frank, Victor Lee, Elliot Waingold, Rajeev Barua, Michael B. Taylor, Jang Kim, Devabhaktuni Srikrishna, Anant Agarwal:
The RAW benchmark suite: computation structures for general purpose computing. FCCM 1997: 134-144 - [c3]Walter Lee, Matthew I. Frank, Victor Lee, Kenneth Mackenzie, Larry Rudolph:
Implications of I/O for Gang Scheduled Workloads. JSSPP 1997: 215-237 - [c2]Matthew I. Frank, Anant Agarwal, Mary K. Vernon:
LoPC: Modeling Contention in Parallel Algorithms. PPoPP 1997: 276-287 - 1993
- [c1]Matthew I. Frank, Mary K. Vernon:
A Hybrid Shared Memory/Message Passing Parallel Machine. ICPP (1) 1993: 232-236
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.
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.
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.
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 2025-01-21 00:09 CET 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:
