Definition And Solution Of The Memory Packing Problem For Field-programmable Systems
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper defines a new optimization problem that arises in the use of a Field-Programmable System (FPS). An FPS consists of a set of Field-Programmable Gate Arrays and memories, and is used both for emulation of ASICs and computation. In both cases the application circuits will include a set of memories which may not match the number and aspect ratio of the physical memories available on the FPS. This can often require that the physical memories be time-multiplexed to implement the required memories, in a circuit we call a memory organizer.We give a precise definition of the packing optimization problem and present an algorithm for its solution. The algorithm has been implemented in a CAD tool that automatically produces a memory organizer circuit ready for synthesis by a commercial FPGA tool set.Keywords
This publication has 4 references indexed in Scilit:
- Splash 2Published by Association for Computing Machinery (ACM) ,1992
- Computer-aided prototyping for ASIC-based systemsIEEE Design & Test of Computers, 1991
- Combinatorial Algorithms for Integrated Circuit LayoutPublished by Springer Nature ,1990
- Worst-case analysis of memory allocation algorithmsPublished by Association for Computing Machinery (ACM) ,1972