Abstract
This paper describes LRoute, a novel router for the popular and scalable hierarchical Complex Programmable Logic Devoices (CPLDs). CPLD routing has constraints om routing topologies due to architectural limitations and performance considerations. These constraints make the problem quite different from FPGA routing and render the routing problem more complicated. Extensions of popular FPGA routers like the maze router performs poorly on such CPLDs. There is also little published work on CPLD routing. LRoute uses a different paradigm based on the Lagrangian Relaxation framework in the theory of mathematical programming. It respects the topology constraints imposed and routes a circuit with minimum delay. We tested this router on a set of industry problems that commercial software failed to route. Our router was able to route all of them very quickly.
| Original language | English (US) |
|---|---|
| Pages | 12-20 |
| Number of pages | 9 |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 2001 ACM/SIGDA 9th International Sysmposium on Field Programmable Gate Arrays (FPGA 2001) - Monterrey, CA, United States Duration: Feb 11 2001 → Feb 13 2001 |
Other
| Other | 2001 ACM/SIGDA 9th International Sysmposium on Field Programmable Gate Arrays (FPGA 2001) |
|---|---|
| Country/Territory | United States |
| City | Monterrey, CA |
| Period | 2/11/01 → 2/13/01 |
Keywords
- Complex Programmable Logic Devices
- Hierarchical Model
- Lagrangian Relaxation
- Routing
ASJC Scopus subject areas
- General Computer Science