Matches in SemOpenAlex for { <https://semopenalex.org/work/W2912505052> ?p ?o ?g. }
Showing items 1 to 81 of
81
with 100 items per page.
- W2912505052 abstract "Finding whether a graph is k-connected, and the identification of its k-connected components is a fundamental problem in graph theory. For this reason, there have been several algorithms for this problem in both the sequential and parallel settings. Several recent sequential and parallel algorithms for k-connectivity rely on one or more breadth-first traversals of the input graph. While BFS can be made very efficient in a sequential setting, the same cannot be said in the case of parallel environments. A major factor in this difficulty is due to the inherent requirement to use a shared queue, balance work among multiple threads in every round, synchronization, and the like. Optimizing the execution of BFS on many current parallel architectures is therefore quite challenging. For this reason, it can be noticed that the time spent by the current parallel graph connectivity algorithms on BFS operations is usually a significant portion of their overall runtime. In this paper, we study how one can, in the context of algorithms for graph connectivity, mitigate the practical inefficiency of relying on BFS operations in parallel. Our technique suggests that such algorithms may not require a BFS of the input graph but actually can work with a sparse spanning subgraph of the input graph. The incorrectness introduced by not using a BFS spanning tree can then be offset by further post-processing steps on suitably defined small auxiliary graphs. Our experiments on finding the 2, and 3-connectivity of graphs on Nvidia K40c GPUs improve the state-of-the-art on the corresponding problems by a factor 2.2x, and 2.1x respectively." @default.
- W2912505052 created "2019-02-21" @default.
- W2912505052 creator A5018293840 @default.
- W2912505052 creator A5023412602 @default.
- W2912505052 date "2018-12-01" @default.
- W2912505052 modified "2023-09-26" @default.
- W2912505052 title "Expediting Parallel Graph Connectivity Algorithms" @default.
- W2912505052 cites W1504925519 @default.
- W2912505052 cites W1539701003 @default.
- W2912505052 cites W1595140484 @default.
- W2912505052 cites W1857247017 @default.
- W2912505052 cites W1985291160 @default.
- W2912505052 cites W1994556169 @default.
- W2912505052 cites W2001383125 @default.
- W2912505052 cites W2004350101 @default.
- W2912505052 cites W2012310530 @default.
- W2912505052 cites W2050021819 @default.
- W2912505052 cites W2061983247 @default.
- W2912505052 cites W2072637458 @default.
- W2912505052 cites W2082398795 @default.
- W2912505052 cites W2086825382 @default.
- W2912505052 cites W2105144880 @default.
- W2912505052 cites W2109845582 @default.
- W2912505052 cites W2112265338 @default.
- W2912505052 cites W2118382442 @default.
- W2912505052 cites W2120490947 @default.
- W2912505052 cites W2127063935 @default.
- W2912505052 cites W2154702940 @default.
- W2912505052 cites W2275415136 @default.
- W2912505052 cites W2460118749 @default.
- W2912505052 cites W2572767837 @default.
- W2912505052 cites W2585565556 @default.
- W2912505052 cites W2611219145 @default.
- W2912505052 cites W2612942414 @default.
- W2912505052 cites W2730090052 @default.
- W2912505052 cites W2786585192 @default.
- W2912505052 cites W2886397534 @default.
- W2912505052 cites W2905110430 @default.
- W2912505052 cites W3145128584 @default.
- W2912505052 cites W67385939 @default.
- W2912505052 cites W83921509 @default.
- W2912505052 doi "https://doi.org/10.1109/hipc.2018.00017" @default.
- W2912505052 hasPublicationYear "2018" @default.
- W2912505052 type Work @default.
- W2912505052 sameAs 2912505052 @default.
- W2912505052 citedByCount "1" @default.
- W2912505052 countsByYear W29125050522020 @default.
- W2912505052 crossrefType "proceedings-article" @default.
- W2912505052 hasAuthorship W2912505052A5018293840 @default.
- W2912505052 hasAuthorship W2912505052A5023412602 @default.
- W2912505052 hasConcept C11413529 @default.
- W2912505052 hasConcept C120373497 @default.
- W2912505052 hasConcept C132525143 @default.
- W2912505052 hasConcept C156891508 @default.
- W2912505052 hasConcept C173608175 @default.
- W2912505052 hasConcept C41008148 @default.
- W2912505052 hasConcept C80444323 @default.
- W2912505052 hasConceptScore W2912505052C11413529 @default.
- W2912505052 hasConceptScore W2912505052C120373497 @default.
- W2912505052 hasConceptScore W2912505052C132525143 @default.
- W2912505052 hasConceptScore W2912505052C156891508 @default.
- W2912505052 hasConceptScore W2912505052C173608175 @default.
- W2912505052 hasConceptScore W2912505052C41008148 @default.
- W2912505052 hasConceptScore W2912505052C80444323 @default.
- W2912505052 hasLocation W29125050521 @default.
- W2912505052 hasOpenAccess W2912505052 @default.
- W2912505052 hasPrimaryLocation W29125050521 @default.
- W2912505052 hasRelatedWork W1513409726 @default.
- W2912505052 hasRelatedWork W1517751221 @default.
- W2912505052 hasRelatedWork W1521841817 @default.
- W2912505052 hasRelatedWork W1580581198 @default.
- W2912505052 hasRelatedWork W1874851952 @default.
- W2912505052 hasRelatedWork W2242238830 @default.
- W2912505052 hasRelatedWork W2278083682 @default.
- W2912505052 hasRelatedWork W2358041763 @default.
- W2912505052 hasRelatedWork W2369379184 @default.
- W2912505052 hasRelatedWork W2954020579 @default.
- W2912505052 isParatext "false" @default.
- W2912505052 isRetracted "false" @default.
- W2912505052 magId "2912505052" @default.
- W2912505052 workType "article" @default.