Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Smith 0001
Person information
- affiliation: Harvard University, Cambridge, MA, USA
- affiliation: Stanford University, Stanford, CA, USA
Other persons with the same name
- Michael D. Smith — disambiguation page
- Michael D. Smith 0002
![[0000-0002-6706-9382]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-6706-9382")
— Carnegie Mellon University, Pittsburgh, PA, USA - Michael D. Smith 0003 (aka: Michael Doyle Smith) — NASA Goddard Space Flight Center, Greenbelt, MD, USA (and 1 more)
- Michael D. Smith 0004 — University of Melbourne, Department of Zoologoy, Melbourne, Australia
- Michael D. Smith 0005 — University of Michigan, Ann Arbor, MI, USA
- Michael D. Smith 0006 — Infinite Biomedical Technologies, LLC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2011
[j13]Vijay Janapa Reddi, Svilen Kanev, Wonyoung Kim, Simone Campanoni, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Voltage Noise in Production Processors. IEEE Micro 31(1): 20-28 (2011)- 2010
- [j12]Vijay Janapa Reddi, Meeta Sharma Gupta, Glenn H. Holloway, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Predicting Voltage Droops Using Recurring Program and Microarchitectural Event Activity. IEEE Micro 30(1): 110 (2010) - [j11]Vijay Janapa Reddi, Simone Campanoni, Meeta Sharma Gupta, Michael D. Smith, Gu-Yeon Wei, David M. Brooks, Kim M. Hazelwood:
Eliminating voltage emergencies via software-guided code transformations. ACM Trans. Archit. Code Optim. 7(2): 12:1-12:28 (2010) - 2008
- [j10]David J. Malan, Matt Welsh, Michael D. Smith:
Implementing public-key infrastructure for sensor networks. ACM Trans. Sens. Networks 4(4): 22:1-22:23 (2008) - 2006
- [j9]Simson L. Garfinkel, Michael D. Smith:
Guest Editors' Introduction: Data Surveillance. IEEE Secur. Priv. 4(6): 15-17 (2006) - [j8]Kim M. Hazelwood, Michael D. Smith:
Managing bounded code caches in dynamic binary optimization systems. ACM Trans. Archit. Code Optim. 3(3): 263-294 (2006) - 1999
- [j7]Nicholas C. Gloy, Michael D. Smith:
Procedure placement using temporal-ordering information. ACM Trans. Program. Lang. Syst. 21(5): 977-1027 (1999) - [j6]Cliff Young, Michael D. Smith:
Static correlated branch prediction. ACM Trans. Program. Lang. Syst. 21(5): 1028-1075 (1999) - 1998
- [j5]Stuart E. Schechter, Murali Krishnan, Michael D. Smith:
Using Path Profiles to Predict HTTP Requests. Comput. Networks 30(1-7): 457-467 (1998) - [j4]Mark Horowitz, Margaret Martonosi, Todd C. Mowry, Michael D. Smith:
Informing Memory Operations: Memory Performance Feedback Mechanisms and Their Applications. ACM Trans. Comput. Syst. 16(2): 170-205 (1998) - 1997
- [j3]Sarita V. Adve, Doug Burger, Rudolf Eigenmann, Alasdair Rawsthorne, Michael D. Smith, Catherine H. Gebotys, Mahmut T. Kandemir, David J. Lilja, Alok N. Choudhary, Jesse Zhixi Fang, Pen-Chung Yew:
Changing Interaction of Compiler and Architecture. Computer 30(12): 51-58 (1997) - 1996
- [j2]Ruby B. Lee, Michael D. Smith:
Guest Editorial: Media processing: a new design target. IEEE Micro 16(4): 6-9 (1996) - [j1]J. Bradley Chen, Yasuhiro Endo, Kee Chan, David Mazières, Antonio Dias, Margo I. Seltzer, Michael D. Smith:
The Measured Performance of Personal Computer Operating Systems. ACM Trans. Comput. Syst. 14(1): 3-40 (1996)
Conference and Workshop Papers
- 2010
- [c40]Vijay Janapa Reddi, Svilen Kanev, Wonyoung Kim, Simone Campanoni, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Voltage Smoothing: Characterizing and Mitigating Voltage Noise in Production Processors via Software-Guided Thread Scheduling. MICRO 2010: 77-88 - 2009
- [c39]Vijay Janapa Reddi, Simone Campanoni, Meeta Sharma Gupta, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Software-assisted hardware reliability: abstracting circuit-level challenges to the software stack. DAC 2009: 788-793 - [c38]Vijay Janapa Reddi, Meeta Sharma Gupta, Glenn H. Holloway, Gu-Yeon Wei, Michael D. Smith, David M. Brooks:
Voltage emergency prediction: Using signatures to reduce operating margins. HPCA 2009: 18-29 - 2008
- [c37]Meeta Sharma Gupta, Krishna K. Rangan, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
DeCoR: A Delayed Commit and Rollback mechanism for handling inductive noise in processors. HPCA 2008: 381-392 - 2007
- [c36]Alexandra Fedorova, Margo I. Seltzer, Michael D. Smith:
Improving Performance Isolation on Chip Multiprocessors via an Operating System Scheduler. PACT 2007: 25-38 - [c35]Kelly Heffner, David Tarditi, Michael D. Smith:
Extending Object-Oriented Optimizations for Concurrent Programs. PACT 2007: 119-129 - [c34]Kathleen T. Durant, Michael D. Smith:
The Impact of Time on the Accuracy of Sentiment Classifiers Created from a Web Log Corpus. AAAI 2007: 1340-1346 - [c33]Rachel Greenstadt, Barbara J. Grosz, Michael D. Smith:
SSDPOP: improving the privacy of DCOP with secret sharing. AAMAS 2007: 171 - [c32]Vijay Janapa Reddi, Dan Connors, Robert Cohn, Michael D. Smith:
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications. CGO 2007: 74-88 - [c31]Meeta Sharma Gupta, Krishna K. Rangan, Michael D. Smith, Gu-Yeon Wei, David M. Brooks:
Towards a software approach to mitigate voltage emergencies. ISLPED 2007: 123-128 - 2006
- [c30]Kathleen T. Durant, Michael D. Smith:
Predicting the Political Sentiment of Web Log Posts Using Supervised Machine Learning Techniques Coupled with Feature Selection. WEBKDD 2006: 187-206 - [c29]Rachel Greenstadt, Michael D. Smith:
Collaborative Scheduling: Threats and Promises. WEIS 2006 - [c28]David J. Malan, Michael D. Smith:
Exploiting temporal consistency to reduce false positives in host-based, collaborative detection of worms. WORM 2006: 25-32 - 2005
- [c27]David Hiniker, Kim M. Hazelwood, Michael D. Smith:
Improving Region Selection in Dynamic Optimization Systems. MICRO 2005: 141-154 - [c26]Rachel Greenstadt, Michael D. Smith:
Protecting Personal Information: Obstacles and Directions. WEIS 2005 - [c25]David J. Malan, Michael D. Smith:
Host-based detection of worms through peer-to-peer cooperation. WORM 2005: 72-80 - 2004
- [c24]Michael D. Smith, Norman Ramsey, Glenn H. Holloway:
A generalized algorithm for graph-coloring register allocation. PLDI 2004: 277-288 - [c23]David J. Malan, Matt Welsh, Michael D. Smith:
A public-key infrastructure for key distribution in TinyOS based on elliptic curve cryptography. SECON 2004: 71-80 - 2003
- [c22]Stuart E. Schechter, Michael D. Smith:
How Much Security Is Enough to Stop a Thief?: The Economics of Outsider Theft via Computer Systems and Networks. Financial Cryptography 2003: 122-137 - [c21]Kim M. Hazelwood, Michael D. Smith:
Generational Cache Management of Code Traces in Dynamic Optimization Systems. MICRO 2003: 169-179 - [c20]Stuart E. Schechter, Michael D. Smith:
Access for sale: a new class of worm. WORM 2003: 19-23 - 2002
- [c19]Kim M. Hazelwood, Michael D. Smith:
Code Cache Management Schemes for Dynamic Optimizers. Interaction between Compilers and Computer Architectures 2002: 102-110 - 2000
- [c18]Michael D. Smith:
Overcoming the Challenges to Feedback-Directed Optimization. Dynamo 2000: 1-11 - 1999
- [c17]Gang Chen, Michael D. Smith:
Reorganizing global schedules for register allocation. International Conference on Supercomputing 1999: 408-416 - 1998
- [c16]Cliff Young, Michael D. Smith:
Better Global Scheduling Using Path Profiles. MICRO 1998: 115-123 - [c15]Omri Traub, Glenn H. Holloway, Michael D. Smith:
Quality and Speed in Linear-scan Register Allocation. PLDI 1998: 142-151 - 1997
- [c14]Nicholas C. Gloy, Trevor Blackwell, Michael D. Smith, Brad Calder:
Procedure Placement Using Temporal Ordering Information. MICRO 1997: 303-313 - [c13]Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith:
Near-optimal Intraprocedural Branch Alignment. PLDI 1997: 183-193 - [c12]Xiaolan Zhang, Zheng Wang, Nicholas C. Gloy, J. Bradley Chen, Michael D. Smith:
System Support for Automated Profiling and Optimization. SOSP 1997: 15-26 - 1996
- [c11]Nicholas C. Gloy, Cliff Young, J. Bradley Chen, Michael D. Smith:
An Analysis of Dynamic Branch Prediction Schemes on System Workloads. ISCA 1996: 12-21 - [c10]Mark Horowitz, Margaret Martonosi, Todd C. Mowry, Michael D. Smith:
Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors. ISCA 1996: 260-270 - 1995
- [c9]Cliff Young, Nicholas C. Gloy, Michael D. Smith:
A Comparative Analysis of Schemes for Correlated Branch Prediction. ISCA 1995: 276-286 - [c8]Nicholas C. Gloy, Michael D. Smith, Cliff Young:
Performance issues in correlated branch prediction schemes. MICRO 1995: 3-14 - [c7]J. Bradley Chen, Yasuhiro Endo, Kee Chan, David Mazières, Antonio Dias, Margo I. Seltzer, Michael D. Smith:
The Measured Performance of Personal Computer Operating Systems. SOSP 1995: 299-313 - 1994
- [c6]Cliff Young, Michael D. Smith:
Improving the Accuracy of Static Branch Prediction Using Branch Correlation. ASPLOS 1994: 232-241 - [c5]Rahul Razdan, Karl S. Brace, Michael D. Smith:
PRISC Software Acceleration Techniques. ICCD 1994: 145-149 - [c4]Rahul Razdan, Michael D. Smith:
A high-performance microarchitecture with hardware-programmable functional units. MICRO 1994: 172-180 - 1992
- [c3]Michael D. Smith, Mark Horowitz, Monica S. Lam:
Efficient Superscalar Performance Through Boosting. ASPLOS 1992: 248-259 - 1990
- [c2]Michael D. Smith, Monica S. Lam, Mark Horowitz:
Boosting Beyond Static Scheduling in a Superscalar Processor. ISCA 1990: 344-354 - 1989
- [c1]Michael D. Smith, Mike Johnson, Mark Horowitz:
Limits on Multiple Instruction Issue. ASPLOS 1989: 290-302
Parts in Books or Collections
- 2004
- [p1]Stuart E. Schechter, Rachel Greenstadt, Michael D. Smith:
Trusted Computing, Peer-to-Peer Distribution, and The Economics of Pirated Entertainment. Economics of Information Security 2004: 59-69
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-25 01:10 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:
