String Matching Problem on a Cluster of Personal Computers: Experimental Results
نویسندگان
چکیده
In this paper we present a parallel implementation for solving the string matching problem. Experiments are realized using the Message Passing Interface (MPI) library on a cluster of personal computers, interconnected by a high-performance Fast Ethernet network. Significant speedup was achieved using different text sizes and number of processors.
منابع مشابه
String Matching Problem on a Cluster of Personal Computers: Performance Modeling
This paper presents an analytical performance prediction model and methodology that can be used to predict the execution time, speedup and similar performance metrics of a string matching algorithm running on a cluster of personal computers. The developed performance model has been checked on a 6-cluster of computers and it has been shown that this model is able to predict the parallel run-time...
متن کاملTHE PC-TAU METHOD ON THE SOLUTION OF A MODEL OF AN ISOLATED COSMIC STRING
In this paper, we adapt the operational Tau Method for personal computers and apply it to a system of two nonlinear second order ordinary differential equations which are related to general relativity. The interesting behaviour this problem exhibits in its numerical treatment is discussed. In this problem, we try to use the Tau perturbation term to locate the correct solution of this nonlin...
متن کاملApproximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string matching algorithms find many applications, such as gazetteers, address matching, and geographic information retrieval. This paper presents a novel method for approximate string matching, developed for the recognition of...
متن کاملAverage-optimal string matching
The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple matching of carefully chosen pattern subsequences. While this is seemingly more difficult than the original problem, we show that the idea leads...
متن کاملParallelization of Multiple String Matching on a Cluster Platform
This work proposes four parallel methods for multipattern matching which are executed on a heterogeneous cluster. These parallel methods are based on the master worker paradigm and they implements different partitioning schemes such as static and dynamic load balancing. Furthermore, the parallel methods are analyzed experimentally using the Message Passing Interface (MPI) library on a cluster o...
متن کامل