Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3769 LNCS, Issue , 2005, Pages 465-476

  Bader, David A ^a   Madduri, Kamesh ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATION THEORY; MULTIPROCESSING SYSTEMS; NATURAL SCIENCES COMPUTING;

COMPUTATIONAL BIOLOGY; HIGH PRODUCTIVITY COMPUTING SYSTEMS (HPCS); SCALABLE SYNTHETIC COMPACT APPLICATIONS (SSCA); SYMMETRIC MULTIPROCESSORS (SMP);

GRAPH THEORY;

EID: 33646744243     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602569_48     Document Type: Conference Paper

References (19)

1. DARPA Information Processing Technology Office: High productivity computing systems project (2004) http://www.darpa.mil/ipto/programs/hpcs/.
2. Kepner, J., Koester, D.P., et al.: HPCS Scalable Synthetic Compact Application (SSCA) Benchmarks (2004) http://www.highproductivity.org/SSCABmks. htm.
3. Kepner, J., Koester, D.P., et al.: HPCS SSCA#2 Graph Analysis Benchmark Specifications v1.0. (2005)
4. Dongarra, J., Bunch, J., Moler, C., Stewart, G.: UNPACK Users' Guide. SIAM, Philadelphia, PA. (1979)
5. Bader, D., Sreshta, S., Weisse-Bernstein, N.: Evaluating arithmetic expressions using tree contraction: A fast and scalable parallel implementation for symmetric multiprocessors (SMPs). In Sahni, S., Prasanna, V., Shukla, U., eds.: Proc. 9th Int'l Conf. on High Performance Computing (HiPC 2002). Volume 2552 of Lecture Notes in Computer Science., Bangalore, India, Springer-Verlag (2002) 63-75
6. Bader, D.A., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In: Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)
7. Bader, D.A., Cong, G.: Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In: Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, NM (2004)
8. Helman, D.R., JáJá, J.: Designing practical efficient algorithms for symmetric multiprocessors. In: Algorithm Engineering and Experimentation (ALENEX'99). Volume 1619 of Lecture Notes in Computer Science., Baltimore, MD, Springer-Verlag (1999) 37-56
9. Helman, D.R., JáJá, J.: Prefix computations on symmetric multiprocessors. Journal of Parallel and Distributed Computing 61 (2001) 265-278
10. Bader, D.A., Madduri, K.: Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. Technical report, Georgia Instutite of Technology (2005)
11. Park, J., Penner, M., Prasanna, V.: Optimizing graph algorithms for improved cache performance. In: Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS 2002), Fort Lauderdale, FL (2002)
12. Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49 (1970) 291-307
13. Sangiovanni-Vincentelli, A., Chert, L., Chua, L.: A new tearing approach: Node tearing nodal analysis. In: Proc. IEEE Int'l Symp. on Circ. and Syst., Phoenix, AZ (1975) 143-147
14. Sangiovanni-Vincentelli, A., Chert, L., Chua, L.: An efficient heuristic cluster algorithm for tearing large-scale networks. IEEE Trans. Circuits and Systems (1977) 709-717
15. Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In Du, D.Z., Pardalos, P.M., eds.: Handbook of Combinatorial Optimization. Volume 4. Kluwer Academic Publishers, Boston, MA (1999)
16. Johnson, D., Trick, M., eds.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)
17. Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. Supercomputing '95, San Diego, CA (1995)
18. Karypis, G., Kumar, V.: MeTiS: A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices. Department of Computer Science, University of Minnesota. Version 4.0 edn. (1998)
19. Koester, D.P.: Parallel Block-Diagonal-Bordered Sparse Linear Solvers for Power Systems Applications. PhD thesis, Syracuse University, Syracuse, NY (1995)