2009 | ||
---|---|---|
50 | EE | Vijay Janapa Reddi, Meeta Sharma Gupta, Glenn H. Holloway, Gu-Yeon Wei, Michael D. Smith, David Brooks: Voltage emergency prediction: Using signatures to reduce operating margins. HPCA 2009: 18-29 |
2008 | ||
49 | EE | 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 |
48 | EE | David J. Malan, Matt Welsh, Michael D. Smith: Implementing public-key infrastructure for sensor networks. TOSN 4(4): (2008) |
2007 | ||
47 | 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 | |
46 | EE | Rachel Greenstadt, Barbara J. Grosz, Michael D. Smith: SSDPOP: improving the privacy of DCOP with secret sharing. AAMAS 2007: 171 |
45 | EE | Vijay Janapa Reddi, Dan Connors, Robert Cohn, Michael D. Smith: Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications. CGO 2007: 74-88 |
44 | EE | Meeta Sharma Gupta, Krishna K. Rangan, Michael D. Smith, Gu-Yeon Wei, David Brooks: Towards a software approach to mitigate voltage emergencies. ISLPED 2007: 123-128 |
43 | EE | Kelly Heffner, David Tarditi, Michael D. Smith: Extending Object-Oriented Optimizations for Concurrent Programs. PACT 2007: 119-129 |
42 | EE | Alexandra Fedorova, Margo I. Seltzer, Michael D. Smith: Improving Performance Isolation on Chip Multiprocessors via an Operating System Scheduler. PACT 2007: 25-38 |
2006 | ||
41 | EE | 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 |
40 | EE | David J. Malan, Michael D. Smith: Exploiting temporal consistency to reduce false positives in host-based, collaborative detection of worms. WORM 2006: 25-32 |
39 | EE | Kim M. Hazelwood, Michael D. Smith: Managing bounded code caches in dynamic binary optimization systems. TACO 3(3): 263-294 (2006) |
2005 | ||
38 | EE | David Hiniker, Kim M. Hazelwood, Michael D. Smith: Improving Region Selection in Dynamic Optimization Systems. MICRO 2005: 141-154 |
37 | EE | David J. Malan, Michael D. Smith: Host-based detection of worms through peer-to-peer cooperation. WORM 2005: 72-80 |
2004 | ||
36 | EE | Kartik Hosanagar, Ramayya Krishnan, Michael D. Smith, John Chuang: Optimal Pricing of Content Delivery Network (CDN) Services. HICSS 2004 |
35 | EE | Ramayya Krishnan, Michael D. Smith, Zhulei Tang, Rahul Telang: The Impact of Free-Riding on Peer-to-Peer Networks. HICSS 2004 |
34 | Anindya Ghose, Michael D. Smith, Rahul Telang: Price Elasticities and Social Welfare in Secondary Electronic Markets. ICIS 2004: 611-614 | |
33 | EE | Michael D. Smith, Norman Ramsey, Glenn H. Holloway: A generalized algorithm for graph-coloring register allocation. PLDI 2004: 277-288 |
2003 | ||
32 | EE | 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 |
31 | Neveen I. Farag, Michael D. Smith, M. S. Krishnan: The Consumer Online Purchase Decision: A Model of Consideration Set Formation and Buyer Conversion Rate Across Market Leaders and Market Followers. ICIS 2003: 283-295 | |
30 | EE | Kim M. Hazelwood, Michael D. Smith: Generational Cache Management of Code Traces in Dynamic Optimization Systems. MICRO 2003: 169-179 |
29 | EE | Stuart E. Schechter, Michael D. Smith: Access for sale: a new class of worm. WORM 2003: 19-23 |
2002 | ||
28 | EE | Kim M. Hazelwood, Michael D. Smith: Code Cache Management Schemes for Dynamic Optimizers. Interaction between Compilers and Computer Architectures 2002: 102-110 |
2001 | ||
27 | EE | Karen Clay, Michael D. Smith, Eric Wolff: Lead, Follow, or Go Your Own Way: Empirical Evidence Against Leader-Follower Behavior in Electronic Markets CoRR cs.CY/0109080: (2001) |
26 | EE | Atip Asvanund, Karen Clay, Ramayya Krishnan, Michael D. Smith: Bigger May Not Be Better: An Empirical Analysis of Optimal Membership Rules in Peer-To-Peer Networks CoRR cs.CY/0109106: (2001) |
2000 | ||
25 | Michael D. Smith: Overcoming the Challenges to Feedback-Directed Optimization. Dynamo 2000: 1-11 | |
1999 | ||
24 | EE | Gang Chen, Michael D. Smith: Reorganizing global schedules for register allocation. International Conference on Supercomputing 1999: 408-416 |
23 | EE | Cliff Young, Michael D. Smith: Static correlated branch prediction. ACM Trans. Program. Lang. Syst. 21(5): 1028-1075 (1999) |
22 | EE | Nicholas C. Gloy, Michael D. Smith: Procedure placement using temporal-ordering information. ACM Trans. Program. Lang. Syst. 21(5): 977-1027 (1999) |
1998 | ||
21 | EE | Cliff Young, Michael D. Smith: Better Global Scheduling Using Path Profiles. MICRO 1998: 115-123 |
20 | Omri Traub, Glenn H. Holloway, Michael D. Smith: Quality and Speed in Linear-scan Register Allocation. PLDI 1998: 142-151 | |
19 | EE | 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) |
18 | EE | Stuart E. Schechter, Murali Krishnan, Michael D. Smith: Using Path Profiles to Predict HTTP Requests. Computer Networks 30(1-7): 457-467 (1998) |
1997 | ||
17 | EE | Nicholas C. Gloy, Trevor Blackwell, Michael D. Smith, Brad Calder: Procedure Placement Using Temporal Ordering Information. MICRO 1997: 303-313 |
16 | Cliff Young, David S. Johnson, David R. Karger, Michael D. Smith: Near-optimal Intraprocedural Branch Alignment. PLDI 1997: 183-193 | |
15 | Xiaolan Zhang, Zheng Wang, Nicholas C. Gloy, J. Bradley Chen, Michael D. Smith: System Support for Automated Profiling and Optimization. SOSP 1997: 15-26 | |
14 | 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. IEEE Computer 30(12): 51-58 (1997) | |
1996 | ||
13 | EE | Mark Horowitz, Margaret Martonosi, Todd C. Mowry, Michael D. Smith: Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors. ISCA 1996: 260-270 |
12 | EE | 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) |
11 | Michael D. Smith, Pinaki Mazumder: Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays. IEEE Trans. Computers 45(1): 109-115 (1996) | |
1995 | ||
10 | EE | Cliff Young, Nicholas C. Gloy, Michael D. Smith: A Comparative Analysis of Schemes for Correlated Branch Prediction. ISCA 1995: 276-286 |
9 | EE | Nicholas C. Gloy, Michael D. Smith, Cliff Young: Performance issues in correlated branch prediction schemes. MICRO 1995: 3-14 |
8 | 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 | ||
7 | Cliff Young, Michael D. Smith: Improving the Accuracy of Static Branch Prediction Using Branch Correlation. ASPLOS 1994: 232-241 | |
6 | Rahul Razdan, Karl S. Brace, Michael D. Smith: PRISC Software Acceleration Techniques. ICCD 1994: 145-149 | |
5 | Annie S. Wu, Robert K. Lindsay, Michael D. Smith: Studies on the Effect of Non-coding Segments on the Genetic Algorithm. ICTAI 1994: 744-747 | |
4 | EE | Rahul Razdan, Michael D. Smith: A high-performance microarchitecture with hardware-programmable functional units. MICRO 1994: 172-180 |
1992 | ||
3 | Michael D. Smith, Mark Horowitz, Monica S. Lam: Efficient Superscalar Performance Through Boosting. ASPLOS 1992: 248-259 | |
1990 | ||
2 | Michael D. Smith, Monica S. Lam, Mark Horowitz: Boosting Beyond Static Scheduling in a Superscalar Processor. ISCA 1990: 344-354 | |
1989 | ||
1 | Michael D. Smith, Mike Johnson, Mark Horowitz: Limits on Multiple Instruction Issue. ASPLOS 1989: 290-302 |