Fine-Grained Parallel Betweenness Centrality Algorithm Without Lock Synchronization
Tu Deng · 2011
Through a joint study in architecture and application,it is found that lock synchronization in a fine-grained parallel betweenness centrality(BC) program poses an obstacle for the efficient execution of parallel architectures.This paper proposes a data-centric parallel algorithm that eliminates lock synchronization.This algorithm reduces execution time and improves speeds up twice as fast on both AMD 32 core SMP and Intel 8core SMP.