Open Access

Local DNA sequence alignment in a cluster of workstations: Algorithms and tools

  • Alba Cristina M. A. Melo1, 2,
  • Maria Emilia M. T. Walter1, 2,
  • Renata Cristina F. Melo1, 2,
  • Marcelo N. P. Santana1, 2 and
  • Rodolfo B. Batista1, 2
Journal of the Brazilian Computer Society10:BF03192360

DOI: 10.1007/BF03192360


Distributed Shared Memory systems allow the use of the shared memory programming paradigm in distributed architectures where no physically shared memory exist. Scope consistent software DSMs provide a relaxed memory model that reduces the coherence overhead by ensuring consistency only at synchronization operations, on a per-lock basis. Much of the work in DSM systems is validated by benchmarks and there are only a few examples of real parallel applications running on DSM systems. Sequence comparison is a basic operation in DNA sequencing projects, and most of sequence comparison methods used are based on heuristics, that are faster but do not produce optimal alignments. Recently, many organisms had their DNA entirely sequenced, and this reality presents the need for comparing long DNA sequences, which is a challenging task due to its high demands for computational power and memory. In this article, we present and evaluate a parallelization strategy for implementing a sequence alignment algorithm for long sequences. This strategy was implemented in JIAJIA, a scope consistent software DSM system. Our results on an eight-machine cluster presented good speedups, showing that our parallelization strategy and programming support were appropriate.