Idioma:

A programmable array processor architecture for flexible approximate string matching algorithms

Michailidis, Panagiotis D. ; Margaritis, Konstantinos G.

Journal of parallel and distributed computing, 2007-02, Vol.67 (2), p.131-141 [Periódico revisado por pares]

San Diego, CA: Elsevier Inc

Texto completo disponível

Citações Citado por

Enviar para

Título:
A programmable array processor architecture for flexible approximate string matching algorithms
Autor: Michailidis, Panagiotis D. ; Margaritis, Konstantinos G.
Assuntos: Applied sciences ; Approximate string matching ; Array processors architectures ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; FPGA ; Information systems. Data bases ; Memory organisation. Data processing ; Parallel architectures ; Parallel implementations ; Software ; VLSI
É parte de: Journal of parallel and distributed computing, 2007-02, Vol.67 (2), p.131-141
Descrição: Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array processor architecture for a wide variety of approximate string matching algorithms to gain high performance at low cost. Further, we describe the architecture of the array and the architecture of the cell in detail in order to efficiently implement for both the preprocessing and searching phases of most string matching algorithms. Further, the architecture performs approximate string matching for complex patterns that contain don’t care, complement and classes symbols. We also simulate and evaluate the proposed architecture on a field programmable gate array (FPGA) device using the JHDL tool for synthesis and the Xilinx Foundation tools for mapping, placement, and routing. Finally, our programmable implementation achieves about 8–340 times faster execution than a desktop computer with a Pentium 4 3.5 GHz for all algorithms when the length of the pattern is 1024.
Editor: San Diego, CA: Elsevier Inc
Idioma: Inglês

Links

View record in Pascal Francis

Voltar para lista de resultados

Anterior Resultado 2 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

A programmable array processor architecture for flexible approximate string matching algorithms

Michailidis, Panagiotis D. ; Margaritis, Konstantinos G.

San Diego, CA: Elsevier Inc

Buscando em bases de dados remotas. Favor aguardar.