Abstract
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.
Cite
CITATION STYLE
Takayama, A., Shibata, Y., Iwai, K., & Amano, H. (2000). Dataflow partitioning and scheduling algorithms for WASMII, a virtual hardware. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1896, pp. 685–694). Springer Verlag. https://doi.org/10.1007/3-540-44614-1_73
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
