loading...
Evaluating Hardware Compilation Techniques
Napa, California April 17-April 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FPGA.2000.9034412000 IEEE Symposium on Field-Programm ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Markus Weinhardt, Imperial College
Wayne Luk, Imperial College
Hardware compilation techniques, which use high-level programming languages to describe and synthesize hardware, are gaining popularity. They are especially useful for reconfigurable computing systems since they provide a fast, easy to use, “software-like” programming environment for users with little hardware design experience. We compare three hardware compilation techniques. First, we study sequential compilation, which produces hardware that evaluates each assignment of the source program in one clock cycle. Next, we evaluate the effects of local parallelizing optimizations. Finally, we apply pipeline vectorization; a method based on software vectorization for synthesizing hardware pipelines, which exploits hardware parallelism globally. Results of all three techniques for several benchmark programs are presented and discussed. Pipeline vectorization has been found to speedup hardware implementations of vectorizable programs by up to two orders of magnitude, whereas local optimizations only achieve speedup factors smaller than two do.
Citation:
Markus Weinhardt, Wayne Luk, "Evaluating Hardware Compilation Techniques," fccm, pp.333, 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, 2000
Usage of this product signifies your acceptance of the Terms of Use.