Parallel String Matching Algorithm Using Grid

  • Rajashekharaiah K
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

See, stats, and : https : / / www . researchgate.net/publication/268291514ParallelArticleDOI:10.5121/ijdps.2012.3303CITATIONS3READS334,including:ViswanadhaJawaharlal,Hyderabad60SEEAll.The.AbstractGridcomputingprovidessolutionsforvariouscomplexproblems.Implementingcomputingintensiveapplicationssuchasstringmatchingproblemongridisinevitable.Inthispaperwepresentanewmethodforexactstringmatchingbasedongridcomputing.ThefunctionofthegridistoparallelizethestringmatchingproblemusinggridMPIparallelprogrammingmethodorlooselycoupledparallelservicesonGrid.Therecanbededicatedgrid,otherwayitcanberesourcesharingamongtheexistingnetworkofcomputingresources,weproposededicatedgrid.ParallelapplicationsfallunderthreecategoriesnamelyPerfectparallelism,DataparallelismandFunctionalparallelism,weusedataparallelism,anditisalsocalledSingleProgramMultipleData(SPMD)method,wheregivendataisdividedintoseveralpartsandworkingonthepartsimultaneously.Thisimprovestheexecutingtimeofthestringmatchingalgorithmsongrid.Thesimulationresultsshowsignificantimprovementinexecutingtimeandspeedup.

Cite

CITATION STYLE

APA

Rajashekharaiah, K. M. M. (2012). Parallel String Matching Algorithm Using Grid. International Journal of Distributed and Parallel Systems, 3(3), 21–28. https://doi.org/10.5121/ijdps.2012.3303

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free