Optimizing Reconfigurable Hardware for Genomic Sequences Comparison

J.J. Marfil, D. Mozos
{"title":"Optimizing Reconfigurable Hardware for Genomic Sequences Comparison","authors":"J.J. Marfil, D. Mozos","doi":"10.1109/SPL.2008.4547763","DOIUrl":null,"url":null,"abstract":"Last advances in the bioinformatics field have lead to improve models and computational resources to satisfy the high computational cost needed to search and identify DNA sequences. This paper provides a FPGA-based systolic array implementation of the Smith-Waterman algorithm, which improves previous proposals, reducing the amount of hardware and the computing power needed. Besides, optimizations in memory access using prefetching and different sizes of the systolic array let us to increase the system's performance up to 60%.","PeriodicalId":372678,"journal":{"name":"2008 4th Southern Conference on Programmable Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th Southern Conference on Programmable Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPL.2008.4547763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Last advances in the bioinformatics field have lead to improve models and computational resources to satisfy the high computational cost needed to search and identify DNA sequences. This paper provides a FPGA-based systolic array implementation of the Smith-Waterman algorithm, which improves previous proposals, reducing the amount of hardware and the computing power needed. Besides, optimizations in memory access using prefetching and different sizes of the systolic array let us to increase the system's performance up to 60%.
优化可重构硬件基因组序列比较
生物信息学领域的最新进展导致了模型和计算资源的改进,以满足搜索和鉴定DNA序列所需的高计算成本。本文提供了一种基于fpga的Smith-Waterman算法的收缩阵列实现,改进了以前的方案,减少了硬件数量和所需的计算能力。此外,使用预取和不同大小的收缩数组对内存访问进行了优化,使系统性能提高了60%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信