Fetching the paper…
Reading the bibliography…
This report focuses on the architecture and performance of the Intelligence Processing Unit (IPU), a novel, massively parallel platform recently introduced by Graphcore and aimed at Artificial Intelligence/Machine Learning (AI/ML) workloads.
1903
Earlier work this paper cites.
L. G. Valiant, “A bridging model for parallel computation,” Communications of the ACM , vol. 33, no. 8, pp. 103–111, Aug. 1990. [Online]. Available: http://doi.acm.org/10.1145/79173.79181
1990
Earlier work this paper cites.
D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken, “Logp: Towards a realistic model of parallel computation,” in Proceedings of the Fourth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming , ser. PPOPP ’93. New York, NY, USA: ACM, 1993, pp. 1–12. [Online]. Available: http://doi.acm.org/10.1145/155332.155333
1993
Earlier work this paper cites.
A. Alexandrov, M. F. Ionescu, K. E. Schauser, and C. Scheiman, “Loggp: Incorporating long messages into the logp model — one step closer towards a realistic model for parallel computation,” Santa Barbara, CA, USA, Tech. Rep., 1995
1995
Earlier work this paper cites.
J. Liu, B. Chandrasekaran, W. Yu, J. Wu, D. Buntinas, S. Kini, D. Panda, and P. Wyckoff, “Microbenchmark performance comparison of high-speed cluster interconnects,” IEEE Micro , vol. 24, pp. 42 – 51, 02 2004
2004
Earlier work this paper cites.
M. Kistler, M. Perrone, and F. Petrini, “Cell multiprocessor communication network: Built for speed,” IEEE Micro , vol. 26, no. 3, pp. 10–23, May 2006. [Online]. Available: http://dx.doi.org/10.1109/MM.2006.49
2006
Earlier work this paper cites.
2007
Cited alongside, same era.
J. Salmon, M. Moraes, R. Dror, and D. Shaw, “Parallel random numbers: As easy as 1, 2, 3,” 11 2011, p. 16. [Online]. Available: https://thesalmons.org/john/random123/papers/random123sc11.pdf
2011
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” pp. 1097–1105, 2012
2012
Cited alongside, same era.
K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” 2014
2014
Cited alongside, same era.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” 2015
2015
S. Xie, R. Girshick, P. Dollar, Z. Tu, and K. He, “Aggregated residual transformations for deep neural networks,” 2016
2016
Later among the works it cites.
W. Liu, D. Anguelov, D. Erhan, C. Szegedy, S. Reed, C.-Y. Fu, and A. C. Berg, “Ssd: Single shot multibox detector,” Lecture Notes in Computer Science , pp. 21–37, 2016. [Online]. Available: http://dx.doi.org/10.1007/978-3-319-46448-0˙2
2016
Later among the works it cites.
2018
Later among the works it cites.
The Ohio State University’s Network-Based Computing Laboratory, “Osu micro benchmarks,” 2019. [Online]. Available: http://mvapich.cse.ohio-state.edu/benchmarks/
2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
C. Szegedy, V. Vanhoucke, S. Ioffe, J. Shlens, and Z. Wojna, “Rethinking the inception architecture for computer vision,” 2015
2015
Cited alongside, same era.
D. Blackman and S. Vigna, “Scrambled linear pseudorandom number generators,” preprint article , 2019. [Online]. Available: http://vigna.di.unimi.it/ftp/papers/ScrambledLinear.pdf
2019
Closest in time.
NVidia, “cuRand – the API reference guide for cuRand, the CUDA random number generation library,” 2019. [Online]. Available: https://docs.nvidia.com/cuda/curand/index.html
2019
Closest in time.