Max Length Driven Global Routing (in Armenian)
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2006), pp. 49-57
Voir la notice de l'article provenant de la source Math-Net.Ru
In order to maintain signal integrity and reasonable delay in high frequent designs, each critical net must undergo buffer insertion. At the same time a big number of nets in such designs create restrictions in terms of algorithms' run time. This paper studies the problem of constructing minimum cost buffered routing trees in high utilized and congested designs with possible buffer locations.
@article{UZERU_2006_1_a4,
author = {G. A. Mkrtchyan},
title = {Max {Length} {Driven} {Global} {Routing} (in {Armenian)}},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {49--57},
publisher = {mathdoc},
number = {1},
year = {2006},
language = {hy},
url = {http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/}
}
TY - JOUR AU - G. A. Mkrtchyan TI - Max Length Driven Global Routing (in Armenian) JO - Proceedings of the Yerevan State University. Physical and mathematical sciences PY - 2006 SP - 49 EP - 57 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/ LA - hy ID - UZERU_2006_1_a4 ER -
G. A. Mkrtchyan. Max Length Driven Global Routing (in Armenian). Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2006), pp. 49-57. http://geodesic.mathdoc.fr/item/UZERU_2006_1_a4/