Challenges in Mapping Graph Exploration Algorithms on Advanced Multi-core Processors
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. A bridging model for parallel computation , 1990, CACM.
[2] David A. Bader,et al. Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 , 2006, 2006 International Conference on Parallel Processing (ICPP'06).
[3] Sally A. McKee,et al. Hitting the memory wall: implications of the obvious , 1995, CARN.
[4] Nachiket Kapre,et al. GraphStep: A System Architecture for Sparse-Graph Algorithms , 2006, 2006 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.
[5] Dimitrios S. Nikolopoulos,et al. The Architectural and Operating System Implications on the Performance of Synchronization on ccNUMA Multiprocessors , 2001, International Journal of Parallel Programming.
[6] Kam-Hoi Cheng,et al. A fast graph search multiprocessor algorithm , 1997, Proceedings of the IEEE 1997 National Aerospace and Electronics Conference. NAECON 1997.
[7] Edmond Chow,et al. A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L , 2005, ACM/IEEE SC 2005 Conference (SC'05).
[8] M. Newman,et al. Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.
[9] Fabrizio Petrini,et al. BCS-MPI: A New Approach in the System Software Design for Large-Scale Parallel Computers , 2003, SC.
[10] Michael L. Scott,et al. Algorithms for scalable synchronization on shared-memory multiprocessors , 1991, TOCS.