This site is under development. For the current active site, go to bcbhub.csic.es.

Orcid Publication

Detalle de: On an efficient parallelization of exhaustive sequence comparison algorithms on message passing architectures

Title On an efficient parallelization of exhaustive sequence comparison algorithms on message passing architectures
Abstract

We present a new parallel computing approach to the case of exhaustive sequential sequence comparison algorithms on message-passing architectures. In this context a modification of guided self-scheduling as well as efficient buffering strategies are presented. We discuss two specific implementations, one on the Paramid parallel computer, and the other on a cluster of workstations running PVM. In both cases the parallel performance is higher than with any other method presented so far. The code is public domain and can be obtained by anonymous ftp at ftp.cnb.uam.es.

Apa Reference Trelles-Salazar, O., Zapata, E. & Carazo, J. (1994). On an efficient parallelization of exhaustive sequence comparison algorithms on message passing architectures. Bioinformatics, 10(5), 509-511. 10.1093/bioinformatics/10.5.509
Doi 10.1093/bioinformatics/10.5.509
Publication Date 1994
Publication Type Article
Researcher Jose María Salvador Carazo Garcia
Ontology Parallel Computing
Research Groups
Tools

Suggest changes

Publications are synced automatically from ORCID, so they can't be edited here directly. Spotted something wrong? Let us know below and we'll take care of it.

← Return to Home