
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Bruce Hendrickson, Jonathan W. Berry, "Graph Analysis with HighPerformance Computing," Computing in Science and Engineering, vol. 10, no. 2, pp. 1419, March/April, 2008.  
BibTex  x  
@article{ 10.1109/MCSE.2008.56, author = {Bruce Hendrickson and Jonathan W. Berry}, title = {Graph Analysis with HighPerformance Computing}, journal ={Computing in Science and Engineering}, volume = {10}, number = {2}, issn = {15219615}, year = {2008}, pages = {1419}, doi = {http://doi.ieeecomputersociety.org/10.1109/MCSE.2008.56}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  Computing in Science and Engineering TI  Graph Analysis with HighPerformance Computing IS  2 SN  15219615 SP14 EP19 EPD  1419 A1  Bruce Hendrickson, A1  Jonathan W. Berry, PY  2008 KW  computing KW  combinatorics KW  combinatorial KW  scalable algorithms KW  graph analysis KW  HPC KW  highperformance computing KW  combinatorics in computing VL  10 JA  Computing in Science and Engineering ER   
1. T.A. ElGhazawi, W.W. Carlson, and J.M. Draper, "UPC Language Specification, 1.1 ed.," May 2003; http://upc.lbl.gov/docsuser.
2. L. Dagum and R. Menon, "OpenMP: An IndustryStandard API for SharedMemory Programming," IEEE Computational Science and Eng., vol. 5, no. 1, 1998, pp. 46–55.
3. IEEE Standard Portable Operating System Interface for Computer Environments, IEEE Press, 1988.
4. W. Anderson et al., "Early Experiences with Scientific Programs on the Cray MTA2," Proc. Supercomputing 2003, IEEE CS Press, 2003, pp. 46–58.
5. A. Stepanov and M. Lee, The Standard Template Library, tech. report 9511 (R.1), HewlettPackard Labs., 1995.
6. J. Siek, L.Q. Lee, and A. Lumsdaine, The Boost Graph Library, AddisonWesley, 2002.
7. D. Gregor and A. Lumsdaine, "The Parallel BGL: A Generic Library for Distributed Graph Computations," Proc. Workshop Parallel ObjectOriented Scientific Computing (POOSC), 2005, www.osl.iu.edu/publications/prints/2005Gregor:POOSC:2005.pdf .
8. J.W. Berry et al., "Software and Algorithms for Graph Queries on Multithreaded Architectures," Proc. 21st Int'l Parallel and Distributed Processing Symp., IEEE Press, 2007, p. 495.
9. A. Lumsdaine et al., "Challenges in Parallel Graph Processing," Parallel Processing Letters, vol. 17, no. 1, 2007, pp. 5–20.
10. S. Milgram, "The Small World Phenomenon," Psychology Today, vol. 1, 1967, pp. 61–67.
11. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "RMAT: A Recursive Model for Graph Mining," Proc. 4th SIAM Int'l Conf. Data Mining, SIAM Press, 2004.
12. A. Yoo et al., "A Scalable Distributed Parallel BreadthFirst Search Algorithm on BlueGene/L," Proc. Supercomputing 2005, IEEE CS Press, 2005, p. 25.
13. D. Bader and K. Madduri, "Designing Multithreaded Algorithms for BreadthFirst Search and STConnectivity on the Cray MTA2," Proc. 35th Int'l Conf. Parallel Processing (ICPP), IEEE CS Press, 2006, pp. 523–530.
14. E. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, 1959, pp. 269–271.
15. K. Madduri et al., "Parallel Shortest Path Algorithms for Solving LargeScale Instances," Proc. 9th DIMACS Implementation Challenge: Shortest Paths, 2006; http://dimacs.rutgers.edu/Workshops/Challenge9/ papersmadduri.pdf.
16. U. Meyer and P. Sanders, "DeltaStepping: A Parallel Single Source Shortest Path Algorithm," Proc. 6th Ann. European Symp. Algorithms, SpringerVerlag, 1998, pp. 393–404.