A fault-tolerant parallel text searching technique on a cluster of workstations

  • Authors:
  • Odysseas Efremides;George Ivanov

  • Affiliations:
  • University of Hertfordshire, Hatfield, UK and IST Studies, Dept. of Computer Science, Athens, Greece;University of Hertfordshire, Hatfield, UK and IST Studies, Dept. of Computer Science, Athens, Greece

  • Venue:
  • ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A fault-tolerant parallel implementation of the well-known Brute Force pattern matching algorithm, using high level checkpointing, is investigated herein. The main objective is to provide reliability: the application returns having completed its computation task correctly. Using the MPICH NT MPI library, which lacks any internal fault tolerance support, the implementation aims at Windows based clusters. The performance of the approach is also investigated experimentally.