English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 13691815      Online Users : 36
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  Accelerating String Matching Using Multi-Threaded Algorithm on GPU


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66913


    Title: Accelerating String Matching Using Multi-Threaded Algorithm on GPU
    Authors: Cheng-Hung Lin;Sheng-Yu Tsai;Chen-Hsiung Liu;Shih-Chieh Chang;Jyuo-Min Shyu
    教師: 張世杰
    Date: 2010
    Relation: Proc. IEEE GLOBAL COMMUNICATIONS CONFERENCE (IEEE GLOBECOM 2010),Miami,Florida,USA,December 6-10,2010
    Keywords: Accelerating String Matching
    Multi-Threaded Algorithm
    GPU
    Abstract: Network Intrusion Detection System has been widely used to protect computer systems from network attacks. Due to the ever-increasing number of attacks and network complexity, traditional software approaches on uni-processors have become inadequate for the current high-speed network. In this paper, we propose a novel parallel algorithm to speedup string matching performed on GPUs. We also innovate new state machine for string matching, the state machine of which is more suitable to be performed on GPU. We have also described several speedup techniques considering special architecture properties of GPU. The experimental results demonstrate the new algorithm on GPUs achieves up to 4,000 times speedup compared to the AC algorithm on CPU. Compared to other GPU approaches, the new algorithm achieves 3 times faster with significant improvement on memory efficiency. Furthermore, because the new Algorithm reduces the complexity of the Aho-Corasick algorithm, the new algorithm also improves on memory requirements.
    URI: http://www.gpucomputing.net/?q=node/3415
    http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/66913
    Appears in Collections:[資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML523View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback