An asynchronous approach to efficient execution of programs on adaptive architectures utilizing FPGAs

Agarwal, L.; Wazlowski, M.; Ghosh, Sumit

doi:10.1109/fpga.1994.315606

Cited by 18 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The result of the multiplication is 64-bits, but only the most significant 32 bits are sent out. As a result, 3.77 x 10 -11 < e -a _< 0.998051781.…”

Section: 00000000000000000000001mentioning

confidence: 99%

“…Since a is a 28-bit binary number, the value comprising bits 27 to 14 of a represent b, and the value comprising bits 13 to 0 of a represent c. The range of values of b and e -6 are" 00000.000000000 < b < 10111.111111111, (3) or 0 _< b _< 23.9980469, (4) which results in 0.9980519 >_ e -b >_ 3.78 10 -11…”

Section: B Fpga Application Designmentioning

confidence: 99%

“…Several reconfigurable computers have been implemented to demonstrate the viability of reconfigurabl processors [1][2][3][4]. Applications mapped to these processors include: pattern recognition in high-energy physics [5], applications in statistical physics [6], and genetic optimization algorithms [7,8].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Implementation of Multispectral Image Classificationon a Remote Adaptive Computer

et al. 1999

View full text Add to dashboard Cite

As the demand for higher performance computers for the processing of remote sensing science algorithms increases, the need to investigate new computing paradigms is justified. Field Programmable Gate Arrays enable the implementation of algorithms at the hardware gate level, leading to orders of magnitude performance increase over microprocessor based systems. The automatic classification of spaceborne multispectral images is an example of a computation intensive application that can benefit from implementation on an FPGA-based custom computing machine (adaptive or reconfigurable computer). A probabilistic neural network is used here to classify pixels of a multispectral LANDSAT-2 image. The implementation described utilizes Java client/server application programs to access the adaptive computer from a remote site. Results verify that a remote hardware version of the algorithm (implemented on an adaptive computer) is significantly faster than a local software version of the same algorithm (implemented on a typical general-purpose computer).

show abstract

“…The result of the multiplication is 64-bits, but only the most significant 32 bits are sent out. As a result, 3.77 x 10 -11 < e -a _< 0.998051781.…”

Section: 00000000000000000000001mentioning

confidence: 99%

Section: B Fpga Application Designmentioning

confidence: 99%

See 1 more Smart Citation

Implementation of Multispectral Image Classificationon a Remote Adaptive Computer

et al. 1999

View full text Add to dashboard Cite

show abstract

“…Work on compilers targeting commercial FPGAs from abstract algorithms written in imperative software programming languages is emphasized since it is closer to the work described in this paper. Work on mapping methods using software [22] and the Transmogrifier C [23] compilers are one of the first compilation approaches for FPGA-based reconfigurable computing systems. Such approaches have identified important issues on compiling for reconfigurable computing but simple representation models have been used.…”

Section: Related Workmentioning

confidence: 99%

Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines

Cardoso

Neto

2001

Field-Programmable Logic and Applications

View full text Add to dashboard Cite

Abstract. This paper presents new achievements on the automatic mapping of abstract algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable hardware element of the target architecture consists of one field-programmable gate array coupled with one or more memories. The compilation flow exposes operation-and functional-level parallelism, and speculative execution. Such expositions are efficiently represented by an hierarchical model. In order to take full advantage of such representation, the scheduling scope is significantly improved by merging basic blocks at loop boundaries and by considering the parallel execution of exposed concurrent loops. The paper describes the scheduling technique, shows a study on the impact of the merge operation, and reveals the improvements achieved when the exposed parallelism is fully satisfied.

show abstract

Portable pipeline synthesis for FCCMs

Weinhardt¹

1996

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An asynchronous approach to efficient execution of programs on adaptive architectures utilizing FPGAs

Cited by 18 publications

References 19 publications

Implementation of Multispectral Image Classificationon a Remote Adaptive Computer

Implementation of Multispectral Image Classificationon a Remote Adaptive Computer

Compilation Increasing the Scheduling Scope for Multi-memory-FPGA-Based Custom Computing Machines

Portable pipeline synthesis for FCCMs

Contact Info

Product

Resources

About