Paper Info
Title
Performance Evaluation of Multiple Approximate String Matching Algorithms Implemented with MPI Paradigm in an Experimental Cluster Environment
Abstract
This paper describes and analyzes two high performance multiple string searching algorithms that we have optimized for cluster of heterogeneous workstations. The proposed parallel algorithms are based on dynamic master - worker programming paradigm. Experimental results show that these parallel algorithms are efficient: their search time is cut down significantly, whereas their communication cost stay at a low level.
Year
DOI
Venue
2008
10.1109/PCI.2008.13
Panhellenic Conference on Informatics
Keywords
Field
DocType
application program interfaces,message passing,parallel algorithms,string matching,MPI paradigm,approximate string matching algorithms,cluster environment,communication cost,dynamic master-worker programming paradigm,heterogeneous workstations,multiple string searching algorithms,performance evaluation,MPI,approximate string matching,cluster of heterogeneous workstations
String searching algorithm,Approximation algorithm,Algorithm design,Programming paradigm,Computer science,Parallel algorithm,Parallel computing,Approximate string matching,Cluster analysis,Message passing
Conference
Citations 
PageRank 
References 
0
0.34
4
Authors
2
Name
Order
Citations
PageRank
Panagiotis D. Michailidis16011.16
Konstantinos G. Margaritis230345.46