.png){kind=icon}
.png){kind=icon}
Return
Efficient, Dynamic Multi-Task Execution on FPGA-Based Computing Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2021.3101153.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
With growing Field Programmable Gate Array (FPGA) device sizes and their integration in environments enabling sharing of computing resources such as cloud and edge computing, there is a requirement to share the FPGA area between multiple tasks. The resource sharing typically involves partitioning the FPGA space into fix-sized slots. This results in suboptimal resource utilisation and relatively poor performance, particularly as the number of tasks increase. Using OpenCL's exploration capabilities, we employ clever clustering and custom, task-specific partitioning and mapping to create a novel, area sharing methodology where task resource requirements are more effectively managed. Using models with varying resource/throughput profiles, we select the most appropriate distribution based on the runtime, workload needs to enhance temporal compute density. The approach is enabled in the system stack by a corresponding task-based virtualisation model. Using 11 high performance tasks from graph analysis, linear algebra and media streaming, we demonstrate an average 2.8x higher system throughput at 2.3x better energy efficiency over existing approaches.
Keywords:
Task analysis
Field programmable gate arrays
Runtime
Throughput
Resource management
Dynamic scheduling
Space exploration
FPGA systems
resource sharing
scheduling and runtime
partitioning and mapping
task-based virtualisation
clustering
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W