Sanjay Khanna

Learn More
In this paper we present a parallel global routing algorithm for general cell layout. The algorithm applies a hierarchical decomposition strategy that recursively divides routing problems into simple, independent sub-problems for parallel processing. The solution of each subproblem is based on integer programming and network flow optimization. The algorithm(More)
A new data partitioning scheme for parallel compilation is presented. The scheme is based on partitioning the grammar, which in turn effectively decomposes the language specification into multiple subsets. The scheme requires definition and development of specialized subcompilers. A simple and practical method is suggested for the implementation of such(More)
  • 1