Pattern-matching has been routinely used in various computer applications, for example, in editors, retrieval of information either textual, image, or sound and searching nucleotide or amino acid sequence patterns in genome and protein sequence databases. Pattern-matching algorithm matches the pattern exactly or approximately within the text. This paper presents the comparative analysis of various multiple pattern Text matching algorithms. The highly efficient algorithms like Brute Force algorithm, Knuth Morris Pratt algorithm, Finite Auto Mata algorithm, Bayer Moore algorithm for exact and approximate multi-object and multi-pattern matching on heterogeneous systems. After performing a detailed study on the above mentioned algorithms, the best algorithm having least complexity is chosen. Consequently, the comparison result proves that Bayer Moore Pattern matching algorithm is the most efficient One to apply on heterogeneous system for pattern matching.