2026 Kathryn S. McKinley: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	71	1794	1737	906	871	250	17658

Research.com Recognitions

2011 - IEEE Fellow For contributions to compiler technologies
2008 - ACM Fellow For contributions to compilers and memory management.
2006 - ACM Senior Member
2006 - ACM Distinguished Member

Overview

Kathryn S. McKinley is affiliated with Google in the United States and works primarily in the field of computer science. Their research covers a range of subfields including computer networks and communications, hardware and architecture, general health professions, computer vision and pattern recognition, and artificial intelligence.

Their work often centers on topics such as parallel computing and optimization techniques, distributed and parallel computing systems, cloud computing and resource management, graph theory and algorithms, stroke rehabilitation and recovery, clinical practice guidelines implementation, and health policy implementation science.

Recent papers authored or co-authored include:

Combining Machine Learning and Lifetime-Based Resource Management for Memory Allocation and Beyond, 2024, Communications of the ACM
Workshop on Quantification, Communication, and Interpretation of Uncertainty in Simulation and Data Science, 2020, arXiv (Cornell University)
Acute post-stroke aphasia management: An implementation science study protocol using a behavioural approach to support practice change, 2022, International Journal of Language & Communication Disorders
Combining Machine Learning and Lifetime-Based Resource Management for Memory Allocation and Beyond, 2024, UNC Libraries
LAVA: Lifetime-Aware VM Allocation with Learned Distributions and Adaptation to Mispredictions, 2024, arXiv (Cornell University)

Frequent co-authors in their publications include Martin Maas, David G. Andersen, Michael Isard, Mohammad Mahdi Javanmard, and Colin Raffel.

McKinley's research has been published repeatedly in venues such as Communications of the ACM, arXiv (Cornell University), Proceedings of the ACM on Programming Languages, International Journal of Language & Communication Disorders, and UNC Libraries.

The scientist has been recognized with several professional distinctions including IEEE Fellow in 2011 for contributions to compiler technologies, ACM Fellow in 2008 for contributions to compilers and memory management, ACM Senior Member in 2006, and ACM Distinguished Member in 2006.

Best Publications

The DaCapo benchmarks: java benchmarking development and analysis

Stephen M. Blackburn;Robin Garner;Chris Hoffmann;Asjad M. Khang

1935
Citations
Improving data locality with loop transformations

Kathryn S. McKinley;Steve Carr;Chau-Wen Tseng

755
Citations
Hoard: a scalable memory allocator for multithreaded applications

Emery D. Berger;Kathryn S. McKinley;Robert D. Blumofe;Paul R. Wilson

713
Citations
Tile size selection using cache organization and data layout

Stephanie Coleman;Kathryn S. McKinley

577
Citations
Scaling to the end of silicon with EDGE architectures

D. Burger;S.W. Keckler;K.S. McKinley;M. Dahlin

529
Citations
Compiler optimizations for improving data locality

Steve Carr;Kathryn S. McKinley;Chau-Wen Tseng

424
Citations
Maximizing Loop Parallelism and Improving Data Locality via Loop Fusion and Distribution

Ken Kennedy;Kathryn S. McKinley

366
Citations
The Jikes research virtual machine project: building an open-source research community

B. Alpern;S. Augart;S. M. Blackburn;M. Butrico

349
Citations
Myths and realities: the performance impact of garbage collection

Stephen M. Blackburn;Perry Cheng;Kathryn S. McKinley

322
Citations
PACER: proportional detection of data races

Michael D. Bond;Katherine E. Coons;Kathryn S. McKinley

291
Citations
Oil and water? High performance garbage collection in Java with MMTk

Stephen M. Blackburn;Perry Cheng;Kathryn S. McKinley

253
Citations
Reconsidering custom memory allocation

Emery D. Berger;Benjamin G. Zorn;Kathryn S. McKinley

249
Citations
Type-based alias analysis

Amer Diwan;Kathryn S. McKinley;J. Eliot B. Moss

239
Citations
LASE: locating and applying systematic edits by learning from examples

Na Meng;Miryung Kim;Kathryn S. McKinley

236
Citations
Dynamic software updates: a VM-centric approach

Suriya Subramanian;Michael Hicks;Kathryn S. McKinley

236
Citations
Optimizing for parallelism and data locality

Ken Kennedy;Kathryn S. McKinley

233
Citations
Laminar: practical fine-grained decentralized information flow control

Indrajit Roy;Donald E. Porter;Michael D. Bond;Kathryn S. McKinley

227
Citations
Data Flow Analysis for Software Prefetching Linked Data Structures in Java

Brendon Cahoon;Kathryn S. McKinley

207
Citations
OOPSLA 2002: Reconsidering custom memory allocation

Emery D. Berger;Benjamin G. Zorn;Kathryn S. McKinley

206
Citations
Composing high-performance memory allocators

Emery D. Berger;Benjamin G. Zorn;Kathryn S. McKinley

203
Citations
The garbage collection advantage: improving program locality

Xianglong Huang;Stephen M. Blackburn;Kathryn S. McKinley;J Eliot B. Moss

203
Citations

Frequent Co-Authors

Doug Burger Microsoft (United States)

J. Eliot B. Moss University of Massachusetts Amherst

Stephen W. Keckler Nvidia (United States)

Ken Kennedy Rice University

Yuxiong He Microsoft (United States)

Emery D. Berger University of Massachusetts Amherst

Lieven Eeckhout Ghent University

Sameh Elnikety Microsoft (United States)

Keshav Pingali The University of Texas at Austin

Vitaly Shmatikov Cornell University

External Links

Wikipedia of Kathryn S. McKinley Personal website of Kathryn S. McKinley Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens the door to a variety of online degrees and career pathways. For those looking to enter the tech field quickly, easy certifications to get online can help you gain in-demand skills without a lengthy commitment. These certifications are ideal for anyone seeking fast entry into specialized jobs or wanting to supplement existing credentials.

If you're interested in advancing your education efficiently, consider the shortest masters degree programs online. These programs offer a streamlined curriculum, allowing you to earn a graduate degree in as little as a year. This flexibility is perfect for busy professionals or those eager to make a rapid career transition.

Unsure which degree will have the biggest impact? Explore the most useful masters degrees to identify pathways that provide strong ROI and align with current employer needs.

For a quicker alternative to a bachelor’s or master's degree, 1 year associate degree programs online can help kickstart your tech career. These programs are accessible, affordable, and designed for fast workforce entry or transfer to four-year universities.