3127

Efficient parallel algorithms for maximum-density segment problem

Xue Wang, Fasheng Qiu, S.K. Prasad, Guantao Chen
Comput. Sci., Georgia State Univ., Atlanta, GA, USA
IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2010

@conference{wang2010efficient,

   title={Efficient parallel algorithms for maximum-density segment problem},

   author={Wang, X. and Qiu, F. and Prasad, S.K. and Chen, G.},

   booktitle={Parallel & Distributed Processing (IPDPS), 2010 IEEE International Symposium on},

   pages={1–9},

   issn={1530-2075},

   year={2010},

   organization={IEEE}

}

Download Download (PDF)   View View   Source Source   

609

views

One of the fundamental problems involving DNA sequences is to find high density segments of certain widths, for example, those regions with intensive guanine and cytosine (GC). Formally, given a sequence, each element of which has a value and a width, the maximum-density segment problem asks for the segment with the maximum density while satisfying minimum and possibly maximum width constraints. While several linear-time sequential algorithms have emerged recently due to its primitive-like utility, to our knowledge, no nontrivial parallel algorithm has yet been proposed for this topical problem. In this paper, we propose an O(log^2 n)-time CREW PRAM algorithm using n processors to solve the generalized maximum-density problem, with a minimum width constraint and non-uniform widths. Besides, we describe an efficient implementation of the parallel algorithm on manycore GPUs (nVIDIA GeForce GTX 280), taking advantage of the full programmability of CUDA. This algorithm can process up to million-size sequence within a second using an nVIDIA GeForce GTX 280, thus demonstrating the practicality of this algorithm as a basic primitive for scientists. This may also indicate suitability of modern GPU architectures as implementation platform for certain PRAM algorithms.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: