Abstract
The advances in the programmable hardware has lead to new architectures where the hardware can be dynamically adapted to the application to gain better performance. There are still many challenging problems to be solved before any practical general-purpose reconfigurable system is built. One fundamental problem is the placement of the modules on the reconfigurable functional unit (RFU). In reconfigurable systems, we are interested both in online placement, where arrival time of tasks is determined at runtime and is not known a priori, and offline in which the schedule is known at compile time. In the case of offline placement, we are willing to spend more time during compile time to find a compact floorplan for the RFU modules and utilize the RFU area more efficiently. In this paper we present offline placement algorithms based on simulated annealing and greedy methods and show the superiority of their placements over the ones generated by an online algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bazargan, K., and Sarrafzadeh, M. 1999. Fast online placement for reconfigurable computing systems. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines.
Brebner, G. 1997. The swappable logic unit: a paradigm for virtual hardware. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines pp. 77–86.
Burns, J., Donlin, A., Hogg, J., Singh, S., and Wit, M. 1998. A dynamic reconfiguration run-time system. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines pp. 66–75.
Callahan, T. J., Chong, P., DeHon, A., and Wawrzynek, J. 1998. Fast module mapping and placement for datapaths in FPGAs. International ACM/SIGDA Symposium on Field Programmable Gate Arrays February.
Gokhale, M., Holmes, B., Kopser, A., Kunze, D., Lopresti, D., Lucas, S., Minnich, R., and Olsen, P. 1990. Splash: a reconfigurable linear logic array. International Conference on Parallel Processing pp. 526–532.
Hauck, S. 1998. Configuration prefetch for single context reconfigurable coprocessors. International ACM/SIGDA Symposium on Field Programmable Gate Arrays pp. 65–74, February.
Hauck, S. 1998. The roles of FPGAs in reprogrammable systems. Proceedings of the IEEE 86(4): 615–638.
Hauck, S., Li, Z., and Schwabe, E. J. 1998. Configuration compression for the Xilinx XC6200 FPGA. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines pp. 138–146.
Iseli, C., and Sanchez, E. 1993. Spyder: a reconfigurable VLIW processor using FPGAs. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines pp. 17–24.
Krupnova, H., Rabedaoro, C., and Saucier, G. 1997. Synthesis and floorplanning for large hierarchical FPGAs. Proceedings of ACM Symposium on Field-Programmable Gate Arrays (FPGA), February.
Liu, H., and Wong, D. F. 1999. Circuit partitioning for dynamically reconfigurable FPGA. International ACM/SIGDA Symposium on Field Programmable Gate Arrays.
Shi, J., and Bhatia, Dinesh. 1997. Performance driven floorplanning for FPGA based designs. Proceedings of ACM Symposium on Field-Programmable Gate Arrays (FPGA) pp. 112–118, February.
Sun, W. J., and Sechen, C. 1995. Efficient and effective placement for very large circuits. IEEE Transactions on Computer Aided Design 14(3): 349–359, March.
Wirthlin, M. J., and Hutchings, B. L. 1995. A dynamic instruction set computer. Proceedings of IEEE Symposium on FPGAs for Custom Computing Machines pp. 99–107.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bazargan, K., Kastner, R. & Sarrafzadeh, M. 3-D Floorplanning: Simulated Annealing and Greedy Placement Methods for Reconfigurable Computing Systems. Design Automation for Embedded Systems 5, 329–338 (2000). https://doi.org/10.1023/A:1008962420726
Issue Date:
DOI: https://doi.org/10.1023/A:1008962420726