zbMATH — the first resource for mathematics

Gambit: A tool for the simultaneous placement and detailed routing of gate-arrays. (English) Zbl 1001.68891
Brebner, Gordon (ed.) et al., Field-programmable logic and applications. 11th international conference, FPL 2001, Belfast, Northern Ireland, GB, August 27-29, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2147, 243-253 (2001).
Summary: In this paper we present a new method of integrating the placement and routing stages in the physical design of channel-based architectures, and present the first implementation of this method: Gambit. Based on a graph coloring representation of the routing problem, we are able to produce circuit placements and detailed routes simultaneously, allowing routing constraints to influence decisions made in creating the placement. Gambit produces circuit mappings for both standard and three-dimensional FPGA architectures, and serves primarily as a proof-of-concept: the proposed algorithm will simultaneously perform placement and detailed routing for channel-based architectures. While the quality of Gambit mappings are not yet competitive with state-of-the-art tools in the literature, experimental results indicate that it does have the potential to become so.
For the entire collection see [Zbl 0972.68674].
68U99 Computing methodologies and applications
68M07 Mathematical problems of computer architecture
Full Text: Link