In layout design of transport-processing FPGAs, it is required t h a t not only routing congestion is kept small but also circuits implemented on t h e m operate with higher operation frequency. This paper extends the proposed simultaneous placement and global routing algorithm for transport-processing FP-GAS whose objective is to minimize routing congestion and proposes a new algorithm in which t h e length of each critical signal path (path length) is limited within a specified upper bound imposed on it (path length constraint). The algorithm is based on hierarchical bipartitioning of layout regions and LUT (Lookup Table) sets t o be placed. Each bipartitioning procedure consists of three phases: ( 0 ) estimation of p a t h lengths, (1) bipartitioning of a set of terminals, and (2) bipartitioning of a set of LUTs. After searching t h e paths with tighter path length constraints by estimating path lengths in ( O ) , (1) and (2) are executed so t h a t their path lengths are reduced with higher priority and thus p a t h length constraints are not violated. T h e algorithm has been implemented and applied t o transport-processing circuits compared with conventional approaches. T h e results demonstrate t h a t t h e algorithm resolves path length constraints for 11 out of 13 circuits, though it increases routing congestion by a n average of 20%. After detailed routing, it achieves 100% routing for all t h e circuits and decreases a circuit delay by a n average of 23%.