An account is given on the results of previous work on floorplanning for reconfigurable systems. It is shown why it is important to deal with both online and offline placement algorithms. For the online problem, a class of fast, but not optimal and a slow, but high-quality placement algorithm, is presented. For the offline problem, simulated annealing and greedy placement methods are devised for the 3D placement of the RFUOPs.
Bibliographical noteFunding Information:
This work was supported by DARPA under contract number DABT63-97-C-0035.