This is the authors' abstract. We don't add key points for this paper.
An architecture-aware extended mixed routing graph model allows describing the features of the routing resources of modern field-programmable gate arrays (FPGA). It can be used to solve the tasks of interconnections routing as part of an FPGA layout synthesis flow. In this work, an architecture-aware extended mixed routing graph model is considered. Two modifications are proposed for the basic method of automatic routing that is the classical Pathfinder algorithm adapted to a mixed routing resources graph. The first modification is based on the idea of a directed search on the graph model using data on the spatial and geometric characteristics of the basic FPGA chip, while the second one combines a directed search strategy with consideration of a preliminary routing congestion assessment based on the results of the placement procedure. It has been demonstrated that the proposed modifications make it possible to accelerate the basic method convergence by an average of 50.6 and 38.6%, respectively. While maintaining the routability of IWLS’2005, ISCAS’89 and LGSynth’89 benchmark suits, the use of only directed search led to an improvement in the timing characteristics of test circuits implementations by 5.2% on average, and its use together with an assessment of congestion before the start of routing, to these characteristics improvement by 9.3% on average relative to the results of the basic Pathfinder method.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Mariya A. Zapletina (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: