Design and analysis of a parallel VLSI string search algorithm

  • K. C. Lee
  • V. W. Mak
Associative Memories
Part of the Lecture Notes in Computer Science book series (LNCS, volume 368)


String searching is one of the basic operations in many areas of non-numeric processing. In this paper, we propose a parallel VLSI string search algorithm called the Data Parallel Pattern Matching (DPPM) algorithm. The DPPM algorithm can efficiently utilize the high degree of integration of VLSI technology to attain very high speed processing through parallelism. The DPPM algorithm serially broadcasts and compares the pattern to a block of data in parallel. Performance of the DPPM has been evaluated both analytically and experimentally. Based on the simulation statistics and timing analysis on the hardware prototype, a search rate of multiple gigabytes per second is achievable using 2 µm CMOS technology.


Block Size Data Block Partial Match Current Block Search Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ber87]
    Berra, P. B. and Troullinos, N. B., “Optical Techniques and Data/Knowledge Base Machines,” IEEE Computer, pp. 59–70, October, 1987.Google Scholar
  2. [Boy77]
    Boyer, R. S. and Moore, J. H., “A Fast String Searching Algorithm,” Communications of the ACM, vol. 20, no. 10, pp. 762–772, October, 1977.Google Scholar
  3. [Cur83]
    Curry, T. and Mukhopadhyay, A., “Realization of Efficient Non-Numeric Operations Through VLSI,” Proceedings of VLSI '83, 1983.Google Scholar
  4. [Fos80]
    Foster, M. J. and Kung, H. T., “The Design of Special Purpose Chips,” IEEE Computer, vol. 13, no. 1, pp. 26–40, January, 1980.Google Scholar
  5. [Hal83]
    Halaas, A., “A Systolic VLSI Matrix for a Family of Fundamental Search Problem,” Integration VLSI Journal, vol. 1, no. 4, pp. 269–282, December, 1983.Google Scholar
  6. [Has83]
    Haskin, R. L. and Hollaar, L. A., “Operational Characteristics of a Hardware-based Pattern Matcher,” ACM Transactions on Database Systems, vol. 8, no. 1, pp. 15–40, March, 1983.Google Scholar
  7. [Knu77]
    Knuth, D. E., Morris, Jr., J. H., and Pratt, V. R., “Fast Pattern Matching in Strings,” SIAM J. Comput., vol. 6, no. 2, pp. 323–350, June, 1977.Google Scholar
  8. [Kub88]
    Kubo, M., Masuda, I., Miyata, K. and Ogiue, K., “Perspective on BiCMOS VLSI's,” IEEE Journal of Solid-State Circuits, vol. 23, no. 1, February, 1988.Google Scholar
  9. [Kuc67]
    Kucera, H. and Nelson Francis, W., Computational Analysis of Present-Day American English, Brown University Press, Providence, 1967.Google Scholar
  10. [Lee88]
    Lee, K. C., Frieder, O., and Mak, V., “A Parallel VLSI Architecture for Unformatted Data Processing,” Proceedings of International Symposium on Databases in Parallel and Distributed Systems, pp. 80–86, December, 1988.Google Scholar
  11. [Mea76]
    Mead, C. A., Pashley, R. D., Britton, L. D., Yoshiaki, T., and Snado, Jr., S. F., “128-Bit Multicomparator,” IEEE Journal of Solid-State Circuits, vol. SC-11, no. 5, October, 1976.Google Scholar
  12. [Pra86]
    Pramanick, S., “Performance Analysis of a Database Filter Search Hardware,” IEEE Transactions on Computers, vol. C-35, no. 12, December, 1986.Google Scholar
  13. [Tak87]
    Takahashi, K., Yamada, H., and Hirata, M., “Intelligent String Search Processor to Accelerate Text Information Retrieval,” Proceedings of Fifth International Workshop on Database Machines, pp. 440–453, October, 1987.Google Scholar
  14. [Wes85]
    Weste, N. and Eshraghian, K., Principles of CMOS VLSI Design, Addison-Wesley Publishing Company, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • K. C. Lee
    • 1
  • V. W. Mak
    • 1
  1. 1.BellcoreMorristownU. S. A.

Personalised recommendations