Skip to main content
Article
Minimizing Channel Density with Movable Terminals
Third Great Lakes Symposium on VLSI (GLSV '93)
  • Ronald I. Greenberg, Loyola University Chicago
  • Jau-Der Shih
Document Type
Conference Proceeding
Publication Date
3-1-1993
Publisher Name
IEEE Computer Society
Abstract

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.

Comments

Author Posting. © IEEE, 1993. This article is posted here by permission of IEEE for personal use, not for redistribution. The article was published in VLSI, 1993. 'Design Automation of High Performance VLSI Systems', Proceedings., Third Great Lakes Symposium on VLSI (GLSV '93), http://dx.doi.org/10.1109/GLSV.1993.224493

A revised version can be found at http://ecommons.luc.edu/cs_facpubs/153

Creative Commons License
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0
Citation Information
Greenberg, R and S Jau-Der. "Minimizing Channel Density with Movable Terminals." VLSI, 1993. 'Design Automation of High Performance VLSI Systems', Proceedings., Third Great Lakes Symposium on VLSI (GLSV '93).