A parallel, out-of-core algorithm for RNA secondary structure prediction

Wenduo Zhou, David K Lowenthal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

RNA pseudoknot prediction is an algorithm for RNA sequence search and alignment. An important building block towards pseudoknot prediction is RNA secondary structure prediction. The difficulty of extending the secondary structure prediction algorithm to a parallel program is (1) it has complicated data dependences, and (2) it has a large data set that typically cannot fit completely in main memory. In this paper, we propose a new out-of-core, distributed-memory algorithm for RNA secondary structure prediction. Its novelty lies in its redundant file scheme, I/O-reducing in-core buffer mechanism, and dynamic load balancing algorithm. Experimental results obtained on 16 Sun UltraSPARC IIIi nodes provide evidence that our approach achieves good speedup. Furthermore, we found that counterintuitively, the size of the in-memory buffer is critical to efficiency of the parallel program.

Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Parallel Processing
Pages74-81
Number of pages8
DOIs
StatePublished - 2006
Externally publishedYes
EventICPP 2006: 2006 International Conference on Parallel Processing - Columbus, OH, United States
Duration: Aug 14 2006Aug 18 2006

Other

OtherICPP 2006: 2006 International Conference on Parallel Processing
CountryUnited States
CityColumbus, OH
Period8/14/068/18/06

Fingerprint

RNA
Data storage equipment
Dynamic loads
Sun
Resource allocation

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering(all)

Cite this

Zhou, W., & Lowenthal, D. K. (2006). A parallel, out-of-core algorithm for RNA secondary structure prediction. In Proceedings of the International Conference on Parallel Processing (pp. 74-81). [1690607] https://doi.org/10.1109/ICPP.2006.10

A parallel, out-of-core algorithm for RNA secondary structure prediction. / Zhou, Wenduo; Lowenthal, David K.

Proceedings of the International Conference on Parallel Processing. 2006. p. 74-81 1690607.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhou, W & Lowenthal, DK 2006, A parallel, out-of-core algorithm for RNA secondary structure prediction. in Proceedings of the International Conference on Parallel Processing., 1690607, pp. 74-81, ICPP 2006: 2006 International Conference on Parallel Processing, Columbus, OH, United States, 8/14/06. https://doi.org/10.1109/ICPP.2006.10
Zhou W, Lowenthal DK. A parallel, out-of-core algorithm for RNA secondary structure prediction. In Proceedings of the International Conference on Parallel Processing. 2006. p. 74-81. 1690607 https://doi.org/10.1109/ICPP.2006.10
Zhou, Wenduo ; Lowenthal, David K. / A parallel, out-of-core algorithm for RNA secondary structure prediction. Proceedings of the International Conference on Parallel Processing. 2006. pp. 74-81
@inproceedings{194665f10aad4ed382af6e0604cc9126,
title = "A parallel, out-of-core algorithm for RNA secondary structure prediction",
abstract = "RNA pseudoknot prediction is an algorithm for RNA sequence search and alignment. An important building block towards pseudoknot prediction is RNA secondary structure prediction. The difficulty of extending the secondary structure prediction algorithm to a parallel program is (1) it has complicated data dependences, and (2) it has a large data set that typically cannot fit completely in main memory. In this paper, we propose a new out-of-core, distributed-memory algorithm for RNA secondary structure prediction. Its novelty lies in its redundant file scheme, I/O-reducing in-core buffer mechanism, and dynamic load balancing algorithm. Experimental results obtained on 16 Sun UltraSPARC IIIi nodes provide evidence that our approach achieves good speedup. Furthermore, we found that counterintuitively, the size of the in-memory buffer is critical to efficiency of the parallel program.",
author = "Wenduo Zhou and Lowenthal, {David K}",
year = "2006",
doi = "10.1109/ICPP.2006.10",
language = "English (US)",
isbn = "0769526365",
pages = "74--81",
booktitle = "Proceedings of the International Conference on Parallel Processing",

}

TY - GEN

T1 - A parallel, out-of-core algorithm for RNA secondary structure prediction

AU - Zhou, Wenduo

AU - Lowenthal, David K

PY - 2006

Y1 - 2006

N2 - RNA pseudoknot prediction is an algorithm for RNA sequence search and alignment. An important building block towards pseudoknot prediction is RNA secondary structure prediction. The difficulty of extending the secondary structure prediction algorithm to a parallel program is (1) it has complicated data dependences, and (2) it has a large data set that typically cannot fit completely in main memory. In this paper, we propose a new out-of-core, distributed-memory algorithm for RNA secondary structure prediction. Its novelty lies in its redundant file scheme, I/O-reducing in-core buffer mechanism, and dynamic load balancing algorithm. Experimental results obtained on 16 Sun UltraSPARC IIIi nodes provide evidence that our approach achieves good speedup. Furthermore, we found that counterintuitively, the size of the in-memory buffer is critical to efficiency of the parallel program.

AB - RNA pseudoknot prediction is an algorithm for RNA sequence search and alignment. An important building block towards pseudoknot prediction is RNA secondary structure prediction. The difficulty of extending the secondary structure prediction algorithm to a parallel program is (1) it has complicated data dependences, and (2) it has a large data set that typically cannot fit completely in main memory. In this paper, we propose a new out-of-core, distributed-memory algorithm for RNA secondary structure prediction. Its novelty lies in its redundant file scheme, I/O-reducing in-core buffer mechanism, and dynamic load balancing algorithm. Experimental results obtained on 16 Sun UltraSPARC IIIi nodes provide evidence that our approach achieves good speedup. Furthermore, we found that counterintuitively, the size of the in-memory buffer is critical to efficiency of the parallel program.

UR - http://www.scopus.com/inward/record.url?scp=34547423242&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547423242&partnerID=8YFLogxK

U2 - 10.1109/ICPP.2006.10

DO - 10.1109/ICPP.2006.10

M3 - Conference contribution

SN - 0769526365

SN - 9780769526362

SP - 74

EP - 81

BT - Proceedings of the International Conference on Parallel Processing

ER -