pith. sign in

arxiv: 1509.01867 · v1 · pith:SNZNKRCQnew · submitted 2015-09-06 · 💻 cs.DS

A macro placer algorithm for chip design

classification 💻 cs.DS
keywords algorithmdatamacrosstructuretherewiresapplicationsarea
0
0 comments X
read the original abstract

There is a set of rectangular macros with given dimensions, and there are wires connecting some pairs (or sets) of them. We have a placement area where these macros should be placed without overlaps in order to minimize the total length of wires. We present a heuristic algorithm which utilizes a special data structure for representing two dimensional stepfunctions. This results in fast integral computation and function modification over rectangles. Our heuristics, especially our data structure for two-dimensional functions, may be useful in other applications, as well.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.