Temporal Partitioning for Partially-Reconfigurable-Field-Programmable Gate

The recent introduction of partially-reconfigurable field-programmable gate arrays (PRFPGAs) has led to the need for new algorithms suited for use with these devices. Although algorithms developed for use with field-programmable gate arrays can be applied to PRFPGAs, these algorithms do not take advantage of features available in these new devices.

[1]  M. Ray Mercer,et al.  Demand Driven Simulation: BACKSIM , 1987, 24th ACM/IEEE Design Automation Conference.

[2]  Gary Peterson,et al.  UltraSPARC-I , 1995, DAC '95.

[3]  G. Saucier,et al.  Finding best cones from random clusters for FPGA package partitioning , 1995, Proceedings of ASP-DAC'95/CHDL'95/VLSI'95 with EDA Technofair.

[4]  Steven P. Smith Demand-driven simulation , 1990 .

[5]  James Gateley,et al.  UltraSPARC™ -I Emulation , 1995, DAC 1995.