Lamp: tools for creating application-specific fpga coprocessors

作者: Martin C. Herbordt , Thomas David Vancourt

DOI:

关键词:

摘要: Field Programmable Gate Arrays (FPGAs) have begun to appear as accelerators for general computation. Their potential massive parallelism, high on-chip memory bandwidth, and customizable interconnection networks all contribute demonstrated 100-1000× increases in application performance relative current PCs. FPGA coprocessors been available niche markets years, are now appearing mainstream supercomputers from vendors including Cray Silicon Graphics. Available development tools do not address developers of computing applications, however. Traditional design meet the gate-level needs logic designers, but present a model that vanishingly few software can use. Likewise, designers understand structures performance, rarely know biology, biochemistry, or other applications need acceleration. Logic must both participate creating efficient, useful accelerators, their different kinds participation supported by tools. This work presents two major sets contributions. The first is proof example FPGAs give speedups large families bioinformatics computational biology (BCB), sequence alignment, molecule docking, string analysis. These demonstrations also provide beginnings library reusable structures. The second set contributions novel features accelerator based on Architecture Model Parameterization (LAMP). LAMP broad, point solutions narrow problem statements. separates who create efficient hardware structures, specialists tailor specific members family. This separation enables customization without access skills. Finally, provides mechanisms automating tradeoff between complexity quantity parallel processing elements (PEs), allowing fewer PEs larger numbers small ones, subject FPGA's resource constraints. creates unique ability allocate resources differently each member an family, according datatypes functions family member. Performance results prototype presented, using sample BCB applications.

参考文章(153)
Karlheinz Agsteiner, Sören Schulze, Dieter Monjau, Object-oriented high-level modeling of system components for the generation of VHDL code european design automation conference. pp. 436- 441 ,(1995) , 10.5555/224270.224365
Robert A. Ellis, Experiences with an evolving system IEEE Computer. ,vol. 6, pp. 29- 34 ,(1973) , 10.1109/MC.1973.6539091
L. Semeria, G. De Micheli, Resolution, optimization, and encoding of pointer variables for the behavioral synthesis from C IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. ,vol. 20, pp. 213- 233 ,(2001) , 10.1109/43.908442
Inbal Halperin, Buyong Ma, Haim Wolfson, Ruth Nussinov, Principles of docking: An overview of search algorithms and a guide to scoring functions Proteins. ,vol. 47, pp. 409- 443 ,(2002) , 10.1002/PROT.10115
William Bialek, David Botstein, Introductory science and mathematics education for 21st-Century biologists. Science. ,vol. 303, pp. 788- 790 ,(2004) , 10.1126/SCIENCE.1095480
Vytautas Stuikys, Robertas Damasevicius, Application of UML for hardware design based on design process model asia and south pacific design automation conference. pp. 244- 249 ,(2004) , 10.5555/1015090.1015148
Pablo Moisset, Pedro Diniz, Joonseok Park, Matching and searching analysis for parallel hardware implementation on FPGAs field programmable gate arrays. pp. 125- 133 ,(2001) , 10.1145/360276.360324
Dima Kozakov, Karl H. Clodfelter, Sandor Vajda, Carlos J. Camacho, Optimal clustering for detecting near-native conformations in protein docking. Biophysical Journal. ,vol. 89, pp. 867- 875 ,(2005) , 10.1529/BIOPHYSJ.104.058768
M.-W. Du, S.C. Chang, An approach to designing very fast approximate string matching algorithms IEEE Transactions on Knowledge and Data Engineering. ,vol. 6, pp. 620- 633 ,(1994) , 10.1109/69.298177
A. Mukherjee, Hardware algorithms for determining similarity between two strings IEEE Transactions on Computers. ,vol. 38, pp. 600- 603 ,(1989) , 10.1109/12.21153