Name
Abstract | ||
|---|---|---|
Genomic data are growing exponentially and are daily scanned by thousands of biologists. To reduce the scan time, efficient parallelism can be exploited by dispatching data among a cluster of processing units able to scan locally and independently their own data. If PC clusters are well suited to support this type of parallelism, we propose to substitute PCs by re-configurable hardware closely connected to a hard disk. We show that low cost FPGA nodes interconnected through a standard Ethernet network may advantageously compete against high performance clusters. A prototype of 48 re-configurable processing nodes has been experimented on two genomic applications: a content-based similarity search and a pattern search. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.parco.2004.12.005 | Parallel Computing |
Keywords | Field | DocType |
similarity search,large genomic bank,own data,re-configurable hardware,hard disk,pattern search,pc cluster,cluster,re-configurable node,re-configurable processing node,re-configurable architecture,genomic banks,content-based similarity search,genomic data,efficient parallelism,genomic application | Cluster (physics),Computer science,Parallel computing,Scan time,Field-programmable gate array,Ethernet,Pattern search,Nearest neighbor search | Journal |
Volume | Issue | ISSN |
31 | 1 | Parallel Computing |
Citations | PageRank | References |
3 | 0.41 | 13 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stéphane Guyetant | 1 | 40 | 4.87 |
| Mathieu Giraud | 2 | 124 | 15.28 |
| Ludovic L'hours | 3 | 3 | 0.75 |
| Steven Derrien | 4 | 10 | 1.51 |
| Stephane Rubini | 5 | 57 | 12.08 |
| Dominique Lavenier | 6 | 463 | 48.60 |
| Frédéric Raimbault | 7 | 17 | 3.34 |