An early evaluation of the scalability of graph algorithms on the Intel MIC architecture

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops, IPDPSW 2012

Volumn , Issue , 2012, Pages 1629-1639

  Saule, Erik ^a   Çatalyürek, Umit V ^a,b  

^a OHIO STATE UNIVERSITY   (United States)

^b Ohio State University   (United States)

Author keywords

breadth first search; Graph algorithm; graph coloring; multi threaded architectures; scalability; unstructured irregular computation

Indexed keywords

BREADTH-FIRST SEARCH; GRAPH ALGORITHMS; GRAPH COLORINGS; IRREGULAR COMPUTATIONS; MULTITHREADED ARCHITECTURE;

APPLICATION PROGRAMMING INTERFACES (API); DISTRIBUTED PARAMETER NETWORKS; GRAPH THEORY; PARALLEL ARCHITECTURES; SCALABILITY;

ALGORITHMS;

EID: 84867435009     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPSW.2012.204     Document Type: Conference Paper

References (21)

1. A. Lumsdaine, D. Gregor, B. Hendrickson, and J. W. Berry, "Challenges in parallel graph processing," Parallel Processing Letters, vol. 17, no. 1, pp. 5-20, 2007.
2. D. Bozdaǧ, A. Gebremedhin, F. Manne, E. Boman, and Ü. V. Çatalyürek, "A framework for scalable greedy coloring on distributed memory parallel computers," J. of Parallel and Distributed Computing, vol. 68, no. 4, pp. 515-535, 2008.
3. A. H. Gebremedhin, F. Manne, and A. Pothen, "What color is your jacobian? Graph coloring for computing derivatives," SIAM Review, vol. 47, no. 4, pp. 629-705, 2005.
4. J. Allwright, R. Bordawekar, P. D. Coddington, K. Dincer, and C. Martin, "A comparison of parallel graph coloring algorithms," Northeast Parallel Architectures Center at Syracuse University (NPAC), Tech. Rep. SCCS-666, 1994.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. MIT Press, 2001.
6. U. Brandes, "A faster algorithm for betweenness centrality," J. of Mathematical Sociology, vol. 25, pp. 163-177, 2001.
7. M. M. Mathis and D. J. Kerbyson, "A general performance model of structured and unstructured mesh particle transport computations," J. of Supercomputing, vol. 34, no. 2, pp. 181-199, 2005.
8. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou, "Cilk: An efficient multithreaded runtime system," in Symposium on Principles and Practice of Parallel Programming (PPoPP), 1995, pp. 207-216.
9. M. A. Bender and M. O. Rabin, "Online scheduling of parallel programs on heterogeneous systems with applications to cilk," Theory Comput. Systems, vol. 35, pp. 289-304, 2002.
10. M. Tchiboukdjian, N. Gast, D. Trystram, J.-L. Roch, and J. Bernard, "A tighter analysis of work stealing," in International Symposium on Algorithms and Computation, 2010.
11. M. Frigo, P. Halpern, C. E. Leiserson, and S. Lewin-Berlin, "Reducers and other cilk++ hyperobjects," in Symposium on Parallel Architectures and Algorithms (SPAA), Aug. 2009.
12. D. W. Matula, "A min-max theorem for graphs with application to graph coloring," SIAM Review, vol. 10, pp. 481-482, 1968.
13. D. Zuckerman, "Linear degree extractors and the inapproximability of max clique and chromatic number," Theory of Computing, vol. 3, pp. 103-128, 2007.
14. T. F. Coleman and J. J. More, "Estimation of sparse Jacobian matrices and graph coloring problems," SIAM J. on Numerical Analysis, vol. 1, no. 20, pp. 187-209, 1983.
15. J. C. Culberson, "Iterated greedy graph coloring and the difficulty landscape," University of Alberta, Tech. Rep. TR 92-07, Jun. 1992.
16. A. H. Gebremedhin and F. Manne, "Scalable parallel graph coloring algorithms," Concurrency: Practice and Experience, vol. 12, pp. 1131-1146, 2000.
17. Ü. V. Çatalyürek, J. Feo, A. H. Gebremedhin, M. Halappanavar, and A. Pothen, "Graph coloring algorithms for multicore and massively multithreaded architectures," Parallel Computing, 2012, (to appear).
18. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek, "A scalable distributed parallel breadth-first search algorithm on BlueGene/L," in Proc. of Super Computing, 2005.
19. D. A. Bader and K. Madduri, "Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks," in International Symposium on Parallel and Distributed Processing (IPDPS), 2008, pp. 1-12.
20. C. L. Leiserson and T. B. Schardl, "A work-efficient parallel breadth-first search algorithm (or how to cope with the nondeterminism of reducers)," in Symposium on Parallel Architectures and Algorithms (SPAA), 2010, pp. 303-314.
21. M. M. Strout and P. D. Hovland, "Metrics and models for reordering transformations," in Workshop on Memory System Performance (MSP), June 8 2004, pp. 23-34.