Plane parallel A* maze router and its application to FPGAs

Abstract

A plane-parallel maze-routing method for field programmable gate arrays is presented. It was demonstrated that a plane-parallel approach was significantly faster than traditional approaches, without compromising quality as measured by routing length. A framework is established for unified code to support traditional wire routing, timing driven routing, and plane parallel and global routing.<>