首页> 外文期刊>International Journal of Distributed and Parallel Systems >Parallel String Matching Algorithm Using Grid [
【24h】

Parallel String Matching Algorithm Using Grid [

机译:使用网格的并行字符串匹配算法[

获取原文
           

摘要

Grid computing provides solutions for various complex problems. Implementing computing intensive applications such as string matching problem on grid is inevitable. In this paper we present a new method for exact string matching based on grid computing. The function of the grid is to parallelize the string matching problem using grid MPI parallel programming method or loosely coupled parallel services on Grid. There can be dedicated grid, other way it can be resource sharing among the existing network of computing resources, we propose dedicated grid. Parallel applications fall under three categories namely Perfect parallelism, Data parallelism and Functional parallelism, we use data parallelism, and it is also called Single Program Multiple Data (SPMD) method, where given data is divided into several parts and working on the part simultaneously. This improves the executing time of the string matching algorithms on grid. The simulation results show significant improvement in executing time and speed up.
机译:网格计算为各种复杂问题提供了解决方案。在网格上实现诸如字符串匹配问题之类的计算密集型应用是不可避免的。在本文中,我们提出了一种基于网格计算的精确字符串匹配的新方法。网格的功能是使用网格MPI并行编程方法或网格上的松散耦合并行服务来并行化字符串匹配问题。可以有专用网格,也可以是现有计算资源网络之间的资源共享,我们提出了专用网格。并行应用程序分为完美并行性,数据并行性和功能并行性三类,我们使用数据并行性,也称为单程序多数据(SPMD)方法,其中将给定的数据分为几个部分并同时处理该部分。这提高了字符串匹配算法在网格上的执行时间。仿真结果表明,执行时间和速度显着提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号