Abstract
Given a string of lengthn, this short paper first presents anO(1)-time parallel algorithm for finding all initial palindromes and periods of the string on ann×n reconfigurable mesh (RM). Then, under the same cost (= time × the number of processors =O(n 2)), we provide a partitionable strategy when the RM doesn’t offer sufficient processors; this overcomes the hardware limitation and is very suitable for VLSI implementation.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theor. Comput. Sci.141, 163–173 (1995).
Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica14, 355–366 (1995).
Chen, H. N., Chung, K. L.: Partitionable bus-based string-matching algorithm for run-length coded strings with VLDCs. Research Report, Department of Inform. Mgmt. and Graduate Program of Inform. Engineering, National Taiwan University of Science and Technology, January 1996.
Chung, K. L.: Fast string matching algorithms for run-length coded strings. Computing54, 119–125 (1995).
Chung, K. L.:O(1) time parallel string-matching algorithm with VLDCs. Pattern Rec. Lett.17, 475–479 (1996).
Galil, G.: Optimal parallel algorithms for string matching. Inf. Control67, 144–157 (1985).
Miller, R., Prasanna-Kumar, V. K., Reisis, D. I., Stout, Q. F.: Parallel computations on reconfigurable meshes. IEEE Trans. Comput.42, 678–692 (1993).
Olariu, S., Schwing, J. L., Zhang, J.: Application of reconfigurable meshes to constant-time computations. Parallel Comput.19, 229–237 (1993).
Rothstein, J.: On the ultimate limitations of parallel processing. Proc. Int. Conf. Parallel Proc. pp., 206–212 (1976).
Author information
Authors and Affiliations
Additional information
Prof. Chung was supported in part by the National Science Council of R. O. C. under contracts NSC87-2213-E011-001 and NSC87-2213-E011-003.
Rights and permissions
About this article
Cite this article
Chung, K.L., Chen, H.N. Parallel finding all initial palindromes and periods of a string on reconfigurable meshes. Computing 61, 11–21 (1998). https://doi.org/10.1007/BF02684447
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02684447