BibSLEIGH — Ken

Travelled to:

1 × United Kingdom
17 × USA
2 × Germany
3 × Canada

Collaborated with:

K.D.Cooper D.Callahan R.v.Hanxleden R.Allen V.Balasundaram L.Torczon J.R.Allen S.Carr C.Ding P.Briggs L.Zucconi S.K.Warren ∅ C.Koelbel Q.Yi V.S.Adve N.Nedeljkovic A.Sethi A.Porterfield G.Goff C.Tseng J.Subhlok M.H.Paleczny T.J.Harvey Z.Budimlic G.Fox U.Kremer C.Porterfield J.D.Warren S.Browne J.Dongarra T.Rowan R.Bordawekar A.N.Choudhary T.S.Oberg S.W.Reeves A.Mandal G.Marin J.M.Mellor-Crummey B.Liu S.L.Johnsson M.W.Hall N.McIntosh K.S.McKinley J.D.Oldham G.Roth S.Abu-Mahmeed C.McCosh K.Ravindran K.Hogan P.Austin S.Rogers J.Kornerup

Talks about:

data (7) parallel (6) program (6) analysi (6) interprocedur (5) retrospect (5) automat (4) regist (4) alloc (4) time (4)

Person: Ken Kennedy

DBLP: Kennedy:Ken

Facilitated 1 volumes:

Contributed to:

2009

2005

2002

2000

1999

1995

1994

1993

1992

1991

1990

1989

1988

1987

1986

1984

1983

1977

1976

1975

1995

Wrote 32 papers:

CC-2009-Abu-MahmeedMBKRHARK #scheduling: Scheduling Tasks to Maximize Usage of Aggregate Variables in Place (SAM, CM, ZB, KK, KR, KH, PA, SR, JK), pp. 204–219.
HPDC-2005-MandalKKMMLJ #grid #scheduling #workflow: Scheduling strategies for mapping application workflows onto the grid (AM, KK, CK, GM, JMMC, BL, SLJ), pp. 125–134.
PLDI-2002-BudimlicCHKOR #identification #performance: Fast Copy Coalescing and Live-Range Identification (ZB, KDC, TJH, KK, TSO, SWR), pp. 25–32.
PLDI-2000-YiAK #memory management #multi #recursion: Transforming loops to recursion for multi-level memory hierarchies (QY, VSA, KK), pp. 169–181.
PLDI-1999-DingK #performance #runtime: Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time (CD, KK), pp. 229–241.
PPoPP-1995-BordawekarCKKP #compilation #parallel #source code: A Model and Compilation Strategy for Out-of-Core Data Parallel Programs (RB, ANC, KK, CK, MHP), pp. 1–10.
PPoPP-1995-KennedyNS #algorithm #linear #memory management #sequence #source code: A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs (KK, NN, AS), pp. 102–111.
PLDI-1994-HanxledenK #framework #named: GIVE-N-TAKE — A Balanced Code Placement Framework (RvH, KK), pp. 107–120.
PPoPP-1993-HallHKMMOPR #case study #editing #experience #interactive #parallel #programming #using: Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool (MWH, TJH, KK, NM, KSM, JDO, MHP, GR), pp. 33–43.
PLDI-1992-HanxledenK #constraints #control flow #using: Relaxing SIMD Control Flow Constraints using Loop Transformations (RvH, KK), pp. 188–199.
ASPLOS-1991-CallahanKP: Software Prefetching (DC, KK, AP), pp. 40–52.
PLDI-1991-GoffKT #dependence #testing: Practical Dependence Testing (GG, KK, CWT), pp. 15–29.
PPoPP-1991-BalasundaramFKK #clustering #performance: A Static Performance Estimator to Guide Data Partitioning Decisions (VB, GF, KK, UK), pp. 213–223.
Best-of-PLDI-1990-CallahanCK90a: Improving register allocation for subscripted variables (with retrospective) (DC, SC, KK), pp. 328–342.
PLDI-1990-CallahanCK: Improving Register Allocation for Subscripted Variables (DC, SC, KK), pp. 53–65.
PPoPP-1990-CallahanKS #analysis #parallel #programming: Analysis of Event Synchronization in A Parallel Programming Tool (DC, KK, JS), pp. 21–30.
Best-of-PLDI-1989-BriggsCKT89a #heuristic: Coloring heuristics for register allocation (with retrospective) (PB, KDC, KK, LT), pp. 283–294.
PLDI-1989-BalasundaramK #data access #parallel: A Technique for Summarizing Data Access and Its Use in Parallelism Enhancing Transformations (VB, KK), pp. 41–53.
PLDI-1989-BriggsCKT #heuristic: Coloring Heuristics for Register Allocation (PB, KDC, KK, LT), pp. 275–284.
POPL-1989-CooperK #alias #analysis #interprocedural #performance: Fast Interprocedural Alias Analysis (KDC, KK), pp. 49–59.
Best-of-PLDI-1988-CooperK88a #analysis #interprocedural #linear: Interprocedural side-effect analysis in linear time (with retrospective) (KDC, KK), pp. 217–228.
PLDI-1988-CooperK #analysis #interprocedural #linear: Interprocedural Side-Effect Analysis in Linear Time (KDC, KK), pp. 57–66.
POPL-1987-AllenCK #automation #composition #execution #parallel #source code: Automatic Decomposition of Scientific Programs for Parallel Execution (RA, DC, KK), pp. 63–76.
Best-of-PLDI-1986-CallahanCKT #constant #interprocedural: Interprocedural constant propagation (with retrospective) (DC, KDC, KK, LT), pp. 155–166.
Best-of-PLDI-1984-AllenK #automation: Automatic loop interchange (with retrospective) (RA, KK), pp. 75–90.
SCC-1984-AllenK #automation: Automatic loop interchange (JRA, KK), pp. 233–246.
SCC-1984-CooperK #interprocedural #performance #summary: Efficient computation of flow insensitive interprocedural summary information (KDC, KK), pp. 247–258.
POPL-1983-AllenKPW #data flow #dependence: Conversion of Control Dependence to Data Dependence (JRA, KK, CP, JDW), pp. 177–189.
POPL-1977-KennedyZ #analysis #control flow #graph grammar: Applications of Graph Grammar for Program Control Flow Analysis (KK, LZ), pp. 72–85.
POPL-1976-KennedyW #attribute grammar #automation #generative #performance: Automatic Generation of Efficient Evaluators for Attribute Grammars (KK, SKW), pp. 32–49.
POPL-1975-Kennedy #analysis #data flow: Node Listings Applied to Data Flow Analysis (KK), pp. 10–21.
DL-1995-BrowneDKR #distributed #library: Management of the Nationale HPCC Software Exchange — A Virtual Distributed Digital Library (SB, JD, KK, TR).