A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations

Niewiadomski, Robert; Amaral, José Nelson; Holte, Robert C.

doi:10.1109/icpp.2006.9

Cited by 11 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parallel BFS (pBFS) strategy is used to speed up the path's calculation. For the execution of the pBFS strategy, the same MATLAB and Python codes will be running on several processors and each processor can access the generated nodes from the other processors [24]. All calculated nodes will be stored in the MySQL database.…”

Section: Breadth-first Searchmentioning

confidence: 99%

Investigation of Fast, Secure and Reliable Network Restoration after Blackouts

et al. 2020

View full text Add to dashboard Cite

Integrating distributed generation into power grids creates various technical challenges for network operation. Volatility of renewable energy resources may increase the probability of blackouts. In order to restore networks fast, securely and reliably after blackouts, within the research project RestoreGrid4RES’s network restoration strategies, the related issues caused by distributed generation are investigated and novel methods to face those challenges are developed. This paper focuses on (i) algorithms to identify possible restoration paths, (ii) key performance indicators for the assessment of grid restoration options and (iii) an evaluation of the results for network restoration strategies.

show abstract

Section: Breadth-first Searchmentioning

confidence: 99%

Investigation of Fast, Secure and Reliable Network Restoration after Blackouts

et al. 2020

View full text Add to dashboard Cite

show abstract

“…There are many parallel graph algorithms, including breadth-first search (BFS) [1], [4], [11], minimum-cost path [12] and flow analysis [13]. However, parallelising CFLreachability-based pointer analysis poses different challenges.…”

Section: Parallel Graph Algorithmsmentioning

confidence: 99%

Parallel Pointer Analysis with CFL-Reachability

Xue

2014

2014 43rd International Conference on Parallel Processing

View full text Add to dashboard Cite

Abstract-This paper presents the first parallel implementation of pointer analysis with Context-Free Language (CFL) reachability, an important foundation for supporting demand queries in compiler optimisation and software engineering. Formulated as a graph traversal problem (often with context-and field-sensitivity for desired precision) and driven by queries (issued often in batch mode), this analysis is non-trivial to parallelise.We introduce a parallel solution to the CFL-reachability-based pointer analysis, with context-and field-sensitivity. We exploit its inherent parallelism by avoiding redundant graph traversals with two novel techniques, data sharing and query scheduling. With data sharing, paths discovered in answering a query are recorded as shortcuts so that subsequent queries will take the shortcuts instead of re-traversing its associated paths. With query scheduling, queries are prioritised according to their statically estimated dependences so that more redundant traversals can be further avoided. Evaluated using a set of 20 Java programs, our parallel implementation of CFL-reachability-based pointer analysis achieves an average speedup of 16.2X over a state-ofthe-art sequential implementation on 16 CPU cores.

show abstract

“…The initial DDD algorithm used a breadth-first frontier search and therefore only the previous depth-layer was required for duplicate detection. A parallel version was later presented by Niewiadomski, Amaral, and Holte (2006a), which split each depth layer into sections and maintained separate input and output lists for each. These were later merged in order to perform the usual sorting and duplicate detection methods.…”

Section: Simple Parallel Best-first Searchmentioning

confidence: 99%

Best-First Heuristic Search for Multicore Machines

Burns¹,

Lemons²,

Ruml³

et al. 2010

jair

113

View full text Add to dashboard Cite

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals.

show abstract

A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations

Cited by 11 publications

References 11 publications

Investigation of Fast, Secure and Reliable Network Restoration after Blackouts

Investigation of Fast, Secure and Reliable Network Restoration after Blackouts

Parallel Pointer Analysis with CFL-Reachability

Best-First Heuristic Search for Multicore Machines

Contact Info

Product

Resources

About