Abstract
In this paper, we propose an online hardware task scheduling and placement algorithm and evaluate it performance. Experimental results on large random task set show that our algorithm outperforms the existing algorithms in terms of reduced total wasted area up to 89.7%, has 1.5 % shorter schedule time and 31.3% faster response time. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Marconi, T., Lu, Y., Bertels, K., & Gaydadjiev, G. (2008). Online hardware task scheduling and placement algorithm on partially reconfigurable devices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4943 LNCS, pp. 306–311). https://doi.org/10.1007/978-3-540-78610-8_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
