Implementing parallel algorithms on an FPGA directly from multithreaded Java using flowpaths
Duchene, M.
Hanna, D.M.
CSE Dept., Oakland Univ., Rochester, MI;
This paper appears in: Circuits and Systems, 2005. 48th Midwest Symposium on
Publication Date: 7-10 Aug. 2005
On page(s): 980-983 Vol. 2
Location: Covington, KY,
ISBN: 0-7803-9197-7
INSPEC Accession Number: 8967409
Digital Object Identifier: 10.1109/MWSCAS.2005.1594267
Current Version Published: 2006-02-21
Abstract
The performance of software executed on a microprocessor is adversely affected by the basic fetch execute cycle. A further performance penalty results from the load-execute-store paradigm associated with the use of local variables in most high level languages. Implementing the software algorithm directly in hardware such as on an FPGA can alleviate these performance penalties. Such implementations are normally developed in a hardware description language such as VHDL or Verilog. More recently, several methods for using C as a hardware description language and for compiling C programs to hardware have been researched with challenges in multithreading. Previous work shows how a new systems architecture for FPGAs, called flowpaths, can implement Java byte codes directly in an FPGA without the need for a microprocessor core. Results show that flowpaths perform within a factor of 2 of a minimal hand-crafted direct hardware implementation and orders of magnitude better than compiling the program to a microprocessor. This paper describes a method to extend the flowpath architecture to generate hardware directly from Java byte codes representing Java threads. This hardware executes multiple tasks in parallel supporting both synchronized and unsynchronized shared memory access. A producer/consumer example is implemented on a Xilinx Spartan IIE FPGA
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
