Parallel algorithms for physical design

Parallel algorithms are developed for three problems that are commonly encountered in the physical design of VLSI circuits. These are maze routing using Lee's router, the 0/1 knapsack problems, and linear assignment. The latter two problems are frequently encountered in the placement and routing phases of standard cell and sea of gates chip design. The algorithms presented here have been programmed on the NCUBE hypercube multicomputer. Experimental results indicating the amount of speedup achieved are also presented.<>