New methods for using Cayley graphs in interconnection networks
Discrete Applied Mathematics - Special double volume: interconnection networks
An Analysis of Bitstate Hashing
Formal Methods in System Design
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Efficient reduction of finite state model checking to reachability analysis
International Journal on Software Tools for Technology Transfer (STTT)
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
GPUTeraSort: high performance graphics co-processor sorting for large database management
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Disk Based Software Verification via Bounded Model Checking
APSEC '07 Proceedings of the 14th Asia-Pacific Software Engineering Conference
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Layered Duplicate Detection in External-Memory Model Checking
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
A Practical Quicksort Algorithm for Graphics Processors
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Flash-Efficient LTL Model Checking with Minimal Counterexamples
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Efficient large-scale model checking
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Best-first frontier search with delayed duplicate detection
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Parallel structured duplicate detection
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Minimizing disk I/O in two-bit breadth-first search
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Delayed duplicate detection: extended abstract
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
CUDA Accelerated LTL Model Checking
ICPADS '09 Proceedings of the 2009 15th International Conference on Parallel and Distributed Systems
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Minimal counterexample generation for SPIN
Proceedings of the 14th international SPIN conference on Model checking software
Scalable multi-core LTL model-checking
Proceedings of the 14th international SPIN conference on Model checking software
BEEM: benchmarks for explicit model checkers
Proceedings of the 14th international SPIN conference on Model checking software
Revisiting resistance speeds up I/O-efficient LTL model checking
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Editorial: Recent developments in high performance computing and security: An editorial
Future Generation Computer Systems
| Hi-index | 0.00 |
We accelerate breadth-first search by delegating complex operations to the graphics processing unit (GPU). The algorithm exploits external memory: if the state space becomes too large to be kept in main memory, it is maintained I/O-efficiently on disk. As in many other approaches for external memory graph search, we apply delayed duplicate detection. The search proceeds in breadth-first layers with increasing minimum distance from the start state. For each layer stored on disk, we load chunks into the systems memory, which are forwarded to the memory on the graphics card. Here we test if outgoing transitions are enabled and generate all successors. Finally, we eliminate duplicates delayed by sorting on the GPU. Even facing the overhead of I/O access, noticeable overall speed-ups are obtained.