A Swarm Random Walk Based Method for the Standard Cell Placement Problem

Algorithm 2

sPL pseudocode.

input: , max, StoppingCondition, benchmark files

output: Best Placement

Initialize: : swarm size, max: maximum runs;

begin

  Read benchmark files;

  repeat

    Partition Bins;

    Initialize swarm;

    for count = 0 max − 1 do

       for   = 0   do

          Generate a solution using a method from Section 4.2;

          if  fitness() < fitness() then

            = ;

          end

       end

    end

  until  StoppingCondition = true;

  Remove bin structure to convert best solution bins to rows;

  Use greedy heuristic;

  Output wirelength;

  return  Best Placement

end