The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Kathryn S. McKinley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Steve Carr, Kathryn S. McKinley, Chau-Wen Tseng
    Compiler Optimizations for Improving Data Locality. [Citation Graph (1, 0)][DBLP]
    ASPLOS, 1994, pp:252-262 [Conf]
  2. Kathryn S. McKinley
    Polar opposites: next generation languages and architectures. [Citation Graph (0, 0)][DBLP]
    Memory System Performance, 2004, pp:35- [Conf]
  3. Brendon Cahoon, Kathryn S. McKinley
    Data Flow Analysis for Software Prefetching Linked Data Structures in Java. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 2001, pp:280-291 [Conf]
  4. Xianglong Huang, Zhenlin Wang, Kathryn S. McKinley
    Compiling for the Impulse Memory Controller. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 2001, pp:141-150 [Conf]
  5. Ramadass Nagarajan, Sundeep K. Kushwaha, Doug Burger, Kathryn S. McKinley, Calvin Lin, Stephen W. Keckler
    Static Placement, Dynamic Issue (SPDI) Scheduling for EDGE Architectures. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 2004, pp:74-84 [Conf]
  6. Zhenlin Wang, Kathryn S. McKinley, Arnold L. Rosenberg, Charles C. Weems
    Using the Compiler to Improve Cache Replacement Decisions. [Citation Graph (0, 0)][DBLP]
    IEEE PACT, 2002, pp:199-0 [Conf]
  7. Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe, Paul R. Wilson
    Hoard: A Scalable Memory Allocator for Multithreaded Applications. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 2000, pp:117-128 [Conf]
  8. Kathryn S. McKinley, Olivier Temam
    A Quantitative Analysis of Loop Nest Locality. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 1996, pp:94-104 [Conf]
  9. Michael D. Bond, Kathryn S. McKinley
    Bell: bit-encoding online memory leak detection. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 2006, pp:61-72 [Conf]
  10. Katherine E. Coons, Xia Chen, Doug Burger, Kathryn S. McKinley, Sundeep K. Kushwaha
    A spatial path scheduling algorithm for EDGE architectures. [Citation Graph (0, 0)][DBLP]
    ASPLOS, 2006, pp:129-140 [Conf]
  11. Rezaul Alam Chowdhury, Peter Djeu, Brendon Cahoon, James H. Burrill, Kathryn S. McKinley
    The Limits of Alias Analysis for Scalar Optimizations. [Citation Graph (0, 0)][DBLP]
    CC, 2004, pp:24-38 [Conf]
  12. Michael D. Bond, Kathryn S. McKinley
    Practical Path Profiling for Dynamic Optimizers. [Citation Graph (0, 0)][DBLP]
    CGO, 2005, pp:205-216 [Conf]
  13. Aaron Smith, Jon Gibson, Bertrand A. Maher, Nicholas Nethercote, Bill Yoder, Doug Burger, Kathryn S. McKinley, James H. Burrill
    Compiling for EDGE Architectures. [Citation Graph (0, 0)][DBLP]
    CGO, 2006, pp:185-195 [Conf]
  14. Götz Lindenmaier, Kathryn S. McKinley, Olivier Temam
    Load Scheduling with Profile Information. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:223-233 [Conf]
  15. Zhihong Lu, Kathryn S. McKinley, Brendon Cahoon
    The Hardware/Software Balancing Act for Information Retrieval on Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:521-527 [Conf]
  16. Ken Kennedy, Kathryn S. McKinley
    Optimizing for parallelism and data locality. [Citation Graph (0, 0)][DBLP]
    ICS, 1992, pp:323-334 [Conf]
  17. Ken Kennedy, Kathryn S. McKinley, Chau-Wen Tseng
    Analysis and transformation in the ParaScope editor. [Citation Graph (0, 0)][DBLP]
    ICS, 1991, pp:433-447 [Conf]
  18. Kathryn S. McKinley
    Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors. [Citation Graph (0, 0)][DBLP]
    International Conference on Supercomputing, 1994, pp:54-63 [Conf]
  19. Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S. McKinley
    Low-power, low-complexity instruction issue using compiler assistance. [Citation Graph (0, 0)][DBLP]
    ICS, 2005, pp:209-218 [Conf]
  20. Stephen M. Blackburn, Perry Cheng, Kathryn S. McKinley
    Oil and Water? High Performance Garbage Collection in Java with MMTk. [Citation Graph (0, 0)][DBLP]
    ICSE, 2004, pp:137-146 [Conf]
  21. Zhenlin Wang, Doug Burger, Steven K. Reinhardt, Kathryn S. McKinley, Charles C. Weems
    Guided Region Prefetching: A Cooperative Hardware/Software Approach. [Citation Graph (0, 0)][DBLP]
    ISCA, 2003, pp:388-398 [Conf]
  22. Kartik K. Agaram, Stephen W. Keckler, Calvin Lin, Kathryn S. McKinley
    Decomposing memory performance: data structures and phases. [Citation Graph (0, 0)][DBLP]
    ISMM, 2006, pp:95-103 [Conf]
  23. Stephen Blackburn, Kathryn S. McKinley
    In or out?: putting write barriers in their place. [Citation Graph (0, 0)][DBLP]
    MSP/ISMM, 2002, pp:281-290 [Conf]
  24. Xianglong Huang, Stephen M. Blackburn, David Grove, Kathryn S. McKinley
    Fast and efficient partial code reordering: taking advantage of dynamic recompilatior. [Citation Graph (0, 0)][DBLP]
    ISMM, 2006, pp:184-192 [Conf]
  25. Darko Stefanovic, Kathryn S. McKinley, J. Eliot B. Moss
    On Models for Object Lifetimes. [Citation Graph (0, 0)][DBLP]
    ISMM, 2000, pp:137-142 [Conf]
  26. Maria Jump, Stephen M. Blackburn, Kathryn S. McKinley
    Dynamic object sampling for pretenuring. [Citation Graph (0, 0)][DBLP]
    ISMM, 2004, pp:152-162 [Conf]
  27. Darko Stefanovic, Matthew Hertz, Stephen Blackburn, Kathryn S. McKinley, J. Eliot B. Moss
    Older-first garbage collection in practice: evaluation in Java Virtual Machine. [Citation Graph (0, 0)][DBLP]
    MSP/ISMM, 2002, pp:25-36 [Conf]
  28. Brendon Cahoon, Kathryn S. McKinley
    Simple and effective array prefetching in Java. [Citation Graph (0, 0)][DBLP]
    Java Grande, 2002, pp:86-95 [Conf]
  29. Ken Kennedy, Kathryn S. McKinley
    Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution. [Citation Graph (0, 0)][DBLP]
    LCPC, 1993, pp:301-320 [Conf]
  30. Kathryn S. McKinley, Sharad Singhai, Glen E. Weaver, Charles C. Weems
    Compiler Architectures for Heterogeneous Systems. [Citation Graph (0, 0)][DBLP]
    LCPC, 1995, pp:434-449 [Conf]
  31. Michael D. Bond, Kathryn S. McKinley
    Continuous Path and Edge Profiling. [Citation Graph (0, 0)][DBLP]
    MICRO, 2005, pp:130-140 [Conf]
  32. Bertrand A. Maher, Aaron Smith, Doug Burger, Kathryn S. McKinley
    Merging Head and Tail Duplication for Convergent Hyperblock Formation. [Citation Graph (0, 0)][DBLP]
    MICRO, 2006, pp:65-76 [Conf]
  33. Aaron Smith, Ramadass Nagarajan, Karthikeyan Sankaralingam, Robert G. McDonald, Doug Burger, Stephen W. Keckler, Kathryn S. McKinley
    Dataflow Predication. [Citation Graph (0, 0)][DBLP]
    MICRO, 2006, pp:89-102 [Conf]
  34. Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley
    Reconsidering custom memory allocation. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2002, pp:1-12 [Conf]
  35. Stephen M. Blackburn, Robin Garner, Chris Hoffmann, Asjad M. Khang, Kathryn S. McKinley, Rotem Bentzur, Amer Diwan, Daniel Feinberg, Daniel Frampton, Samuel Z. Guyer, Martin Hirzel, Antony L. Hosking, Maria Jump, Han Bok Lee, J. Eliot B. Moss, Aashish Phansalkar, Darko Stefanovic, Thomas VanDrunen, Daniel von Dincklage, Ben Wiedermann
    The DaCapo benchmarks: java benchmarking development and analysis. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2006, pp:169-190 [Conf]
  36. Stephen Blackburn, Kathryn S. McKinley
    Ulterior reference counting: fast garbage collection without a long wait. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2003, pp:344-358 [Conf]
  37. Stephen Blackburn, Sharad Singhai, Matthew Hertz, Kathryn S. McKinley, J. Eliot B. Moss
    Pretenuring for Java. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2001, pp:342-352 [Conf]
  38. Amer Diwan, J. Eliot B. Moss, Kathryn S. McKinley
    Simple and Effective Analysis of Statically Typed Object-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1996, pp:292-305 [Conf]
  39. Samuel Z. Guyer, Kathryn S. McKinley
    Finding your cronies: static analysis for dynamic object colocation. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2004, pp:237-250 [Conf]
  40. Xianglong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J. Eliot B. Moss, Zhenlin Wang, Perry Cheng
    The garbage collection advantage: improving program locality. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2004, pp:69-80 [Conf]
  41. Darko Stefanovic, Kathryn S. McKinley, J. Eliot B. Moss
    Age-Based Garbage Collection. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 1999, pp:370-381 [Conf]
  42. Stephen Blackburn, Richard Jones, Kathryn S. McKinley, J. Eliot B. Moss
    Beltway: Getting Around Garbage Collection Gridlock. [Citation Graph (0, 0)][DBLP]
    PLDI, 2002, pp:153-164 [Conf]
  43. Emery D. Berger, Benjamin G. Zorn, Kathryn S. McKinley
    Composing High-Performance Memory Allocators. [Citation Graph (0, 0)][DBLP]
    PLDI, 2001, pp:114-124 [Conf]
  44. Stephanie Coleman, Kathryn S. McKinley
    Tile Size Selection Using Cache Organization and Data Layout. [Citation Graph (0, 0)][DBLP]
    PLDI, 1995, pp:279-290 [Conf]
  45. Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
    Type-Based Alias Analysis. [Citation Graph (0, 0)][DBLP]
    PLDI, 1998, pp:106-117 [Conf]
  46. Samuel Z. Guyer, Kathryn S. McKinley, Daniel Frampton
    Free-Me: a static analysis for automatic individual object reclamation. [Citation Graph (0, 0)][DBLP]
    PLDI, 2006, pp:364-375 [Conf]
  47. Maria Jump, Kathryn S. McKinley
    Cork: dynamic memory leak detection for garbage-collected languages. [Citation Graph (0, 0)][DBLP]
    POPL, 2007, pp:31-38 [Conf]
  48. Mary W. Hall, Timothy J. Harvey, Ken Kennedy, Nathaniel McIntosh, Kathryn S. McKinley, Jeffrey D. Oldham, Michael H. Paleczny, Gerald Roth
    Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool. [Citation Graph (0, 0)][DBLP]
    PPOPP, 1993, pp:33-43 [Conf]
  49. Mary W. Hall, Ken Kennedy, Kathryn S. McKinley
    Interprocedural transformations for parallel code generation. [Citation Graph (0, 0)][DBLP]
    SC, 1991, pp:424-434 [Conf]
  50. Ken Kennedy, Kathryn S. McKinley
    Loop distribution with arbitrary control flow. [Citation Graph (0, 0)][DBLP]
    SC, 1990, pp:407-416 [Conf]
  51. Brendon Cahoon, Kathryn S. McKinley
    Performance Evaluation of a Distributed Architecture for Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1996, pp:110-118 [Conf]
  52. Zhihong Lu, Kathryn S. McKinley
    Partial collection replication versus caching for information retrieval systems. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2000, pp:248-255 [Conf]
  53. Zhihong Lu, Kathryn S. McKinley
    Partial Replica Selection Based on Relevance for Information Retrieval. [Citation Graph (0, 0)][DBLP]
    SIGIR, 1999, pp:97-104 [Conf]
  54. Stephen M. Blackburn, Perry Cheng, Kathryn S. McKinley
    Myths and realities: the performance impact of garbage collection. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2004, pp:25-36 [Conf]
  55. Matthew Hertz, Stephen Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, Darko Stefanovic
    Error-free garbage collection traces: how to cheat and not get caught. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS, 2002, pp:140-151 [Conf]
  56. Xianglong Huang, Brian T. Lewis, Kathryn S. McKinley
    Dynamic code management: improving whole program code locality in managed runtimes. [Citation Graph (0, 0)][DBLP]
    VEE, 2006, pp:133-143 [Conf]
  57. Sharad Singhai, Kathryn S. McKinley
    A Parametrized Loop Fusion Algorithm for Improving Parallelism and Cache Locality. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1997, v:40, n:6, pp:340-355 [Journal]
  58. Doug Burger, Stephen W. Keckler, Kathryn S. McKinley, Michael Dahlin, Lizy Kurian John, Calvin Lin, Charles R. Moore, James H. Burrill, Robert G. McDonald, William Yode
    Scaling to the End of Silicon with EDGE Architectures. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2004, v:37, n:7, pp:44-55 [Journal]
  59. Brendon Cahoon, Kathryn S. McKinley
    Recurrence analysis for effective array prefetching in Java. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2005, v:17, n:5-6, pp:589-616 [Journal]
  60. Bowen Alpern, Steve Augart, Stephen M. Blackburn, Maria A. Butrico, Anthony Cocchi, Perry Cheng, Julian Dolby, Stephen J. Fink, David Grove, Michael Hind, Kathryn S. McKinley, Mark F. Mergen, J. Eliot B. Moss, Ton Anh Ngo, Vivek Sarkar, Martin Trapp
    The Jikes Research Virtual Machine project: Building an open-source research community. [Citation Graph (0, 0)][DBLP]
    IBM Systems Journal, 2005, v:44, n:2, pp:399-418 [Journal]
  61. Zhihong Lu, Kathryn S. McKinley
    Partial Collection Replication for Information Retrieval. [Citation Graph (0, 0)][DBLP]
    Inf. Retr., 2003, v:6, n:2, pp:159-198 [Journal]
  62. Kathryn S. McKinley, Olivier Temam
    Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1999, v:17, n:4, pp:288-336 [Journal]
  63. Brendon Cahoon, Kathryn S. McKinley, Zhihong Lu
    Evaluating the performance of distributed architectures for information retrieval using a variety of workloads. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Inf. Syst., 2000, v:18, n:1, pp:1-43 [Journal]
  64. Amer Diwan, Kathryn S. McKinley, J. Eliot B. Moss
    Using types to analyze and optimize object-oriented programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2001, v:23, n:1, pp:30-72 [Journal]
  65. Matthew Hertz, Stephen M. Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, Darko Stefanovic
    Generating object lifetime traces with Merlin. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:3, pp:476-516 [Journal]
  66. Kathryn S. McKinley, Steve Carr, Chau-Wen Tseng
    Improving Data Locality with Loop Transformations. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:4, pp:424-453 [Journal]
  67. Stephen M. Blackburn, Matthew Hertz, Kathryn S. McKinley, J. Eliot B. Moss, Ting Yang
    Profile-based pretenuring. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:1, pp:- [Journal]
  68. Ken Kennedy, Kathryn S. McKinley, Chau-Wen Tseng
    Interactive Parallel Programming using the ParaScope Editor. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1991, v:2, n:3, pp:329-341 [Journal]
  69. Kathryn S. McKinley
    A Compiler Optimization Algorithm for Shared-Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:769-787 [Journal]
  70. Byeongcheol Lee, Kevin Resnick, Michael D. Bond, Kathryn S. McKinley
    Correcting the Dynamic Call Graph Using Control-Flow Constraints. [Citation Graph (0, 0)][DBLP]
    CC, 2007, pp:80-95 [Conf]
  71. Michael D. Bond, Nicholas Nethercote, Stephen W. Kent, Samuel Z. Guyer, Kathryn S. McKinley
    Tracking bad apples: reporting the origin of null and undefined value errors. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2007, pp:405-422 [Conf]
  72. Bassem Elkarablieh, Sarfraz Khurshid, Duy Vu, Kathryn S. McKinley
    Starc: static analysis for efficient repair of complex data. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2007, pp:387-404 [Conf]
  73. Michael D. Bond, Kathryn S. McKinley
    Probabilistic calling context. [Citation Graph (0, 0)][DBLP]
    OOPSLA, 2007, pp:97-112 [Conf]
  74. Mark Grechanik, Kathryn S. McKinley, Dewayne E. Perry
    Recovering and using use-case-diagram-to-source-code traceability links. [Citation Graph (0, 0)][DBLP]
    ESEC/SIGSOFT FSE, 2007, pp:95-104 [Conf]
  75. Kathryn S. McKinley, Keshav Pingali
    Editorial: A changing of the guard. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:6, pp:- [Journal]

  76. Feature selection and policy optimization for distributed instruction placement using reinforcement learning. [Citation Graph (, )][DBLP]


  77. Evolving Compiler Heuristics to Manage Communication and Contention. [Citation Graph (, )][DBLP]


  78. Leak pruning. [Citation Graph (, )][DBLP]


  79. An evaluation of the TRIPS computer system. [Citation Graph (, )][DBLP]


  80. HeDGE: Hybrid Dataflow Graph Execution in the Issue Logic. [Citation Graph (, )][DBLP]


  81. No bit left behind: the limits of heap data compression. [Citation Graph (, )][DBLP]


  82. Dynamic shape analysis via degree metrics. [Citation Graph (, )][DBLP]


  83. Register Bank Assignment for Spatially Partitioned Processors. [Citation Graph (, )][DBLP]


  84. Strategies for mapping dataflow blocks to distributed hardware. [Citation Graph (, )][DBLP]


  85. Tolerating memory leaks. [Citation Graph (, )][DBLP]


  86. A concurrent dynamic analysis framework for multicore hardware. [Citation Graph (, )][DBLP]


  87. Debug all your code: portable mixed-environment debugging. [Citation Graph (, )][DBLP]


  88. Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance. [Citation Graph (, )][DBLP]


  89. Dynamic software updates: a VM-centric approach. [Citation Graph (, )][DBLP]


  90. Laminar: practical fine-grained decentralized information flow control. [Citation Graph (, )][DBLP]


  91. Jinn: synthesizing dynamic bug detectors for foreign language interfaces. [Citation Graph (, )][DBLP]


  92. PACER: proportional detection of data races. [Citation Graph (, )][DBLP]


  93. Z-rays: divide arrays and conquer speed and flexibility. [Citation Graph (, )][DBLP]


  94. Wake up and smell the coffee: evaluation methodology for the 21st century. [Citation Graph (, )][DBLP]


  95. Analysis and transformation in an interactive parallel programming tool. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002