Abstract
This paper presents a new algorithm for solving the two-layer channel routing problem with doglegging. Based on a set of intuitive and reasonable heuristics, the algorithm tries to obtain a channel routing configuration with a minimum number of tracks. For every benchmark problem tested, the algorithm gives a routing configuration with the smallest number of tracks reported in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Yoshimura and E. S. Kuh, “Efficient algorithms for channel routing,” IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, vol. CAD-1, pp. 25–35, January 1982.
R. L. Rivest and C. M. Fiduccia, “A greedy channel router,” Proceedings of 19th Design Automation Conference, paper 27.2, June 1982.
D. N. Deutsch, “A dogleg channel router,” Proceedings of 13th Design Automation Conference, pp. 425–433, 1976.
E. L. Lawler, “Combinatorial optimization: networks and matroids,” Holt, Rinehart and Winston, New York, 1976.
T. S. Hedges, K. H. Slater, G. W. Clow and T. Whitney, “The SICLOPS silicon compiler,” to appear in Proceedings of International Circuit and Computer Conference, September 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1983 Computer Science Press, Inc.
About this paper
Cite this paper
Chan, W.S. (1983). A New Channel Routing Algorithm. In: Bryant, R. (eds) Third Caltech Conference on Very Large Scale Integration. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95432-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-95432-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12369-9
Online ISBN: 978-3-642-95432-0
eBook Packages: Springer Book Archive