Algorithms and bounds for layer assignment of MCM routing

Authors:
Mohammad H. Heydari;Ioannis G. Tollis;Chunliang Xia
Affiliations:
Department of Mathematics and Computer Science, University of Wisconsin, Whitewater, WI;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
1994

Citing 6
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Multi chip modules

DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Wiring in uniform grids and two-colorable maps

Integration, the VLSI Journal
Detailed layer assignment for MCM routing

ICCAD '92 1992 IEEE/ACM international conference proceedings on Computer-aided design
Energy Considerations in Multichip-Module Based Multiprocessors

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Electronic packaging evolution in IBM

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present new algorithms for the layer assignment problem of Multichip modules (MCM's). Our algorithms produce results that require between 70% and 25% of the number of layers required by the previous algorithms. We also present a new model for the problem that results in a better utilization of the routing area of the MCM, thus reducing the number of required layers even more. We provide lower and upper bounds on the performance of our algorithms which are tighter than the ones obtained before. Through our experimental results we show that the solutions obtained by our algorithms are close to the lower bounds.