DocumentCode
1326860
Title
The density advantage of configurable computing
Author
DeHon, André
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
Volume
33
Issue
4
fYear
2000
fDate
4/1/2000 12:00:00 AM
Firstpage
41
Lastpage
49
Abstract
More and more, field-programmable gate arrays (FPGAs) are accelerating computing applications. The absolute performance achieved by these configurable machines has been impressive-often one to two orders of magnitude greater than processor-based alternatives. Configurable computing is one of the fastest, most economical ways to solve problems such as RSA (Rivest-Shamir-Adelman) decryption, DNA sequence matching, signal processing, emulation, and cryptographic attacks. But questions remain as to why FPGAs have been so much more successful than their microprocessor and DSP counterparts. Do FPGA architectures have inherent advantages? Or are these examples just flukes of technology and market pricing? Will advantages increase, decrease, or remain the same as technology advances? Is there some generalization that accounts for the advantages in these cases? The author attempts to answer these questions and to see how configurable computing fits into the arsenal of structures used to build general, programmable computing platforms
Keywords
field programmable gate arrays; reconfigurable architectures; DNA sequence matching; FPGAs; RSA decryption; absolute performance; configurable computing; configurable machines; cryptographic attacks; emulation; programmable computing; signal processing; Acceleration; Array signal processing; Computer applications; Cryptography; DNA computing; Digital signal processing; Emulation; Field programmable gate arrays; Microprocessors; Sequences;
fLanguage
English
Journal_Title
Computer
Publisher
ieee
ISSN
0018-9162
Type
jour
DOI
10.1109/2.839320
Filename
839320
Link To Document