Abstract | ||
---|---|---|
We propose a parameter server framework for distributed machine learning problems. Both data and workloads are distributed over worker nodes, while the server nodes maintain globally shared parameters, represented as dense or sparse vectors and matrices. The framework manages asynchronous data communication between nodes, and supports flexible consistency models, elastic scalability, and continuous fault tolerance. To demonstrate the scalability of the proposed framework, we show experimental results on petabytes of real data with billions of examples and parameters on problems ranging from Sparse Logistic Regression to Latent Dirichlet Allocation and Distributed Sketching. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1145/2640087.2644155 | OSDI |
Field | DocType | Citations |
Latent Dirichlet allocation,Petabyte,Computer science,Matrix (mathematics),Real-time computing,Ranging,Artificial intelligence,Consistency model,Distributed computing,Asynchronous communication,Fault tolerance,Machine learning,Scalability | Conference | 119 |
PageRank | References | Authors |
4.22 | 24 | 9 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mu Li | 1 | 913 | 42.35 |
andersen david g | 2 | 4823 | 345.31 |
Jun Woo Park | 3 | 169 | 6.47 |
Alexander J. Smola | 4 | 19627 | 1967.09 |
Amr Ahmed | 5 | 1743 | 92.13 |
Vanja Josifovski | 6 | 2265 | 148.84 |
James Long | 7 | 123 | 6.92 |
Eugene J. Shekita | 8 | 3630 | 574.21 |
Bor-Yiing Su | 9 | 324 | 18.28 |