| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Todd C. Mowry Brian Kirby , Jason Campbell , Burak Aksak , Padmanabhan Pillai , James F. Hoburg , Todd C. Mowry, Seth Copen Goldstein : Catoms: Moving Robots Without Moving Parts. AAAI 2005 : 1730-1731 Christopher Olston , Amit Manjhi , Charles Garrod , Anastassia Ailamaki , Bruce M. Maggs , Todd C. Mowry: A Scalability Service for Dynamic Web Applications. CIDR 2005 : 56-69 Burak Aksak , Preethi Srinivas Bhat , Jason Campbell , Michael DeRosa , Stanislav Funiak , Phillip B. Gibbons , Seth Copen Goldstein , Carlos Guestrin , Ashish Gupta , Casey Helfrich , James F. Hoburg , Brian Kirby , James Kuffner , Peter Lee , Todd C. Mowry, Padmanabhan Pillai , Ram Ravichandran , Benjamin D. Rister , Srinivasan Seshan , Metin Sitti , Haifeng Yu : Claytronics: highly scalable communications, sensing, and actuation networks. SenSys 2005 : 299 Christopher B. Colohan , Anastassia Ailamaki , J. Gregory Steffan , Todd C. Mowry: Optimistic Intra-Transaction Parallelism on Chip Multiprocessors. VLDB 2005 : 73-84 Shimin Chen , Anastassia Ailamaki , Phillip B. Gibbons , Todd C. Mowry: Inspector Joins. VLDB 2005 : 817-828 J. Gregory Steffan , Christopher B. Colohan , Antonia Zhai , Todd C. Mowry: The STAMPede approach to thread-level speculation. ACM Trans. Comput. Syst. 23 (3): 253-300 (2005) Seth Copen Goldstein , Jason Campbell , Todd C. Mowry: Programmable Matter. IEEE Computer 38 (6): 99-101 (2005) Antonia Zhai , Christopher B. Colohan , J. Gregory Steffan , Todd C. Mowry: Compiler Optimization of Memory-Resident Value Communication Between Speculative Threads. CGO 2004 : 39-52 Shimin Chen , Anastassia Ailamaki , Phillip B. Gibbons , Todd C. Mowry: Improving Hash Join Performance through Prefetching. ICDE 2004 : 116-127 Antonia Zhai , Christopher B. Colohan , J. Gregory Steffan , Todd C. Mowry: Compiler optimization of scalar value communication between speculative threads. ASPLOS 2002 : 171-183 J. Gregory Steffan , Christopher B. Colohan , Antonia Zhai , Todd C. Mowry: Improving Value Communication for Thread-Level Speculation. HPCA 2002 : 65- Shimin Chen , Phillip B. Gibbons , Todd C. Mowry, Gary Valentin : Fractal prefetching B±Trees: optimizing both cache and disk performance. SIGMOD Conference 2002 : 157-168 Shimin Chen , Phillip B. Gibbons , Todd C. Mowry: Improving Index Performance through Prefetching. SIGMOD Conference 2001 : 235-246 Chi-Keung Luk , Todd C. Mowry: Architectural and compiler support for effective instruction prefetching: a cooperative approach. ACM Trans. Comput. Syst. 19 (1): 71-109 (2001) Angela Demke Brown , Todd C. Mowry, Orran Krieger : Compiler-based I/O prefetching for out-of-core applications. ACM Trans. Comput. Syst. 19 (2): 111-170 (2001) Todd C. Mowry, Sherwyn R. Ramkissoon : Software-Controlled Multithreading Using Informing Memory Operations. HPCA 2000 : 121-132 J. Gregory Steffan , Christopher B. Colohan , Antonia Zhai , Todd C. Mowry: A scalable approach to thread-level speculation. ISCA 2000 : 1-12 Angela Demke Brown , Todd C. Mowry: Taming the Memory Hogs: Using Compiler-Inserted Releases to Manage Physical Memory Intelligently. OSDI 2000 : 31-44 Todd C. Mowry, Chi-Keung Luk : Understanding Why Correlation Profiling Improves the Predictability of Data Cache Misses in Nonnumeric Applications. IEEE Trans. Computers 49 (4): 369-384 (2000) Chi-Keung Luk , Todd C. Mowry: Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation. ISCA 1999 : 88-99 Chi-Keung Luk , Todd C. Mowry: Automatic Compiler-Inserted Prefetching for Pointer-Based Applications. IEEE Trans. Computers 48 (2): 134-141 (1999) J. Gregory Steffan , Todd C. Mowry: The Potential for Using Thread-Level Data Speculation to Facilitate Automatic Parallelization. HPCA 1998 : 2-13 Chi-Keung Luk , Todd C. Mowry: Cooperative Prefetching: Compiler and Hardware Support for Effective Instruction Prefetching in Modern Processors. MICRO 1998 : 182-194 Todd C. Mowry: Tolerating Latency in Multiprocessors Through Compiler-Inserted Prefetching. ACM Trans. Comput. Syst. 16 (1): 55-92 (1998) 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) Todd C. Mowry, Chi-Keung Luk : Predicting Data Cache Misses in Non-Numeric Applications through Correlation Profiling. MICRO 1997 : 314-320 Chi-Keung Luk , Todd C. Mowry: Compiler-Based Prefetching for Recursive Data Structures. ASPLOS 1996 : 222-233 Edouard Bugnion , Jennifer-Ann M. Anderson , Todd C. Mowry, Mendel Rosenblum , Monica S. Lam : Compiler-Directed Page Coloring for Multiprocessors. ASPLOS 1996 : 244-255 Mark Horowitz , Margaret Martonosi , Todd C. Mowry, Michael D. Smith : Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors. ISCA 1996 : 260-270 Todd C. Mowry, Angela K. Demke , Orran Krieger : Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications. OSDI 1996 : 3-17 Todd C. Mowry, Monica S. Lam , Anoop Gupta : Design and Evaluation of a Compiler Algorithm for Prefetching. ASPLOS 1992 : 62-73 Anoop Gupta , John L. Hennessy , Kourosh Gharachorloo , Todd C. Mowry, Wolf-Dietrich Weber : Comparative Evaluation of Latency Reducing and Tolerating Techniques. ISCA 1991 : 254-263 Todd C. Mowry, Anoop Gupta : Tolerating Latency Through Software-Controlled Prefetching in Shared-Memory Multiprocessors. J. Parallel Distrib. Comput. 12 (2): 87-106 (1991) Anoop Gupta , Wolf-Dietrich Weber , Todd C. Mowry: Reducing Memory and Traffic Requirements for Scalable Directory-Based Cache Coherence Schemes. ICPP (1) 1990 : 312-321 1 [ 26 ] [ 30 ] [ 31 ] [ 33 ] 2 [ 32 ] [ 34 ] 3 [ 7 ] 4 [ 32 ] 5 [ 17 ] [ 20 ] 6 [ 7 ] 7 [ 28 ] [ 32 ] [ 34 ] 8 [ 22 ] [ 23 ] [ 26 ] [ 30 ] 9 [ 18 ] [ 24 ] [ 25 ] [ 27 ] [ 29 ] [ 31 ] 10 [ 32 ] 11 [ 5 ] 12 [ 32 ] 13 [ 33 ] 14 [ 3 ] 15 [ 22 ] [ 23 ] [ 26 ] [ 30 ] [ 32 ] 16 [ 28 ] [ 32 ] [ 34 ] 17 [ 32 ] 18 [ 1 ] [ 2 ] [ 3 ] [ 4 ] 19 [ 32 ] 20 [ 32 ] 21 [ 3 ] 22 [ 32 ] [ 34 ] 23 [ 6 ] [ 10 ] 24 [ 32 ] [ 34 ] 25 [ 5 ] [ 20 ] 26 [ 32 ] 27 [ 4 ] [ 7 ] 28 [ 32 ] 29 [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 15 ] [ 16 ] [ 21 ] 30 [ 33 ] 31 [ 33 ] 32 [ 6 ] [ 10 ] 33 [ 33 ] 34 [ 32 ] [ 34 ] 35 [ 19 ] 36 [ 32 ] 37 [ 32 ] 38 [ 7 ] 39 [ 32 ] 40 [ 32 ] 41 [ 6 ] [ 10 ] 42 [ 13 ] [ 18 ] [ 24 ] [ 25 ] [ 27 ] [ 29 ] [ 31 ] 43 [ 23 ] 44 [ 1 ] [ 3 ] 45 [ 32 ] 46 [ 18 ] [ 24 ] [ 25 ] [ 27 ] [ 29 ]  ©2006 Association for Computing Machinery |
