CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient datapath merging for the overhead reduction of run-time reconfigurable systems

M. Fazlali ; A. Zakerolhosseini ; Georgi N. Gaydadjiev (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Journal of Supercomputing (0920-8542). Vol. 59 (2012), 2, p. 636-657.
[Artikel, refereegranskad vetenskaplig]

High latencies in FPGA reconfiguration are known as a major overhead in run-time reconfigurable systems. This overhead can be reduced by merging multiple data flow graphs representing different kernels of the original program into a single (merged) datapath that will be configured less often compared to the separate datapaths scenario. However, the additional hardware introduced by this technique increases the kernels execution time. In this paper, we present a novel datapath merging technique that reduces both the configuration and execution times of kernels mapped on the reconfigurable fabric. Experimental results show up to 13% reduction in the configuration and execution times of kernels from media-bench workloads, compared to previous art on datapath merging. When compared to conventional high-level synthesis algorithms, our proposal reduces kernels configuration and execution times by up to 48%. © 2010 Springer Science+Business Media, LLC.

Nyckelord: Datapath merging , Reconfigurable computing , Run-time reconfigurable systems

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2013-12-03. Senast ändrad 2013-12-04.
CPL Pubid: 188232


Läs direkt!

Länk till annan sajt (kan kräva inloggning)