Author:
Bader David,Agarwal Virat,Madduri Kamesh,Petrini Fabrizio
Reference20 articles.
1. D.A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). InProc. Int’l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, April 2004.
2. D.A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. InProc. Int’l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM, April 2004.
3. D.A. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. InProc. 34th Int’l Conf. on Parallel Processing (ICPP 2005), Oslo, Norway, June 2005.
4. K.J. Barker, K. Davis, A. Hoisie, D.J. Kerbyson, M. Lang, S. Pakin, and J.C. Sancho. Entering the petaflop era: The architecture and performance of Roadrunner. InProc. of the 2008 ACM/IEEE Conference on Supercomputing (SC08), pages1-11, Piscataway, NJ, 2008. IEEE Press.