Evaluation of Static Mapping for Dynamic Space-Shared Multi-task Processing on FPGAs

Whilst FPGAs have been used in cloud ecosystems, it is still extremely challenging to achieve high compute density when mapping heterogeneous multi-tasks on shared resources at runtime. This work addresses this by treating the FPGA resource as a service and employing multi-task processing at the hig...

Full description

Saved in:
Bibliographic Details
Published in:Journal of signal processing systems 2021-05, Vol.93 (5), p.587-602
Main Authors: Minhas, Umar Ibrahim, Woods, Roger, Karakonstantis, Georgios
Format: Article
Language:English
Subjects:
Circuits and Systems
Computer Imaging
Design parameters
Electrical Engineering
Engineering
Image Processing and Computer Vision
Mapping
Memory tasks
Partitioning
Pattern Recognition
Pattern Recognition and Graphics
Run time (computers)
Signal,Image and Speech Processing
Systems design
Task scheduling
Vision
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Whilst FPGAs have been used in cloud ecosystems, it is still extremely challenging to achieve high compute density when mapping heterogeneous multi-tasks on shared resources at runtime. This work addresses this by treating the FPGA resource as a service and employing multi-task processing at the high level, design space exploration and static off-line partitioning in order to allow more efficient mapping of heterogeneous tasks onto the FPGA. In addition, a new, comprehensive runtime functional simulator is used to evaluate the effect of various spatial and temporal constraints on both the existing and new approaches when varying system design parameters. A comprehensive suite of real high performance computing tasks was implemented on a Nallatech 385 FPGA card and show that our approach can provide on average 2.9 × and 2.3 × higher system throughput for compute and mixed intensity tasks, while 0.2 × lower for memory intensive tasks due to external memory access latency and bandwidth limitations. The work has been extended by introducing a novel scheduling scheme to enhance temporal utilization of resources when using the proposed approach. Additional results for large queues of mixed intensity tasks (compute and memory) show that the proposed partitioning and scheduling approach can provide higher than 3 × system speedup over previous schemes.
ISSN:1939-8018
1939-8115
DOI:10.1007/s11265-020-01633-z