Travelled to:
1 × Canada
1 × France
1 × India
1 × Ireland
1 × United Kingdom
14 × USA
2 × China
Collaborated with:
X.Gu Y.Zhong B.Bao X.Shen T.Bai C.Zhang K.Kelsey T.M.Chilimbi H.Luo J.Brock ∅ K.Kennedy P.Mateti P.Li J.Criswell X.Xiang M.Ogihara C.Zhang R.Lavaee M.Hertz J.Shaw B.Meeker M.Orlovich X.Xu Y.Zhang D.Chen Fangzhou Liu S.Pai I.Christopher Y.Wu C.Ke L.Liu B.Jacobs X.Feng C.Tice R.Huang S.Kane E.Keudel J.E.Bard Colin Pronovost William Wilson Benjamin Tait J.Zhou
Talks about:
program (8) local (7) cach (7) parallel (5) model (4) data (4) use (4) softwar (3) theori (3) share (3)
Person: Chen Ding
DBLP: Ding:Chen
Contributed to:
Wrote 27 papers:
- ISMM-2014-LiDL #liveness #modelling #using
- Modeling heap data growth using average liveness (PL, CD, HL), pp. 71–82.
- ASPLOS-2013-XiangDLB #higher-order #locality #named
- HOTL: a higher order theory of locality (XX, CD, HL, BB), pp. 343–356.
- CGO-2013-BaoD
- Defensive loop tiling for shared cache (BB, CD), p. 11.
- ISMM-2013-BrockGBD #named
- Pacman: program-assisted cache management (JB, XG, BB, CD), pp. 39–50.
- ISMM-2012-GuD #collaboration
- A generalized theory of collaborative caching (XG, CD), pp. 109–120.
- ISMM-2011-GuD #collaboration #on the
- On the theory and potential of LRU-MRU collaborative cache management (XG, CD), pp. 43–54.
- ISMM-2011-HertzKKBDGB #garbage collection
- Waste not, want not: resource-based garbage collection in a shared environment (MH, SK, EK, TB, CD, XG, JEB), pp. 65–76.
- OOPSLA-2011-KeLZBJD #dependence #parallel #programming #using
- Safe parallel programming using dynamic dependence hints (CK, LL, CZ, TB, BJ, CD), pp. 243–258.
- PPoPP-2011-Ding #concurrent #parallel #programming
- Two examples of parallel programming without concurrency constructs (PP-CC) (CD), pp. 299–300.
- PPoPP-2011-XiangBBDC #composition #modelling #profiling
- All-window profiling and composable models of cache sharing (XX, BB, TB, CD, TMC), pp. 91–102.
- PPoPP-2010-ZhangDGKBF #parallel
- Continuous speculative program parallelization in software (CZ, CD, XG, KK, TB, XF), pp. 335–336.
- CGO-2009-KelseyBDZ #optimisation #performance
- Fast Track: A Software System for Speculative Program Optimization (KK, TB, CD, CZ), pp. 157–168.
- ISMM-2009-GuCBZD #component #locality
- A component model of spatial locality (XG, IC, TB, CZ, CD), pp. 99–108.
- PPoPP-2008-DingC #concurrent #profiling
- All-window profiling of concurrent executions (CD, TMC), pp. 265–266.
- PLDI-2007-DingSKTHZ #behaviour #parallel
- Software behavior oriented parallelization (CD, XS, KK, CT, RH, CZ), pp. 223–234.
- POPL-2007-ShenSMD #approximate #locality #using
- Locality approximation using time (XS, JS, BM, CD), pp. 55–61.
- ISMM-2006-ZhangKSDHO #adaptation #memory management
- Program-level adaptive memory management (CZ, KK, XS, CD, MH, MO), pp. 174–183.
- POPL-2006-ZhangDOZW #locality
- A hierarchical model of data locality (CZ, CD, MO, YZ, YW), pp. 16–29.
- ASPLOS-2004-ShenZD #locality #predict
- Locality phase prediction (XS, YZ, CD), pp. 165–176.
- PLDI-2004-ZhongOSD #array #using
- Array regrouping and structure splitting using whole-program reference affinity (YZ, MO, XS, CD), pp. 255–266.
- PLDI-2003-DingZ #analysis #distance #locality #predict #reuse
- Predicting whole-program locality through reuse distance analysis (CD, YZ), pp. 245–257.
- PLDI-1999-DingK #performance #runtime
- Improving Cache Performance in Dynamic Applications through Data and Computation Reorganization at Run Time (CD, KK), pp. 229–241.
- SEKE-1990-MatetiD #data type #diagrams #linked data #open data
- Aesthetics Rules in The Diagrams of Linked Data Structures (PM, CD), pp. 239–244.
- CC-2018-BrockDXZ #compilation #implementation #jit #named
- PAYJIT: space-optimal JIT compilation and its practical implementation (JB, CD, XX, YZ), pp. 71–81.
- CC-2019-LavaeeCD #interprocedural #layout #named #optimisation
- Codestitcher: inter-procedural basic block layout optimization (RL, JC, CD), pp. 65–75.
- PLDI-2018-ChenLDP #analysis #locality #parallel
- Locality analysis through static parallel sampling (DC, FL, CD, SP), pp. 557–570.
- ASPLOS-2019-LiPWTZDC #statistics
- Beating OPT with Statistical Clairvoyance and Variable Size Caching (PL, CP, WW, BT, JZ, CD, JC), pp. 243–256.