Kathryn S. McKinley
| Kathryn S. McKinley | |
|---|---|
Kathryn S. McKinley
|
|
| Born |
January 10, 1962 Owensboro, Kentucky, US |
| Nationality | American |
| Fields | Computer Science |
| Institutions |
Microsoft The University of Texas at Austin University of Massachusetts Amherst |
| Alma mater | Rice University |
| Doctoral advisor | Ken Kennedy |
| Doctoral students | Sooel Son Katherine E Coons Byeongcheol Lee Behnam Robatmili Jennifer Sartor Bertrand Maher Suriya Subramanian Jungwoo Ha Michael Bond Xianglong Huang Emery Berger Zhenlin Wang Brendon Cahoon Sharad Singhai Zhihong Lu Darko Stefanovic Amer Diwan |
| Known for |
Locality & Parallelism Optimizations |
| Notable awards |
ACM Fellow (2008) IEEE Fellow (2011) |
|
Website www |
|
Locality & Parallelism Optimizations
Hoard memory allocator
DaCapo Java Benchmarks
Immix Mark-Region Garbage Collector
Kathryn S. McKinley is an American computer scientist noted for her research on compilers, runtime systems, and computer architecture. She is also known for her leadership in broadening participation in computing. McKinely was co-chair of CRA-W from 2011 to 2014.
McKinley received a B.A. in computer science and engineering from Rice University in 1985. She went on to get a M.S. in computer science from Rice University in 1990 and then a Ph.D in computer science from Rice University in 1992.
She joined the Department of Computer Science at the University of Massachusetts Amherst as an assistant professor in 1993. While there she was promoted to associate professor in 1999. In 2001, she moved to the University of Texas at Austin as an associate professor. In 2005, she was promoted to professor and in 2010 to endowed professor in computer science. In 2011 she moved to Microsoft Research as a Principal Researcher.
McKinley is married to Scotty Strahan; they have three boys: Cooper, Dylan, and Wyatt Strahan.
She and her colleagues introduced the first general purpose model and optimization framework based on dependences and cache line reuse for improving the cache locality of dense matrix algorithms using loop permutation, loop reversal, fusion, and distribution. McKinley and her advisor, Ken Kennedy showed how to use this model to introduce parallelism with locality and eliminate false sharing. This work was selected in 2014 for the ICS 25th Anniversary Volume.
...
Wikipedia