GPU accelerated on-the-fly reachability checking
Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs ar...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2015
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4951 https://ink.library.smu.edu.sg/context/sis_research/article/5954/viewcontent/ICECCS2015b.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-5954 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-59542020-02-27T03:19:25Z GPU accelerated on-the-fly reachability checking WU, Zhimin LIU, Yang SUN, Jun SHI, Jianqi QIN, Shengchao Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs are fully utilized during the state space exploration.To this end, we firstly construct a compact data encoding of the input transition systems to reduce the memory cost and fit the calculation in GPUs. To support a large number of concurrent components, we propose a multi-integer encoding with conflict-release accessing approach. We then develop a BFS-based state space generation algorithm in GPUs, which makes full use of the GPU memory hierarchy and the latest dynamic parallelism feature in CUDA to achieve a high parallelism. GPURC also supports a parallel collaborative event synchronization approach and integrates a GPU hashing method to reduce the cost of data accessing. The experiments show that GPURC can give significant performance speedup (average 50X and up to 100X) compared with the traditional sequential algorithms. 2015-12-12T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4951 info:doi/10.1109/ICECCS.2015.21 https://ink.library.smu.edu.sg/context/sis_research/article/5954/viewcontent/ICECCS2015b.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Computer and Systems Architecture Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Computer and Systems Architecture Software Engineering |
spellingShingle |
Computer and Systems Architecture Software Engineering WU, Zhimin LIU, Yang SUN, Jun SHI, Jianqi QIN, Shengchao GPU accelerated on-the-fly reachability checking |
description |
Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs are fully utilized during the state space exploration.To this end, we firstly construct a compact data encoding of the input transition systems to reduce the memory cost and fit the calculation in GPUs. To support a large number of concurrent components, we propose a multi-integer encoding with conflict-release accessing approach. We then develop a BFS-based state space generation algorithm in GPUs, which makes full use of the GPU memory hierarchy and the latest dynamic parallelism feature in CUDA to achieve a high parallelism. GPURC also supports a parallel collaborative event synchronization approach and integrates a GPU hashing method to reduce the cost of data accessing. The experiments show that GPURC can give significant performance speedup (average 50X and up to 100X) compared with the traditional sequential algorithms. |
format |
text |
author |
WU, Zhimin LIU, Yang SUN, Jun SHI, Jianqi QIN, Shengchao |
author_facet |
WU, Zhimin LIU, Yang SUN, Jun SHI, Jianqi QIN, Shengchao |
author_sort |
WU, Zhimin |
title |
GPU accelerated on-the-fly reachability checking |
title_short |
GPU accelerated on-the-fly reachability checking |
title_full |
GPU accelerated on-the-fly reachability checking |
title_fullStr |
GPU accelerated on-the-fly reachability checking |
title_full_unstemmed |
GPU accelerated on-the-fly reachability checking |
title_sort |
gpu accelerated on-the-fly reachability checking |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2015 |
url |
https://ink.library.smu.edu.sg/sis_research/4951 https://ink.library.smu.edu.sg/context/sis_research/article/5954/viewcontent/ICECCS2015b.pdf |
_version_ |
1770575156492632064 |