Scholarlink

<p>The inherent computational complexity of validating and verifying concurrent systems implies a need to be able to exploit parallel and distributed computing architectures. We present a new distributed algorithm for state space exploration of concurrent systems on computing clusters. Our algorithm relies on Remote Direct Memory Access (RDMA) for low-latency transfer of states between computing elements and on state reconstruction trees for compact representation of states on the computing elements themselves. For the distribution of states between computing elements, we propose a concept of state stealing. We have implemented our proposed algorithm using the OpenSHMEM API for RDMA and experimentally evaluated it on the Grid’5000 testbed with a set of benchmark models. The experimental results show that our algorithm scales well with the number of available computing elements and that our state stealing mechanism generally provides a balanced workload distribution.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Evaluation of a distributed explicit state space exploration algorithm with state reconstruction for RDMA networks

  • 期刊论文

  • 发表日期：

    2025年2月10日

查看全文
  • Sami Evangelista,
  • Lars Michael Kristensen,
  • Laure Petrucci

摘要

The inherent computational complexity of validating and verifying concurrent systems implies a need to be able to exploit parallel and distributed computing architectures. We present a new distributed algorithm for state space exploration of concurrent systems on computing clusters. Our algorithm relies on Remote Direct Memory Access (RDMA) for low-latency transfer of states between computing elements and on state reconstruction trees for compact representation of states on the computing elements themselves. For the distribution of states between computing elements, we propose a concept of state stealing. We have implemented our proposed algorithm using the OpenSHMEM API for RDMA and experimentally evaluated it on the Grid’5000 testbed with a set of benchmark models. The experimental results show that our algorithm scales well with the number of available computing elements and that our state stealing mechanism generally provides a balanced workload distribution.