| Matching and searching analysis for parallel hardware implementation on FPGAs |
| Full text |
Pdf
(186 KB)
|
| Source
|
International Symposium on Field Programmable Gate Arrays
archive
Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays
table of contents
Monterey, California, United States
Pages: 125 - 133
Year of Publication: 2001
ISBN:1-58113-341-3
|
|
Authors
|
|
Pablo Moisset
|
University of Southern California/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, California
|
|
Pedro Diniz
|
University of Southern California/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, California
|
|
Joonseok Park
|
University of Southern California/Information Sciences Institute, 4676 Admiralty Way, Suite 1001, Marina del Rey, California
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 24, Citation Count: 0
|
|
|
ABSTRACT
Matching and searching computations play an important role in the indexing of data. These computations are typically encoded in very tight loops with a single index variable and a simple search/ matching predicate. Their inherent sequential nature, either because of data dependences but more often because of very strong control dependences, makes it impossible to apply existing data dependence and parallelization analysis to exploit significant levels parallelism on traditional architectures. This paper describes a class of searching and matching computations and describes a mapping strategy to map these computations to hardware. We have developed a compiler analysis in SUIF using array data dependence analysis and implicit loop unrolling analysis to expose more parallelism for the parallel evaluation of these computations. Our compiler generates parallel hardware specifications in VHDL. The resulting parallel hardware yields significant performance improvements when these kernel operators are repeated over shifted portions of the input data on FPGA-based computing architectures.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
|
| |
2
|
P. Banerjee , N. Shenoy , A. Choudhary , S. Hauck , C. Bachmann , M. Haldar , P. Joisha , A. Jones , A. Kanhare , A. Nayak , S. Periyacheri , M. Walkden , D. Zaretsky, A MATLAB Compiler for Distributed, Heterogeneous, Reconfigurable Computing Systems, Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, p.39, April 17-19, 2000
|
| |
3
|
|
| |
4
|
|
| |
5
|
|
| |
6
|
|
| |
7
|
|
| |
8
|
The Stanford SUIF Compilation System". Public Domain Software and Documentation available at http:// suif.stanford.edu.
|
| |
9
|
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
 |
13
|
|
 |
14
|
|
 |
15
|
Seth Copen Goldstein , Herman Schmit , Matthew Moe , Mihai Budiu , Srihari Cadambi , R. Reed Taylor , Ronald Laufer, PipeRench: a co/processor for streaming multimedia acceleration, Proceedings of the 26th annual international symposium on Computer architecture, p.28-39, May 01-04, 1999, Atlanta, Georgia, United States
|
| |
16
|
|
| |
17
|
|
|