메뉴 건너뛰기




Volumn , Issue , 2009, Pages 14-25

High-performance regular expression scanning on the cell/B.E. processor

Author keywords

Cell processor; Multi core; Regular expressions

Indexed keywords

ARCHITECTURE DESIGNS; CELL CHIPS; CELL PROCESSOR; CLOCK CYCLES; DATA VOLUME; DEDICATED HARDWARE; EXECUTION TIME; GENERAL TRENDS; MULTI CORE; MULTICORE ARCHITECTURES; MULTIPLE THREADS; PROCESSING POWER; PROGRAMMING LANGUAGE; PROOF OF CONCEPT; REGULAR EXPRESSIONS; RESOURCE UTILIZATIONS; SIMD INSTRUCTIONS; TOKENIZATION; WIKIPEDIA;

EID: 70449709567     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542275.1542284     Document Type: Conference Paper
Times cited : (28)

References (40)
  • 1
    • 70449724874 scopus 로고    scopus 로고
    • comScore Releases 2007 U.S. Internet Year in Review, Press Release, Jan. 2008.
    • comScore Releases 2007 U.S. Internet Year in Review, Press Release, Jan. 2008.
  • 2
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.6 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 4
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
    • (1970) Commun. ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 5
    • 33744519821 scopus 로고    scopus 로고
    • A CAM-based keyword match processor architecture
    • L. Bu and J. A. Chandy. A CAM-based keyword match processor architecture. Microelectronics Jnl., 37(8):828-836, 2006.
    • (2006) Microelectronics Jnl , vol.37 , Issue.8 , pp. 828-836
    • Bu, L.1    Chandy, J.A.2
  • 7
    • 70449698093 scopus 로고    scopus 로고
    • A Case Study in SIMD Text Processing with Parallel Bit Streams - UTF-8 to UTF-16 Transcoding
    • Salt Lake City, Utah, Feb
    • R. D. Cameron. A Case Study in SIMD Text Processing with Parallel Bit Streams - UTF-8 to UTF-16 Transcoding. In 2008 ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP'08), pages 91-98, Salt Lake City, Utah, Feb. 2008.
    • (2008) 2008 ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP'08) , pp. 91-98
    • Cameron, R.D.1
  • 8
    • 70449698092 scopus 로고    scopus 로고
    • Method and apparatus for processing character streams,
    • U.S. Patent 7400271, July
    • R. D. Cameron. Method and apparatus for processing character streams, U.S. Patent 7400271, July 2008.
    • (2008)
    • Cameron, R.D.1
  • 9
    • 85029508976 scopus 로고
    • From regular expressions to DFAs using compressed NFAs
    • CPM '92, A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Springer-Verlag
    • C. Chang and R. Paige. From regular expressions to DFAs using compressed NFAs. In CPM '92, A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Lecture Notes in Computer Science, No. 644, pages 88-108. Springer-Verlag, 1992.
    • (1992) Lecture Notes in Computer Science , vol.644 , pp. 88-108
    • Chang, C.1    Paige, R.2
  • 13
    • 70449707356 scopus 로고    scopus 로고
    • T. A. S. Foundation. Lucene, http://lucene.apache.org.
    • T. A. S. Foundation. Lucene, http://lucene.apache.org.
  • 14
    • 70350637734 scopus 로고
    • Signature matching in network processing using SIMD/GPU architectures
    • Technical Report, University of Wisconsin at Madison, Jan
    • N. Goyal, J. Ormont, R. Smith, K. Sankaralingam, and C. Estan. Signature matching in network processing using SIMD/GPU architectures. Technical Report 1628, University of Wisconsin at Madison, Jan. 2008.
    • (1628)
    • Goyal, N.1    Ormont, J.2    Smith, R.3    Sankaralingam, K.4    Estan, C.5
  • 15
    • 0024769837 scopus 로고
    • Efficient generation of lexical analysers
    • Nov
    • J. Grosch. Efficient generation of lexical analysers. Software - Practice and Experience, 19(11):1089-1103, Nov. 1989.
    • (1989) Software - Practice and Experience , vol.19 , Issue.11 , pp. 1089-1103
    • Grosch, J.1
  • 19
    • 34548110786 scopus 로고    scopus 로고
    • IDC Corporation, White Paper, March 2007
    • IDC Corporation. The expanding digital universe. White Paper, March 2007.
    • The expanding digital universe
  • 24
    • 33746923043 scopus 로고    scopus 로고
    • Cell Processor Interconnection Network: Built for Speed
    • May/June
    • M. Kistler, M. Perrone, and F. Petrini. Cell Processor Interconnection Network: Built for Speed. IEEE Micro, 25(3), May/June 2006.
    • (2006) IEEE Micro , vol.25 , Issue.3
    • Kistler, M.1    Perrone, M.2    Petrini, F.3
  • 28
    • 78651550268 scopus 로고    scopus 로고
    • Scalable parallel programming with CUDA
    • J. Nickolls, I. Buck, M. Garland, and K. Skadron. Scalable parallel programming with CUDA. ACM Queue, 6(2):40-53, 2008.
    • (2008) ACM Queue , vol.6 , Issue.2 , pp. 40-53
    • Nickolls, J.1    Buck, I.2    Garland, M.3    Skadron, K.4
  • 29
    • 3042751287 scopus 로고    scopus 로고
    • XML parsing: A threat to database performance
    • ACM
    • M. Nicola and J. John. XML parsing: A threat to database performance. In CIKM. ACM, 2003.
    • (2003) CIKM
    • Nicola, M.1    John, J.2
  • 30
    • 70449706073 scopus 로고    scopus 로고
    • V. Paxson. flex - a fast lexical analyzer generator, 1988.
    • V. Paxson. flex - a fast lexical analyzer generator, 1988.
  • 38
    • 33749400135 scopus 로고    scopus 로고
    • Parsing computer languages with an automaton compiled from a single regular expression
    • O. H. Ibarra and H.-C. Yen, editors, CIAA, of, Springer
    • A. D. Thurston. Parsing computer languages with an automaton compiled from a single regular expression. In O. H. Ibarra and H.-C. Yen, editors, CIAA, volume 4094 of Lecture Notes in Computer Science, pages 285-286. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4094 , pp. 285-286
    • Thurston, A.D.1


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