Accelerating Real-Time String Searching with Multicore Processors.

The article presents an optimization strategy for a popular algorithm that performs exact string matching against large dictionaries and offers solutions to alleviate computer memory congestion. The solution used by the authors is based on AC-opt, a variant of the Aho-Corasick algorithm that uses de...

Full description

Bibliographic Details
Published in:Computer (00189162) Vol. 41; no. 4; pp. 42 - 51
Main Authors: Villa, Oreste, Scarpazza, Daniele Paolo, Petrini, Fabrizio
Format: Article
Published: IEEE Apr2008
Subjects:
Online Access:View this record in EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=31912722&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 31912722
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00189162
        PUT
      jtl: Computer (00189162)
      issn: 00189162
      maglogo: N
    pubinfo:
      dt: Apr2008
      vid: 41
      iid: 4
      pid: 13605
      pub: IEEE
    artinfo:
      ui:
        31912722
        10.1109/MC.2008.105
      ppf: 42
      ppct: 9
      formats:
      tig:
        atl: Accelerating Real-Time String Searching with Multicore Processors.
      aug:
        au:
          Villa, Oreste
          Scarpazza, Daniele Paolo
          Petrini, Fabrizio
        affil:
          Politecnico di Milano/Pacific Northwest National Laboratory
          IBM T.J. Watson Research Center
      su:
        Program transformation
        Algorithms
        Encyclopedias & dictionaries
        Computer storage devices
        Sequential machine theory
        Information storage & retrieval systems
      sug:
        subj:
          Program transformation
          Algorithms
          Encyclopedias & dictionaries
          Computer storage devices
          Sequential machine theory
          Information storage & retrieval systems
      ab: The article presents an optimization strategy for a popular algorithm that performs exact string matching against large dictionaries and offers solutions to alleviate computer memory congestion. The solution used by the authors is based on AC-opt, a variant of the Aho-Corasick algorithm that uses deterministic finite automata to process separate chunks of input text. It cites the two-step loop of an AC-opt automation. The three major components of memory congestion are memory pressure, memory layout issues, and hot spots.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2008
    holdings:
      @attributes:
        islocal: N