A Sea-of-Gates Style FPGA Placement Algorithm. Issue 4 (1996)

• Record Type: Journal Article
• Authors: Roy, Kalapi; Guan, Bingzhong (David); Sechen, Carl
• Is Part Of: VLSI design. Volume 4:Issue 4(1996)
• Page Start: 293
• Page End: 307
• Publication Date: 1996
• Subjects: Field Programmable Gate Arrays -- placement -- routability; Integrated circuits -- Very large scale integration -- Periodicals; 621.395
• DOI: 10.1155/1996/92380
• Languages: English
• ISSNs: 1065-514X

Abstract

Abstract : Field Programmable Gate Arrays (FPGAs) have a pre-defined chip boundary with fixed cell locations and routing resources. Placement objectives for flexible architectures (e.g., the standard cell design style) such as minimization of chip area do not reflect the primary placement goals for FPGAs. For FPGAs, the layout tools must seek 100% routability within the architectural constraints. Routability and congestion estimates must be made directly based on the demand and availability of routing resources for detailed routing of the particular FPGA. We. present a hierarchical placement approach consisting of two phases: a global placement phase followed by a detailed placement phase. The global placement phase minimizes congestion estimates of the global routing regions and satisfies all constraints at a coarser level. The detailed placer seeks to maximize the routability of the FPGA by considering factors which cause congestion at the detailed routing level and to precisely satisfy all of the constraints. Despite having limited knowledge about the gate level architectural details, we have achieved a 90%reduction in the number of unrouted nets in comparison to an industrial tool (the only other tool) developed specifically for this architecture.