首页> 外文期刊>Software Engineering, IEEE Transactions on >Parallel Algorithms for Testing Finite State Machines:Generating UIO Sequences
【24h】

Parallel Algorithms for Testing Finite State Machines:Generating UIO Sequences

机译:测试有限状态机的并行算法:生成UIO序列

获取原文
获取原文并翻译 | 示例
           

摘要

This paper describes an efficient parallel algorithm that uses many-core GPUs for automatically deriving Unique Input Output sequences (UIOs) from Finite State Machines. The proposed algorithm uses the global scope of the GPU's global memory through coalesced memory access and minimises the transfer between CPU and GPU memory. The results of experiments indicate that the proposed method yields considerably better results compared to a single core UIO construction algorithm. Our algorithm is scalable and when multiple GPUs are added into the system the approach can handle FSMs whose size is larger than the memory available on a single GPU.
机译:本文介绍了一种有效的并行算法,该算法使用多核GPU从有限状态机自动推导唯一输入输出序列(UIO)。所提出的算法通过合并的内存访问来使用GPU全局内存的全局范围,并最大程度地减少了CPU与GPU内存之间的传输。实验结果表明,与单核UIO构造算法相比,该方法产生了更好的结果。我们的算法具有可扩展性,当系统中添加多个GPU时,该方法可以处理大小大于单个GPU可用内存的FSM。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号