Internet-based hierarchical floorplan design

檔案

本條目沒有附加檔案。

日期

1999-11-01

類型

期刊名稱

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES

卷期與頁次

第 E82A 卷第 11 期,頁 2414–2423

ISSN

0916-8508

語言

英文

摘要

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).

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, J., Jou, J., & Jiang, I. (1999). Internet-based hierarchical floorplan design. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, E82A(11), 2414–2423. https://ir.lib.nycu.edu.tw/handle/11536/30973

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/30973