A FAST PATTERN-MATCHING ALGORITHM ON MODULAR MESH-CONNECTED COMPUTERS WITH MULTIPLE BUSES
-
Published:1995-04
Issue:02
Volume:09
Page:411-419
-
ISSN:0218-0014
-
Container-title:International Journal of Pattern Recognition and Artificial Intelligence
-
language:en
-
Short-container-title:Int. J. Patt. Recogn. Artif. Intell.
Affiliation:
1. Department of Information Management National Taiwan Institute of Technology No. 43, Section 4, Keelung Road, Taipei, Taiwan 10672, R.O.C.
Abstract
Given a pattern of length m and a text of length n, commonly m≪n, this paper presents a randomized parallel algorithm for pattern matching in O(n1/10) (=O(n1/10+(n−m)1/10)) time on a newly proposed n3/5×n2/5 modular meshconnected computers with multiple buses. Furthermore, the time bound of our parallel algorithm can be reduced to O(n1/11) if fewer processors are used.
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition,Software