Memory mapping for multi-die FPGAS

Conference paper (2019)

Authors

Nils Voss Imperial College London, Maxeler Technologies
Pablo Quintana Maxeler Technologies
Oskar Mencer Maxeler Technologies
Wayne Luk Imperial College London
G. Gaydadjiev Maxeler Technologies, Imperial College London
Affiliation
External organisation
FPGA Greedy Heuristic Memory Allocation Memory Mapping Multi Die
More Info
expand_more

Published Date

01-04-2019

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

This paper proposes an algorithm for mapping logical to physical memory resources on FPGAs. Our greedy strategy based algorithm is specifically designed to facilitate timing closure on modern multi-die FPGAs for static-dataflow accelerators utilising most of the on-chip resources. The main objective of the proposed algorithm is to ensure that specific sub-parts of the design under consideration can fully reside within a single die to limit inter-die communication. The above is achieved by performing the memory mapping for each sub-part of the design separately while keeping allocation of the available physical resources balanced. As a result the number of inter-die connections is reduced on average by 50% compared to an algorithm targeting minimal area usage for real, complex applications using most of the on-chip's resources. Additionally, our algorithm is the only one out of the four evaluated approaches which successfully produces place and route results for all 33 applications and benchmarks.