The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Com a proliferação da contagem de transistores no projeto VLSI, cada vez mais grupos de projeto tentam descobrir uma maneira eficiente de combinar seus projetos. A Internet oferece computação distribuída e compartilhamento de recursos. Consequentemente, um design hierárquico pode ser resolvido adequadamente no ambiente da Internet. Neste artigo, demonstramos a facilitação do ambiente da Internet resolvendo o problema de minimização de área da planta baixa. Propomos o algoritmo RMG aproveitando a Internet. Baseado no modelo de latências de transferência, o algoritmo RMG reduz o tempo de computação encurtando o caminho crítico na árvore da planta baixa. Nossos resultados experimentais mostram que a Internet é adequada para Automação de Projeto Eletrônico (EDA).
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Jiann-Horng LIN, Jing-Yang JOU, Iris Hui-Ru JIANG, "Internet-Based Hierarchical Floorplan Design" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 11, pp. 2414-2423, November 1999, doi: .
Abstract: With the proliferation of the transistor count in VLSI design, more and more design groups try to figure out an efficient way to combine their designs. The Internet features distributed computing and resource sharing. Consequently, a hierarchical design can adequately be solved in the Internet environment. In this paper, we demonstrate the facilitation of the Internet environment by solving the area minimization floorplan problem. We propose the RMG algorithm taking advantage of the Internet. Based on the model of transfer latencies, the RMG algorithm reduces the computing time by shortening the critical path in the floorplan tree. Our experimental results show that the Internet is suitable for Electronic Design Automation (EDA).
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_11_2414/_p
Copiar
@ARTICLE{e82-a_11_2414,
author={Jiann-Horng LIN, Jing-Yang JOU, Iris Hui-Ru JIANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Internet-Based Hierarchical Floorplan Design},
year={1999},
volume={E82-A},
number={11},
pages={2414-2423},
abstract={With the proliferation of the transistor count in VLSI design, more and more design groups try to figure out an efficient way to combine their designs. The Internet features distributed computing and resource sharing. Consequently, a hierarchical design can adequately be solved in the Internet environment. In this paper, we demonstrate the facilitation of the Internet environment by solving the area minimization floorplan problem. We propose the RMG algorithm taking advantage of the Internet. Based on the model of transfer latencies, the RMG algorithm reduces the computing time by shortening the critical path in the floorplan tree. Our experimental results show that the Internet is suitable for Electronic Design Automation (EDA).},
keywords={},
doi={},
ISSN={},
month={November},}
Copiar
TY - JOUR
TI - Internet-Based Hierarchical Floorplan Design
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2414
EP - 2423
AU - Jiann-Horng LIN
AU - Jing-Yang JOU
AU - Iris Hui-Ru JIANG
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 1999
AB - With the proliferation of the transistor count in VLSI design, more and more design groups try to figure out an efficient way to combine their designs. The Internet features distributed computing and resource sharing. Consequently, a hierarchical design can adequately be solved in the Internet environment. In this paper, we demonstrate the facilitation of the Internet environment by solving the area minimization floorplan problem. We propose the RMG algorithm taking advantage of the Internet. Based on the model of transfer latencies, the RMG algorithm reduces the computing time by shortening the critical path in the floorplan tree. Our experimental results show that the Internet is suitable for Electronic Design Automation (EDA).
ER -