메뉴 건너뛰기




Volumn , Issue , 2004, Pages 281-284

A systolic array structure for string searching

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARRAYS; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; GRAPH THEORY;

EID: 16244377480     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (19)
  • 1
    • 16244378163 scopus 로고    scopus 로고
    • A fast string search algorithm for deep packet classification
    • to appear
    • A. N. M. E. Rafiq, M. W. El-Kharashi, and F. Gebali, "A fast string search algorithm for deep packet classification," Elsevier Science (to appear), 2004.
    • (2004) Elsevier Science
    • Rafiq, A.N.M.E.1    El-Kharashi, M.W.2    Gebali, F.3
  • 2
    • 0003893064 scopus 로고
    • ser. Lecture Notes Series on Computing, D. T. Lee, Ed. Bangor, Gwynedd, UK: World Scientific
    • G. A. Stephen, String Searching Algorithms, ser. Lecture Notes Series on Computing, D. T. Lee, Ed. Bangor, Gwynedd, UK: World Scientific, 1994, vol. 3.
    • (1994) String Searching Algorithms , vol.3
    • Stephen, G.A.1
  • 3
    • 0032047091 scopus 로고    scopus 로고
    • Experiments on string matching in memory structures
    • Apr.
    • T. Lecroq, "Experiments on string matching in memory structures," Software: Practice and Experience, vol. 28, no. 5, pp. 561-568, Apr. 1998.
    • (1998) Software: Practice and Experience , vol.28 , Issue.5 , pp. 561-568
    • Lecroq, T.1
  • 4
    • 0003859414 scopus 로고
    • Englewood Cliffs, New Jersey: Prentice-Hall
    • S. Y. Kung, VLSI Array Processors. Englewood Cliffs, New Jersey: Prentice-Hall, 1988.
    • (1988) VLSI Array Processors
    • Kung, S.Y.1
  • 5
    • 0002842254 scopus 로고
    • Systolic arrays for VLSI
    • Philadelphia, PA: Society of Industrial and Applied Mathematicians
    • H. T. Kung and C. E. Leiserson, "Systolic arrays for VLSI," in Sparse Matrix Symposium. Philadelphia, PA: Society of Industrial and Applied Mathematicians, 1978, pp. 256-282.
    • (1978) Sparse Matrix Symposium , pp. 256-282
    • Kung, H.T.1    Leiserson, C.E.2
  • 6
    • 0023984385 scopus 로고
    • Regular iterative algorithms and their implementation on processor arrays
    • Mar.
    • S. K. Rao and T. Kailath, "Regular iterative algorithms and their implementation on processor arrays," Proceedings of the IEEE, vol. 76, no. 3, pp. 259-269, Mar. 1988.
    • (1988) Proceedings of the IEEE , vol.76 , Issue.3 , pp. 259-269
    • Rao, S.K.1    Kailath, T.2
  • 10
    • 16244389203 scopus 로고    scopus 로고
    • Apr. Hyperplane, html. [Online]
    • (2004, Apr.) Hyperplane, html. [Online]. Available: http://mathworld. wolfram.com/Hyperplane.html
    • (2004)
  • 11
    • 0023207478 scopus 로고
    • VLSI architectures for string matching and pattern matching
    • H. D. Cheng and K. S. Fu, "VLSI architectures for string matching and pattern matching," Pattern Recognition, vol. 20, no. 1, pp. 125-141, 1987.
    • (1987) Pattern Recognition , vol.20 , Issue.1 , pp. 125-141
    • Cheng, H.D.1    Fu, K.S.2
  • 12
    • 0025385255 scopus 로고
    • Performance and architectural issues for string matching
    • Feb.
    • M. E. Isenman and D. E. Shasha, "Performance and architectural issues for string matching," IEEE Transactions on Computers, vol. 39, no. 2, pp. 238-250, Feb. 1990.
    • (1990) IEEE Transactions on Computers , vol.39 , Issue.2 , pp. 238-250
    • Isenman, M.E.1    Shasha, D.E.2
  • 13
    • 34250812657 scopus 로고
    • Hardware algorithms for determining similarity between two strings
    • Apr.
    • A. Mukherjee, "Hardware algorithms for determining similarity between two strings," IEEE Transactions on Computers, vol. 38, no. 4, pp. 600-603, Apr. 1989.
    • (1989) IEEE Transactions on Computers , vol.38 , Issue.4 , pp. 600-603
    • Mukherjee, A.1
  • 14
    • 0346403189 scopus 로고    scopus 로고
    • Efficient parallel hardware algorithms for string matching
    • Oct.
    • J. H. Park and K. M. George, "Efficient parallel hardware algorithms for string matching," Microprocessors and Microsystems, vol. 23, no. 3, pp. 155-168, Oct. 1999.
    • (1999) Microprocessors and Microsystems , vol.23 , Issue.3 , pp. 155-168
    • Park, J.H.1    George, K.M.2
  • 15
    • 0018480118 scopus 로고
    • Hardware algorithms for non-numeric computation
    • A. Mukhopadhyay, "Hardware algorithms for non-numeric computation," IEEE Transactions on Computers, vol. 28, no. 6, pp. 384-394, 1979.
    • (1979) IEEE Transactions on Computers , vol.28 , Issue.6 , pp. 384-394
    • Mukhopadhyay, A.1
  • 16
    • 0018918431 scopus 로고
    • The design of special-purpose VLSI chips
    • Jan.
    • M. J. Foster and H. T. Kung, "The design of special-purpose VLSI chips," Computer, vol. 13, no. 1, pp. 26-38, Jan. 1980.
    • (1980) Computer , vol.13 , Issue.1 , pp. 26-38
    • Foster, M.J.1    Kung, H.T.2
  • 18
    • 16244366067 scopus 로고    scopus 로고
    • Bit-level processor array architecture for flexible string matching
    • Thessaloniki, Greece, November
    • _, "Bit-level processor array architecture for flexible string matching," in Proceedings of the 1st Balkan Conference in Informatics (BCI'2003), Thessaloniki, Greece, November 2003, pp. 517-526.
    • (2003) Proceedings of the 1st Balkan Conference in Informatics (BCI'2003) , pp. 517-526
  • 19
    • 0041810538 scopus 로고    scopus 로고
    • A note on scheduling multiprocessor tasks with identical processing times
    • Nov.
    • P. Baptiste, "A note on scheduling multiprocessor tasks with identical processing times," Computers & Operations Research, vol. 30, no. 13, pp. 2071-2078, Nov. 2003.
    • (2003) Computers & Operations Research , vol.30 , Issue.13 , pp. 2071-2078
    • Baptiste, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.