Task allocation strategies for FPGA based heterogeneous system on chip

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

FPGA based heterogeneous System On Chips (SOCs) have become a prospective processing platform for modern performancesensitive systems, like automotive, avionics, chemical reactor etc. In such system, “makespan” time minimization plays a crucial role to achieve higher throughput as well as performance efficiency and thus, efficient task allocation schemes are indeed essential. This paper presents two task allocation algorithms for such FPGA based heterogeneous SOCs. The first allocation strategy is based on well known “Branch and Bound” optimization technique. Secondly, we proposed a novel heuristic based allocation mechanism, TAMF (Task Allocation Mechanism for FPGA based heterogeneous SOC). The simulation based experimental results reveal that both the strategies are able to provide lower makespan time over various simulation scenarios with acceptable runtime overheads. Achieved simulation results are further tested through a validation, carried out on practical ZYNQ SOC platform using standard benchmark task sets.

Cite

CITATION STYLE

APA

Majumder, A., Saha, S., & Chakrabarti, A. (2017). Task allocation strategies for FPGA based heterogeneous system on chip. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10244 LNCS, pp. 341–353). Springer Verlag. https://doi.org/10.1007/978-3-319-59105-6_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free