scientific article; zbMATH DE number 1984233

MaRDI QIDQ4428652zbMATH OpenFDO

Authors Panagiotis D. Michailidis, Konstantinos G. Margaritis

Publication date 22 September 2003

zbMATH Keywords

Message Passing Interfacestatic text allocation

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Searching and sorting (68P10)

Recommendations

• Text searching on a heterogeneous cluster of workstations
• Parallel String Matching Algorithms
• scientific article; zbMATH DE number 1911105
• Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism
• Parallel application of Levenshtein distance to establish similarity between strings

Cited in

(2)

• A performance study of load balancing strategies for approximate string matching on an MPI heterogeneous system environment
• Parallel application of Levenshtein distance to establish similarity between strings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428652)