Hierarchical floorplan design on the Internet

Abstract

With the proliferation of transistor count in VLSI design, more and more design groups try to figure out a way to efficiently combine their designs. The Internet features distributed computing and resource sharing. Consequently, a hierarchical floorplan design can be adequately solved bl the Internet environment. In this paper, we address the problem of area minimization floorplan design in the Internet environment. We propose a novel algorithm, RMG algorithm. Taking advantage of the Internet, RMG algorithm reduces the computing time by shortening the critical path in the floorplan tl ee. With creating floorplan design in the Internet environment, it cart be seen that the Internet advantages Electronic Design Automation (EDA).