International audienceIn the last decade, FPGAs appeared as a credible alternative for big data and high-performance computing applications. However, programming an FPGA is tedious: given a function to implement, the circuit must be designed from scratch by the developer. In this short paper, we address the compilation of data placement under parallelism and resource constraints. We propose an HLS algorithm able to partition the data across memory banks, so parallel accesses will target distinct banks to avoid data transfer serialization. Our algorithm is able to reduce the number of banks and the maximal bank size. Preliminary evaluation shows promising results
[[abstract]]In this paper, we present a new integrated synthesis and partitioning method for multipl...
As memory accesses increasingly limit the overall performance of reconfigurable accelerators, it is ...
Implementing DSP algorithms on single or multiple FPGAs has the advantages of short time to market, ...
International audienceIn the last decade, FPGAs appeared as a credible alternative for big data and ...
High-Level Synthesis (HLS) tools automatically transform a high level specification of a circuit int...
The Legup High-Level Synthesis (HLS) tool permits the synthesis of multi-threaded software into para...
The signicant development of high-level synthesis tools has greatly facilitated FPGAs as general com...
Abstract—Developing FPGA implementations with an input specification in a high-level programming lan...
Abstract—Resource sharing is a classic high-level synthesis (HLS) optimization that saves area by ma...
[[abstract]]In this paper, we present a new integrated synthesis and partitioning method for multipl...
High-Level Synthesis (HLS) tools automatically transform a high-level specification of a circuit int...
Memory-intensive implementations often require access to an external, off-chip memory which can subs...
High-Level Synthesis (HLS) is a single process synthesis method that has shown to produce very good ...
Abstract—Placement of a large FPGA design now commonly requires several hours, significantly hinderi...
International audienceHigh-level synthesis (HLS) currently seems to be an interesting process to red...
[[abstract]]In this paper, we present a new integrated synthesis and partitioning method for multipl...
As memory accesses increasingly limit the overall performance of reconfigurable accelerators, it is ...
Implementing DSP algorithms on single or multiple FPGAs has the advantages of short time to market, ...
International audienceIn the last decade, FPGAs appeared as a credible alternative for big data and ...
High-Level Synthesis (HLS) tools automatically transform a high level specification of a circuit int...
The Legup High-Level Synthesis (HLS) tool permits the synthesis of multi-threaded software into para...
The signicant development of high-level synthesis tools has greatly facilitated FPGAs as general com...
Abstract—Developing FPGA implementations with an input specification in a high-level programming lan...
Abstract—Resource sharing is a classic high-level synthesis (HLS) optimization that saves area by ma...
[[abstract]]In this paper, we present a new integrated synthesis and partitioning method for multipl...
High-Level Synthesis (HLS) tools automatically transform a high-level specification of a circuit int...
Memory-intensive implementations often require access to an external, off-chip memory which can subs...
High-Level Synthesis (HLS) is a single process synthesis method that has shown to produce very good ...
Abstract—Placement of a large FPGA design now commonly requires several hours, significantly hinderi...
International audienceHigh-level synthesis (HLS) currently seems to be an interesting process to red...
[[abstract]]In this paper, we present a new integrated synthesis and partitioning method for multipl...
As memory accesses increasingly limit the overall performance of reconfigurable accelerators, it is ...
Implementing DSP algorithms on single or multiple FPGAs has the advantages of short time to market, ...