DMCA
Kernel Scheduling in Reconfigurable Computing (1999)
| Venue: | Proceedings of Design, Automation and Test in Europe Conference |
| Citations: | 14 - 0 self |
BibTeX
@INPROCEEDINGS{Maestre99kernelscheduling,
author = {R. Maestre and F. J. Kurdahi and N. Bagherzadeh and H. Singh and R. Hermida and M. Fernandez},
title = {Kernel Scheduling in Reconfigurable Computing},
booktitle = {Proceedings of Design, Automation and Test in Europe Conference},
year = {1999},
pages = {90--96}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Reconfigurable computing is a flexible way of facing with a single device a wide range of applications with a good level of performance. This area of computing involves different issues and concepts when compared with conventional computing systems. One of these concepts is context loading. The context refers to the coded configuration information to implement a particular circuit behavior. An important problem for reconfigurable computing is the scheduling of a group of kernels (sub-tasks) that constitute a complex application for minimum execution time. In this paper, we show how the different execution orders for these sub-tasks may result in varying levels of performance. We formulate an analytical approach and present a solution for this new problem through this work. 1.
Keyphrases
kernel scheduling reconfigurable computing different execution order particular circuit behavior context loading new problem complex application good level configuration information important problem minimum execution time wide range analytical approach single device context refers flexible way involves different issue
