pith. sign in

arxiv: 1408.2041 · v1 · pith:GTFEWSP6new · submitted 2014-08-09 · 💻 cs.LG · cs.DC

GraphLab: A New Framework For Parallel Machine Learning

classification 💻 cs.LG cs.DC
keywords parallelgraphlablikeabstractionsalgorithmsdesigningframeworkimplementing
0
0 comments X
read the original abstract

Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insufficiently expressive while low-level tools like MPI and Pthreads leave ML experts repeatedly solving the same design challenges. By targeting common patterns in ML, we developed GraphLab, which improves upon abstractions like MapReduce by compactly expressing asynchronous iterative algorithms with sparse computational dependencies while ensuring data consistency and achieving a high degree of parallel performance. We demonstrate the expressiveness of the GraphLab framework by designing and implementing parallel versions of belief propagation, Gibbs sampling, Co-EM, Lasso and Compressed Sensing. We show that using GraphLab we can achieve excellent parallel performance on large scale real-world problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Graphyti: A Semi-External Memory Graph Library for FlashGraph

    cs.DC 2019-07 unverdicted novelty 4.0

    Graphyti is an extensible parallel SEM graph library that achieves 80% of in-memory performance and retains FlashGraph's advantages over distributed engines like PowerGraph and Galois.