Theory and algorithm for generalized memory partitioning in high-level synthesis
Authors:
Open Access
- 26 February 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 199-208
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Transformations for throughput optimization in high-level synthesis (abstract only)2014
- Memory partitioning for multidimensional arrays in high-level synthesis2013
- Memory partitioning and scheduling co-optimization in behavioral synthesis2012
- An integrated and automated memory optimization flow for FPGA behavioral synthesis2012
- High-Level Synthesis for FPGAs: From Prototyping to DeploymentIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2011
- Automatic memory partitioning and scheduling for throughput and power optimizationACM Transactions on Design Automation of Electronic Systems, 2011
- Customizable Domain-Specific ComputingIEEE Design & Test of Computers, 2010
- Counting Integer Points in Parametric Polytopes Using Barvinok's Rational FunctionsAlgorithmica, 2007
- Generating Local Addresses and Communication Sets for Data-Parallel ProgramsJournal of Parallel and Distributed Computing, 1995
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992