Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems 2008
DOI: 10.1145/1450095.1450108
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic coprocessor management for FPGA-enhanced compute platforms

Abstract: Various commercial programmable compute platforms have their processor architecture enhanced with field-programmable gate arrays (FPGAs). In a common usage scenario, an application loads custom processors into the FPGA to speed up application execution compared to processor-only execution. Transient applications, changing application workloads, and limited FPGA capacity have led to a new problem of operating-systemcontrolled dynamic management of the loading of coprocessors into the FPGAs for best overall perf… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
14
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(14 citation statements)
references
References 20 publications
0
14
0
Order By: Relevance
“…In [HV09], the authors continue their work from [HV08], and propose an on-line algorithm that manages coprocessor loading by maintaining an aggregate gain table for all hardware candidates. For each run of a candidate, the performance gain resulted from a hardware execution over a software one is added to the corresponding entry in the table.…”
Section: Dynamic Configuration Prefetchingmentioning
confidence: 99%
“…In [HV09], the authors continue their work from [HV08], and propose an on-line algorithm that manages coprocessor loading by maintaining an aggregate gain table for all hardware candidates. For each run of a candidate, the performance gain resulted from a hardware execution over a software one is added to the corresponding entry in the table.…”
Section: Dynamic Configuration Prefetchingmentioning
confidence: 99%
“…For example, if the available area is not sufficient to load the CCU for the current task, CCUs can be swapped if the CB of the current task is higher than that of the to-be-swapped-out set. In [13], this heuristic is used for dynamic coprocessor management of reconfigurable architectures at a low architecture level. The implementation of this heuristic was a little more complicated and resulted with more lines of code than the one of AMAP.…”
Section: Task Mapping Heuristicsmentioning
confidence: 99%
“…The authors of [13] present an approach to handle the dynamic loading of coprocessors in order to decrease the execution time of the applications that are currently running on the system. The main limitation of this approach is that only a single coprocessor can be used for each application.…”
Section: Related Workmentioning
confidence: 99%