DistDGL: Distributed Graph Neural Network Training for Billion-Scale Graphs

G. Karypis and V. Kumar, “A fast and high quality multilevel scheme for partitioning irregular graphs,” SIAM Journal on Scientific Computing , vol. 20, no. 1, pp. 359–392, 1998

1998

Earlier work this paper cites.

G. Karypis and V. Kumar, “Multilevel algorithms for multi-constraint graph partitioning,” in Proceedings of the 1998 ACM/IEEE Conference on Supercomputing , USA, 1998, p. 1–13

1998

Earlier work this paper cites.

G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, “Pregel: A system for large-scale graph processing,” in Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data , ser. SIGMOD ’10, New York, NY, USA, 2010, p. 135–146

2010

Earlier work this paper cites.

F. Niu, B. Recht, C. Re, and S. J. Wright, “Hogwild!: A lock-free approach to parallelizing stochastic gradient descent,” arXiv preprint arXiv:1106.5730 , 2011

Original

2011

Earlier work this paper cites.

J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, “Powergraph: Distributed graph-parallel computation on natural graphs,” in 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) , Nov. 2012

2012

Earlier work this paper cites.

J. Shun and G. E. Blelloch, “Ligra: A lightweight graph processing framework for shared memory,” SIGPLAN Not. , vol. 48, no. 8, p. 135–146, Feb. 2013

2013

Earlier work this paper cites.

Q. Ho, J. Cipar, H. Cui, S. Lee, J. K. Kim, P. B. Gibbons, G. A. Gibson, G. Ganger, and E. P. Xing, “More effective distributed ml via a stale synchronous parallel parameter server,” in Advances in neural information processing systems , 2013, pp. 1223–1231

2013

Earlier work this paper cites.

M. Li, D. G. Andersen, J. W. Park, A. J. Smola, A. Ahmed, V. Josifovski, J. Long, E. J. Shekita, and B.-Y. Su, “Scaling distributed machine learning with the parameter server,” in Proceedings of the 11th USENIX Conference on Operating Systems Design and Implementation , ser. OSDI’14. USA: USENIX Association, 2014, p. 583–598

2014

Earlier work this paper cites.

T. Chilimbi, Y. Suzue, J. Apacible, and K. Kalyanaraman, “Project adam: Building an efficient and scalable deep learning training system,” in 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14) , Broomfield, CO, Oct. 2014, pp. 571–582

2014

Earlier work this paper cites.

F. Seide, H. Fu, J. Droppo, G. Li, and D. Yu, “1-bit stochastic gradient descent and its application to data-parallel distributed training of speech dnns,” in Fifteenth Annual Conference of the International Speech Communication Association , 2014

2014

Earlier work this paper cites.

X. Zhu, W. Chen, W. Zheng, and X. Ma, “Gemini: A computation-centric distributed graph processing system,” in 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16) , Nov. 2016

2016

Earlier work this paper cites.

W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proceedings of the 31st International Conference on Neural Information Processing Systems , ser. NIPS’17, 2017, p. 1025–1035

2017

Earlier work this paper cites.

J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural message passing for quantum chemistry,” in Proceedings of the 34th International Conference on Machine Learning - Volume 70 , 2017

2017

Earlier work this paper cites.

J. Chen, J. Zhu, and L. Song, “Stochastic training of graph convolutional networks with variance reduction,” ser. Proceedings of Machine Learning Research, J. Dy and A. Krause, Eds., vol. 80. Stockholmsmässan, Stockholm Sweden: PMLR, 10–15 Jul 2018, pp. 942–950

2018

Cited alongside, same era.

J. Chen, T. Ma, and C. Xiao, “FastGCN: Fast learning with graph convolutional networks via importance sampling,” in International Conference on Learning Representations , 2018

2018

Cited alongside, same era.

W. Huang, T. Zhang, Y. Rong, and J. Huang, “Adaptive sampling towards fast graph representation learning,” CoRR , vol. abs/1809.05343, 2018

Original

2018

Cited alongside, same era.

R. Ying, R. He, K. Chen, P. Eksombatchai, W. L. Hamilton, and J. Leskovec, “Graph convolutional neural networks for web-scale recommender systems,” CoRR , vol. abs/1806.01973, 2018

Original

2018

Cited alongside, same era.

Y. Peng, Y. Zhu, Y. Chen, Y. Bao, B. Yi, C. Lan, C. Wu, and C. Guo, “A generic communication scheduler for distributed dnn training acceleration,” in Proceedings of the 27th ACM Symposium on Operating Systems Principles , ser. SOSP ’19, New York, NY, USA, 2019, p. 16–29

2019

Later among the works it cites.

D. Zou, Z. Hu, Y. Wang, S. Jiang, Y. Sun, and Q. Gu, “Layer-dependent importance sampling for training deep and large graph convolutional networks,” arXiv preprint arXiv:1911.07323 , 2019

Original

2019

Later among the works it cites.

W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-gcn,” Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining , Jul 2019

2019

Later among the works it cites.

N. Ivkin, D. Rothchild, E. Ullah, V. Braverman, I. Stoica, and R. Arora, “Communication-efficient distributed SGD with sketching,” arXiv preprint arXiv:1903.04488 , 2019

Original

2019

Later among the works it cites.