Travelled to:
1 × Canada
1 × India
9 × USA
Collaborated with:
K.Agrawal J.Sukha R.D.Blumofe Y.He ∅ K.H.Randall F.M.Maley S.N.Bhatt B.C.Kuszmaul T.B.Schardl M.Frigo W.Hsu C.S.Ananian K.Asanovic S.Lie C.F.Joerg Y.Zhou S.Itzhaky Rohit Singh 0002 A.Solar-Lezama K.Yessenov Yongquan Lu R.A.Chowdhury
Talks about:
multithread (4) parallel (4) cilk (3) algorithm (2) platform (2) feedback (2) schedul (2) program (2) effici (2) dynam (2)
Person: Charles E. Leiserson
DBLP: Leiserson:Charles_E=
Contributed to:
Wrote 12 papers:
- PPoPP-2012-LeisersonSS #generative #parallel #platform #thread
- Deterministic parallel random-number generation for dynamic-multithreading platforms (CEL, TBS, JS), pp. 193–204.
- PPoPP-2010-AgrawalLS #parallel #programming
- Helper locks for fork-join parallel programming (KA, CEL, JS), pp. 245–256.
- DAC-2009-Leiserson #concurrent #framework #platform
- The Cilk++ concurrency platform (CEL), pp. 522–527.
- PPoPP-2007-AgrawalHL #adaptation #feedback #parallel
- Adaptive work stealing with parallelism feedback (KA, YH, CEL), pp. 112–120.
- PPoPP-2006-AgrawalHHL #adaptation #feedback #parallel #scheduling
- Adaptive scheduling with parallelism feedback (KA, YH, WJH, CEL), pp. 100–109.
- HPCA-2005-AnanianAKLL #bound #memory management #transaction
- Unbounded Transactional Memory (CSA, KA, BCK, CEL, SL), pp. 316–327.
- PLDI-1998-FrigoLR #implementation #parallel #thread
- The Implementation of the Cilk-5 Multithreaded Language (MF, CEL, KHR), pp. 212–223.
- PPoPP-1995-BlumofeJKLRZ #named #parallel #performance #runtime #thread
- Cilk: An Efficient Multithreaded Runtime System (RDB, CFJ, BCK, CEL, KHR, YZ), pp. 207–216.
- STOC-1993-BlumofeL #parallel #scheduling #thread
- Space-efficient scheduling of multithreaded computations (RDB, CEL), pp. 362–371.
- STOC-1985-LeisersonM #algorithm #testing
- Algorithms for Routing and Testing Routability of Planar VLSI Layouts (CEL, FMM), pp. 69–78.
- STOC-1982-BhattL #how
- How to Assemble Tree Machines (SNB, CEL), pp. 77–84.
- OOPSLA-2016-Itzhaky0SYLLC #algorithm #divide and conquer #programming #using
- Deriving divide-and-conquer dynamic programming algorithms using solver-aided transformations (SI, RS0, ASL, KY, YL, CEL, RAC), pp. 145–164.