Parallel Distributed Breadth First Search on the Kepler Architecture
نویسندگان
چکیده
منابع مشابه
Parallel Breadth-First Heuristic Search on a Shared-Memory Architecture
We consider a breadth-first approach to memory-efficient graph search and discuss how to parallelize it on a sharedmemory architecture that uses multithreading to achieve parallelism. The approach we develop for parallelizing breadthfirst search uses layer synchronization, in which threads expand all nodes in one layer of the breadth-first search graph before considering any nodes in the next l...
متن کاملLarge-Scale Parallel Breadth-First Search
Recently, best-first search algorithms have been introduced that store their nodes on disk, to avoid their inherent memory limitation. We introduce several improvements to the best of these, including parallel processing, to reduce their storage and time requirements. We also present a linear-time algorithm for bijectively mapping permutations to integers in lexicographic order. We use breadth-...
متن کاملParallel Breadth-First Search LTL Model-Checking
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detection of cycles (faulty runs) effectively employs the so called back-level edges. In particular, a parallel level-synchronized breadth-first search of the graph is performed to discover back-level edges. For each level th...
متن کاملTopologically Adaptive Parallel Breadth-first Search on Multicore Processors
Breadth-first Search (BFS) is a fundamental graph theory algorithm that is extensively used to abstract various challenging computational problems. Due to the fine-grained irregular memory accesses, parallelization of BFS can exhibit limited performance on cache-based systems. In this paper, we study the relationship between the topology of input graphs and the performance of BFS on multicore s...
متن کاملTorusBFS: A Novel Message-passing Parallel Breadth-First Search Architecture on FPGAs
Graphs are a fundamental data structure used extensively in numerous domains. In graph-based applications, Breadth-First Search (BFS) is a key component which suffers from long latency of memory accesses. In this paper, we present a novel message passing parallel BFS architecture namely TorusBFS on field-programmable gate array (FPGA). By utilizing the on-chip memories to store the visitation s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2016
ISSN: 1045-9219
DOI: 10.1109/tpds.2015.2475270