[1] A. Agarwal, O. Chapelle, M. Dudık, and J. Langford. A reliable
effective terascale linear learning system. ArXiv e-prints, 2011.
[2] A. Ailamaki, D. J. DeWitt, M. D. Hill, and M. Skounakis.
Weaving relations for cache performance. In VLDB, 2001.
[3] M.-C. Albutiu, A. Kemper, and T. Neumann. Massively
parallel sort-merge joins in main memory multi-core database
systems. PVLDB, pages 1064–1075, 2012.
[4] J. M. Anderson and M. S. Lam. Global optimizations for
parallelism and locality on scalable parallel machines. In PLDI,
pages 112–125, 1993.
[5] C. Balkesen and et al. Multi-core, main-memory joins: Sort vs.
hash revisited. PVLDB, pages 85–96, 2013.
[6] M. Bauer, S. Treichler, E. Slaughter, and A. Aiken. Legion:
expressing locality and independence with logical regions. In
SC, page 66, 2012.
[7] N. Bell and M. Garland. Efficient sparse matrix-vector
multiplication on CUDA. Technical report, NVIDIA
Corporation, 2008.
[8] N. Bell and M. Garland. Implementing sparse matrix-vector
multiplication on throughput-oriented processors. In SC, pages
18:1–18:11, 2009.
[9] L. Bergstrom. Measuring NUMA effects with the STREAM
benchmark. ArXiv e-prints, 2011.
[10] C. Boutsidis and et al. Near-optimal coresets for least-squares
regression. IEEE Transactions on Information Theory, 2013.
[11] J. K. Bradley, A. Kyrola, D. Bickson, and C. Guestrin. Parallel
coordinate descent for l1-regularized loss minimization. In
ICML, pages 321–328, 2011.
[12] G. Buehrer and et al. Toward terabyte pattern mining: An
architecture-conscious solution. In PPoPP, pages 2–12, 2007.
[13] G. Buehrer, S. Parthasarathy, and Y.-K. Chen. Adaptive
parallel graph mining for cmp architectures. In ICDM, pages
97–106, 2006.
[14] S. Carr, K. S. McKinley, and C.-W. Tseng. Compiler
optimizations for improving data locality. In ASPLOS, 1994.
[15] H. Chafi, A. K. Sujeeth, K. J. Brown, H. Lee, A. R. Atreya,
and K. Olukotun. A domain-specific approach to heterogeneous
parallelism. In PPOPP, pages 35–46, 2011.
[16] C. Chasseur and J. M. Patel. Design and evaluation of storage
organizations for read-optimized main memory databases.
PVLDB, pages 1474–1485, 2013.
[17] C. T. Chu and et al. Map-reduce for machine learning on
multicore. In NIPS, pages 281–288, 2006.
[18] E. F. D’Azevedo, M. R. Fahey, and R. T. Mills. Vectorized
sparse matrix multiply for compressed row storage format. In
ICCS, pages 99–106, 2005.
[19] J. Dean and et al. Large scale distributed deep networks. In
NIPS, pages 1232–1240, 2012.
[20] A. Ghoting and et al. Cache-conscious frequent pattern mining
on modern and emerging processors. VLDBJ, 2007.
[21] A. Ghoting and et al. SystemML: Declarative machine learning
on MapReduce. In ICDE, pages 231–242, 2011.
[22] Y. He and et al. Rcfile: A fast and space-efficient data
placement structure in mapreduce-based warehouse systems. In
ICDE, pages 1199–1208, 2011.
[23] J. M. Hellerstein and et al. The MADlib analytics library: Or
MAD skills, the SQL. PVLDB, pages 1700–1711, 2012.
[24] R. Jin, G. Yang, and G. Agrawal. Shared memory
parallelization of data mining algorithms: Techniques,
programming interface, and performance. TKDE, 2005.
[25] M. J. Johnson, J. Saunderson, and A. S. Willsky. Analyzing
Hogwild parallel Gaussian Gibbs sampling. In NIPS, 2013.
[26] M.-Y. Kan and H. O. N. Thi. Fast webpage classification using
url features. In CIKM, pages 325–326, 2005.
[27] C. Kim and et al. Sort vs. hash revisited: Fast join
implementation on modern multi-core CPUs. PVLDB, 2009.
[28] A. Kyrola, G. Blelloch, and C. Guestrin. Graphchi: Large-scale
graph computation on just a pc. In OSDI, pages 31–46, 2012.
[29] Q. V. Le and et al. Building high-level features using large
scale unsupervised learning. In ICML, pages 8595–8598, 2012.
[30] Y. LeCun and et al. Gradient-based learning applied to
document recognition. IEEE, pages 2278–2324, 1998.
[31] Y. Li and et al. NUMA-aware algorithms: the case of data
shuffling. In CIDR, 2013.
[32] J. Liu and et al. An asynchronous parallel stochastic coordinate
descent algorithm. ICML, 2014.