Travelled to:1 × China
4 × USA
Collaborated with:K.Agrawal J.Sukha J.Shun G.E.Blelloch P.B.Gibbons M.A.Bender M.Farach-Colton S.P.Fekete S.Gilbert B.Sheridan R.Utterback
Talks about:parallel (3) determinist (1) algorithm (1) transact (1) structur (1) prioriti (1) implicit (1) schedul (1) realloc (1) provabl (1)
Person: Jeremy T. Fineman
DBLP: Fineman:Jeremy_T=
Contributed to:
2014
2014201320122008Wrote 5 papers:
- PODS-2014-BenderFFFG
- Cost-oblivious storage reallocation (MAB, MFC, SPF, JTF, SG), pp. 278–288.
- PPoPP-2014-AgrawalFSSU #data type #parallel #scheduling #source code
- Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
- PPoPP-2013-ShunBFG
- Reducing contention through priority updates (JS, GEB, JTF, PBG), pp. 299–300.
- PPoPP-2012-BlellochFGS #algorithm #parallel #performance
- Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.
- PPoPP-2008-AgrawalFS #memory management #parallel #transaction
- Nested parallelism in transactional memory (KA, JTF, JS), pp. 163–174.