Skip to main content
SpringerLink
Log in

Parallel finding all initial palindromes and periods of a string on reconfigurable meshes

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theor. Comput. Sci.141, 163–173 (1995).

    Article  MATH  Google Scholar 

  2. Breslauer, D., Galil, Z.: Finding all periods and initial palindromes of a string in parallel. Algorithmica14, 355–366 (1995).

    Article  MATH  Google Scholar 

  3. 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.

  4. Chung, K. L.: Fast string matching algorithms for run-length coded strings. Computing54, 119–125 (1995).

    Article  Google Scholar 

  5. Chung, K. L.:O(1) time parallel string-matching algorithm with VLDCs. Pattern Rec. Lett.17, 475–479 (1996).

    Article  Google Scholar 

  6. Galil, G.: Optimal parallel algorithms for string matching. Inf. Control67, 144–157 (1985).

    Article  MATH  Google Scholar 

  7. Miller, R., Prasanna-Kumar, V. K., Reisis, D. I., Stout, Q. F.: Parallel computations on reconfigurable meshes. IEEE Trans. Comput.42, 678–692 (1993).

    Article  Google Scholar 

  8. Olariu, S., Schwing, J. L., Zhang, J.: Application of reconfigurable meshes to constant-time computations. Parallel Comput.19, 229–237 (1993).

    Article  MATH  Google Scholar 

  9. Rothstein, J.: On the ultimate limitations of parallel processing. Proc. Int. Conf. Parallel Proc. pp., 206–212 (1976).

Download references

Author information

Authors and Affiliations

  1. Department of Information Management and Graduate Program of Information Engineering, National Taiwan University of Science and Technology, 43, Section 4, Keelung Rd., Taipei, Taiwan 10672, R.O.C.

    K. -L. Chung

  2. Department of Information Management, Van-Nung Institute of Technology, 63-1, Shuiwei, Chungli, Taoyuan, Taiwan 320, R.O.C.

    H. -N. Chen

Authors
  1. K. -L. Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. -N. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

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

Reprints 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

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02684447

Key words

Search

Navigation