###
DOI:
Journal of Software:2004.15(2):159-169

PRAM和LARPBS模型上的近似串匹配并行算法
钟诚,陈国良
(中国科学技术大学,计算机科学与技术系,安徽,合肥,230027;国家高性能计算中心,安徽,合肥,230027)
Parallel Algorithms for Approximate String Matching on PRAM and LARPBS
ZHONG Cheng,CHEN Guo-Liang
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 3336   Download 3378
Received:December 05, 2002    Revised:September 26, 2003
> 中文摘要: 近似串匹配技术在网络信息搜索、数字图书馆、模式识别、文本挖掘、IP路由查找、网络入侵检测、生物信息学、音乐研究计算等领域具有广泛的应用.基于CREW-PRAM(parallel random access machine with concurrent read and exclusive write)模型,采用波前式并行推进的方法直接计算编辑距离矩阵D,设计了一个允许k-差别的近似串匹配动态规划并行算法,该算法使用(m+1)个处理器,时间复杂度为O(n),算法理论上达到线性加速;采取水平和斜向双并行计算编辑距离矩阵D的方法,设计了一个使用((m+1)个处理器和O(n/(+m)时间的、可伸缩的、允许k-差别的近似串匹配动态规划并行算法,.基于分治策略,通过灵活拆分总线和合并子总线动态重构光总线系统,并充分利用光总线的消息播送技术和并行计算前缀和的方法,实现了汉明距离的并行计算,设计了两个基于LARPBS(linear arrays with reconfigurable pipelined bus system)模型的通信高效、可扩放的允许k-误配的近似串匹配并行算法,其中一个算法使用n个处理器,时间为O(m);另一个为常数时间算法,使用mn个处理器.
Abstract:Approximate string matching technique has been widely applied to many fields such as network information retrieval, digital library, pattern recognition, text mining, IP routing searching, network intrusion detection, bioinformatics, and computing in musicology. The two concise parallel dynamic programming algorithms for approximate string matching with k-differences on CREW-PRAM (parallel random access machine with concurrent read and exclusive write) are presented by parallel computing the edition distance matrix D in the wave-front approach and by parallel computing the edition distance matrix D along the diagonal and horizontal directions, respectively. The first algorithm requires O(n) time and obtains a linear speedup by (m+1) processors. The second algorithm needs O(n/a+m) time in use of a(m+1) processors, where 1
文章编号:     中图分类号:    文献标志码:
基金项目:Supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1998030403(国家重点基础研究发展规划(973));the National High-Tech Research and Development Plan of China under Grant No.2001AA111041(国家高技术研究发展计划(863)) Supported by the National Grand Fundamental Research 973 Program of China under Grant No.G1998030403(国家重点基础研究发展规划(973));the National High-Tech Research and Development Plan of China under Grant No.2001AA111041(国家高技术研究发展计划(863))
Foundation items:
Reference text:

钟诚,陈国良.PRAM和LARPBS模型上的近似串匹配并行算法.软件学报,2004,15(2):159-169

ZHONG Cheng,CHEN Guo-Liang.Parallel Algorithms for Approximate String Matching on PRAM and LARPBS.Journal of Software,2004,15(2):159-169