skip to main content

SciTech ConnectSciTech Connect

Title: An Adaptive Cross-Architecture Combination Method for Graph Traversal

Breadth-First Search (BFS) is widely used in many real-world applications including computational biology, social networks, and electronic design automation. The combination method, using both top-down and bottom-up techniques, is the most effective BFS approach. However, current combination methods rely on trial-and-error and exhaustive search to locate the optimal switching point, which may cause significant runtime overhead. To solve this problem, we design an adaptive method based on regression analysis to predict an optimal switching point for the combination method at runtime within less than 0.1% of the BFS execution time.
Authors:
; ;
Publication Date:
OSTI Identifier:
1178890
Report Number(s):
PNNL-SA-108310
KJ0402000
DOE Contract Number:
AC05-76RL01830
Resource Type:
Conference
Resource Relation:
Conference: Proceedings of the 28th ACM international conference on Supercomputing (ICS'14), June 10-13, 2014, Munich, Germany, 169-169
Publisher:
Association for Computing Machinery , New York, NY, United States(US).
Research Org:
Pacific Northwest National Laboratory (PNNL), Richland, WA (US)
Sponsoring Org:
USDOE
Country of Publication:
United States
Language:
English