Abstract In this paper, a simple while
effective deterministic algorithm for solving the VLSI block placement
problem is proposed considering the packing area and interconnect wiring
simultaneously. The algorithm is based on a principle inspired by
observations of ancient professionals in solving their similar problems.
Using the so-called Less Flexibility First principle, it is tried to
pack blocks with the least packing flexibility on its shape and
interconnect requirement to the empty space with the least packing
flexibility in a greedy manner. Experimental results demonstrate that
the algorithm, though simple, is quite effective in solving the problem.
The same philosophy could also be used in designing efficient heuristics
for other hard problems, such as placement with preplaced modules,
placement with L/T shape modules, etc.