Travelled to:1 × Australia
1 × Canada
1 × Portugal
4 × USA
Collaborated with:M.Kaminsky H.Balakrishnan M.Li A.J.Smola I.Moraru L.Zhou H.Lim B.Fan W.Lloyd M.J.Freedman M.F.Kaashoek R.Morris D.Bansal D.Curtis S.Seshan J.Franklin A.Phanishayee L.Tan V.Vasudevan M.Maas M.Isard Mohammad Mahdi Javanmard K.S.McKinley Colin Raffel J.W.Park A.Ahmed V.Josifovski J.Long E.J.Shekita B.Su
Talks about:server (2) memori (2) learn (2) egalitarian (1) parliament (1) distribut (1) consensus (1) bandwidth (1) workload (1) internet (1)
Person: David G. Andersen
DBLP: Andersen:David_G=
Contributed to:
2015
2014
20132011200920012000
2020Wrote 9 papers:
- KDD-2015-ZhouALS #algebra #linear
- Cuckoo Linear Algebra (LZ, DGA, ML, AJS), pp. 1553–1562.
- OSDI-2014-LiAPSAJLSS #distributed #machine learning #parametricity #scalability
- Scaling Distributed Machine Learning with the Parameter Server (ML, DGA, JWP, AJS, AA, VJ, JL, EJS, BYS), pp. 583–598.
- SOSP-2013-MoraruAK
- There is more consensus in Egalitarian parliaments (IM, DGA, MK), pp. 358–372.
- SOSP-2011-LimFAK #named
- SILT: a memory-efficient, high-performance key-value store (HL, BF, DGA, MK), pp. 1–13.
- SOSP-2011-LloydFKA #consistency #scalability
- Don’t settle for eventual: scalable causal consistency for wide-area storage with COPS (WL, MJF, MK, DGA), pp. 401–416.
- SOSP-2009-AndersenFKPTV #array #named #performance
- FAWN: a fast array of wimpy nodes (DGA, JF, MK, AP, LT, VV), pp. 1–14.
- SOSP-2001-AndersenBKM #network
- Resilient Overlay Networks (DGA, HB, MFK, RM), pp. 131–145.
- OSDI-2000-AndersenBCSB #adaptation #internet
- System Support for Bandwidth Management and Content Adaptation in Internet Applications (DGA, DB, DC, SS, HB), pp. 213–226.
- ASPLOS-2020-MaasAIJMR #c++ #memory management
- Learning-based Memory Allocation for C++ Server Workloads (MM, DGA, MI, MMJ, KSM, CR), pp. 541–556.