A CGM/BSP Parallel Similarity Algorithm

C. E. R. AlvesE. N. CáceresF. DehneS. W. Song

We present a CGM/BSP algorithm for computing an alignment (or string editing) between two strings A and C, with |A| = m and |C| = n. The algorithm requires O(p) communication rounds and O(nm/p) local computing time, on a distributed memory parallel computer of p processors each with O(nm/p) memory. We also present implementation results obtained on Beowulf machine with 64 nodes.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: