Conference Proceeding

Run-time configuration prefetching to reduce the overhead of dynamically reconfiguration.

01/2010; DOI:10.1109/SOCC.2010.5784651 In proceeding of: Annual IEEE International SoC Conference, SoCC 2010, September 27-29, 2010, Las Vegas, NV, USA, Proceedings
Source: DBLP

ABSTRACT Reconfigurable computing is a promising approach with both flexibility and efficiency for high performance computing. However, the overhead of run-time reconfiguration affects the performance severely. In the paper, we develop a simple and effective method to hide the latency of configuration by configuration prefetching at runtime. A simulation platform based on Simics is developed for evaluation. The experimental results show that the predictive accuracy is rather high, the hit rate of reconfigurable processing unit is increased by 24.6%~53.7% when reconfigurable resource is not adequate.

0 0
 · 
0 Bookmarks
 · 
28 Views
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Gerald Estrin and his group at the University of California at Los Angeles did the earliest work on reconfigurable computer architectures. The early research, described here, provides pointers to work on models and tools for reconfigurable systems design and analysis.
    IEEE Annals of the History of Computing 11/2002; · 0.58 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Due to the emergence of highly dynamic multimedia applications there is a need for flexible platforms and run-time scheduling support for embedded systems. Dynamic Reconfigurable Hardware (DRHW) is a promising candidate to provide this flexibility but, currently, not sufficient run-time scheduling support to deal with the run-time reconfigurations exists. Moreover, executing at run-time a complex scheduling heuristic to provide this support may generate an excessive run-time penalty. Hence, we have developed a hybrid design/run-time prefetch heuristic that schedules the reconfigurations at run-time, but carries out the scheduling computations at design-time by carefully identifying a set of near-optimal schedules that can be selected at run-time. This approach provides run-time flexibility with a negligible penalty.
    2005 Design, Automation and Test in Europe Conference and Exposition (DATE 2005), 7-11 March 2005, Munich, Germany; 01/2005
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Multitasking on reconfigurable logic can achieve very high silicon reusability. However, configuration latency is a major limitation and it can largely degrade the system performance. One reason is that tasks can run in parallel but configurations of the tasks can be done only in sequence. This work presents a novel configuration model to enable configuration parallelism. It consists of multiple homogeneous tiles and each tile has its own configuration SRAM that can be individually accessed. Thus multiple configuration controllers can load tasks in parallel and more speedups can be achieved. We used a prefetch scheduling technique to evaluate the model with randomly generated tasks. The experiment results reveal that in average using multiple controllers can reduce the configuration overheads by 21%. Compared to best cases of using multiple tiles with a single controller, additional 40% speedup can be achieved using multiple controllers.
    2008 Design, Automation and Test in Europe. 01/2006; 1:204.