Abstract
Multi-FPGA prototype design is widely used to verify modern VLSI circuits, but the limited number of connections between FPGAs in a multi-FPGA system may cause routing failure. Therefore, using time-division multiplexing (TDM) technology, multiple signals are transmitted through the same routing channel to improve utilization. However, the performance of this type of system depends on the routing quality within the FPGAs due to the signal delay between FPGA pairs. In this paper, we propose a system-level routing method based on TDM to minimize the maximum TDM ratio that satisfies the strict ratio constraint. Firstly, we weight the edges and use two methods to build approximate minimum Steiner trees (MST) to route the nets. Then we propose a ratio assignment method based on edge-demand which satisfy the TDM ratio constraint. We tested our method with the benchmarks provided by 2019 CAD Contest at ICCAD and compared it with the top two. The experimental results shows that our method not only solves all problems but also achieves a good TDM ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ahuja, R.K., Mehlhorn, K., Orlin, J., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. ACM (JACM) 37(2), 213–223 (1990)
Asaad, S., et al.: A cycle-accurate, cycle-reproducible multi-FPGA system for accelerating multi-core processor simulation. In Proceedings of the ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pp. 153–162 (2012)
Babb, J., Tessier, R., Agarwal, A.: Virtual wires: overcoming pin limitations in FPGA-based logic emulators. In: 1993 Proceedings IEEE Workshop on FPGAs for Custom Computing Machines, pp. 142–151. IEEE (1993)
Chen, G., Young, E.F.Y.: Salt: provably good routing topology by a novel steiner shallow-light tree algorithm. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(6), 1217–1230 (2019)
Constantinescu, C.: Trends and challenges in VLSI circuit reliability. IEEE Micro 23(4), 14–19 (2003)
de Vincente, J., Lanchares, J., Hermida, R.: RSR: a new rectilinear steiner minimum tree approximation for FPGA placement and global routing. In Proceedings. 24th EUROMICRO Conference (Cat. No. 98EX204), vol. 1, pp. 192–195. IEEE (1998)
Graham, P.S.: Logical hardware debuggers for FPGA-based systems. PhD thesis, Citeseer (2001)
Hung, W.N.N., Sun, R.: Challenges in large FPGA-based logic emulation systems. In Proceedings of the 2018 International Symposium on Physical Design, pp. 26–33 (2018)
Inagi, M., Takashima, Y., Nakamura, Y.: Globally optimal time-multiplexing in inter-FPGA connections for accelerating multi-FPGA systems. In: 2009 International Conference on Field Programmable Logic and Applications (2009)
Inagi, M., Takashima, Y., Nakamura, Y.: Globally optimal time-multiplexing of inter-FPGA connections for multi-FPGA prototyping systems. IPSJ Trans. Syst. LSI Des. Methodol. 3, 81–90 (2010)
Inagi, M., Takashima, Y., Nakamura, Y., Takahashi, A.: ILP-based optimization of time-multiplexed i/o assignment for multi-FPGA systems. In: 2008 IEEE International Symposium on Circuits and Systems, pp. 1800–1803. IEEE (2008)
Inagi, M., Takashima, Y., Nakamura, Y., Takahashi, A.: Optimal time-multiplexing in inter-FPGA connections for accelerating multi-FPGA prototyping systems. IEICE Trans. Fund. Electron. Commun. Comput. Sci. 91(12), 3539–3547 (2008)
Pui, C.-W., Wu, G., Mang, F.Y.C., Young, E.F.Y.: An analytical approach for time-division multiplexing optimization in multi-FPGA based systems. In: 2019 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP), pp. 1–8. IEEE (2019)
Schelle, G., et al.: Intel nehalem processor core made FPGA synthesizable. In Proceedings of the 18th Annual ACM/SIGDA International Symposium on Field Programmable Gate Arrays, pp. 3–12 (2010)
Wang, W., Shen, Z., Dinavahi, V.: Physics-based device-level power electronic circuit hardware emulation on FPGA. IEEE Trans. Industr. Inf. 10(4), 2166–2179 (2014)
Lai, H.-H., Su, Y.-H., Huang, E., Zhao, Y.-C.: 2019 CAD contest at ICCAD on system-level FPGA routing with timing division multiplexing technique (2019)
Acknowledgements
The first and the second author are supported by Natural Science Foundation of China (No. 61772005). The third author is supported by Natural Science Foundation of Fujian Province (No. 2020J01845) and Educational Research Project for Young and Middle-aged Teachers of Fujian Provincial Department of Education (No. JAT190613).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Sun, L., Guo, L., Huang, P. (2021). System-Level FPGA Routing for Logic Verification with Time-Division Multiplexing. In: Zhang, Y., Xu, Y., Tian, H. (eds) Parallel and Distributed Computing, Applications and Technologies. PDCAT 2020. Lecture Notes in Computer Science(), vol 12606. Springer, Cham. https://doi.org/10.1007/978-3-030-69244-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-69244-5_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69243-8
Online ISBN: 978-3-030-69244-5
eBook Packages: Computer ScienceComputer Science (R0)