By Topic

Performance Evaluation of Multiple Approximate String Matching Algorithms Implemented with MPI Paradigm in an Experimental Cluster Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Michailidis, P.D. ; Dept. of Appl. Inf., Univ. of Macedonia, Thessaloniki ; Margaritis, K.G.

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.

Published in:

Informatics, 2008. PCI '08. Panhellenic Conference on

Date of Conference:

28-30 Aug. 2008