Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
Santheeban Kandasamy , Electrical and Computer Engineering, University of Waterloo, Ontario, Canada
Andrew Morton , Electrical and Computer Engineering, University of Waterloo, Ontario, Canada
Wayne M. Loucks , Electrical and Computer Engineering, University of Waterloo, Ontario, Canada
This paper examines runtime decisions to configure hardware accelerators or execute in software. Traditionally, reconfigurable FPGAs are reconfigured on-demand with the hardware accelerator, as it is needed by the application. If the software kernel which the hardware kernel replaces is available too, then more sophisticated decision making on reconfigurations may lead to improved execution time and reduced power consumption. The temporal locality algorithm is proposed for applications where individual kernels dominate during differing execution modes. The kernel correlation algorithm is proposed for applications where sequences of kernels are invoked in regular patterns. SystemC simulation is used to compare these two scheduling algorithms against the on-demand policy. Both timing and power consumption results are presented. They indicate that a fairly large reconfiguration time is required for configuration scheduling to be beneficial.
Santheeban Kandasamy, Andrew Morton, Wayne M. Loucks, "Configuration Scheduling Using Temporal Locality and Kernel Correlation", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-5, 2008, doi:10.1109/IPDPS.2008.4536510