Biological sequence comparison application in heterogeneous environments with dynamic programming algorithms

Authors:
Marcelo N. P. Santana;Alba Cristina M. A. Melo
Affiliations:
Department of Computer Science, University of Brasilia, Brasilia, DF, Brazil;Department of Computer Science, University of Brasilia, Brasilia, DF, Brazil
Venue:
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
Year:
2007

Citing 8
Cited 0

Scalable Parallel Computing: Technology,Architecture,Programming

Scalable Parallel Computing: Technology,Architecture,Programming
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Mapping and Load-Balancing Iterative Computations

IEEE Transactions on Parallel and Distributed Systems
Space and Time Optimal Parallel Sequence Alignments

IEEE Transactions on Parallel and Distributed Systems
Heuristics for Work Distribution of a Homogeneous Parallel Dynamic Programming Scheme on Heterogeneous Systems

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Communication Contention in Task Scheduling

IEEE Transactions on Parallel and Distributed Systems
An exact parallel algorithm to compare very long biological sequences in clusters of workstations

Cluster Computing
Parallel smith-waterman algorithm for local DNA comparison in a cluster of workstations

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents the design and evaluation of a task allocation framework for Biological Sequence Comparison applications that use dynamic programming and run in heterogeneous environments. The framework is composed by four modules and either task allocation policies or applications can be integrated to it. The results obtained with four different task allocation policies in a 10-machine heterogeneous environment show that, for some sequence sizes, we were able to reduce the execution time of the parallel application in 54.2%, with the appropriate allocation policy.