论文信息 - Dataflow Partitioning and Scheduling Algorithms for WASMII, a Virtual Hardware

Dataflow Partitioning and Scheduling Algorithms for WASMII, a Virtual Hardware

This paper presents a new dataflow graph partitioning algorithm for a data driven virtual hardware system called WASMII. The algorithm divides a dataflow graph into multiple subgraphs so as not to cause a deadlock. Then the subgraphs are translated into an FPGA configuration and executed on WASMII in a time-multiplexed manner. The experimental results show the proposed algorithms can achieve 13% to 39% improvement of execution performance compared to other existing graph partitioning algorithms at the most.

Yuichiro Shibata | Hideharu Amano | Keisuke Iwai | Atsushi Takayama

[1] Hideharu Amano,et al. WASMII: a data driven computer on a virtual hardware , 1993, [1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines.

[2] Kenji Nishida,et al. A hardware design of the SIGMA-1, a data flow computer for scientific computations , 1986 .

[3] Dinesh Bhatia,et al. Temporal Partitioning and Scheduling Data Flow Graphs for Reconfigurable Computers , 1999, IEEE Trans. Computers.