کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4956804 | 1364710 | 2016 | 25 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Parallel implementation of quorum planted (â, d) motif search on multi-core/many-core platforms
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Multi-core and many-core architectures are widely adopted by researchers in applied sciences and engineering, owing to their reasonable cost, and ease of access. Moreover, their painless hardware set-up process and rather simple programming paradigm attract more researchers to acquire them and implement their time-expensive computations on these platforms. Planted Motif Search problem is one of the most challenging problems in bioinformatics whose goal is to enumerate all strings of length â that are commonly planted in a given set of DNA sequences. In this paper, we propose an efficient method of thread parallelization to accelerate the latest Quorum Planted Motif Search algorithm (qPMS9) on multi-core and many-core systems. Our contribution towards dynamic scheduling of threads and parallelization of loops in the proposed method outperforms previous sequential and parallel algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Microprocessors and Microsystems - Volume 46, Part B, October 2016, Pages 255-263
Journal: Microprocessors and Microsystems - Volume 46, Part B, October 2016, Pages 255-263
نویسندگان
Fazeleh Sadat Kazemian, Mahmood Fazlali, Ali Katanforoush, Mojtaba Rezvani,