Pareto Front Generation for a Tradeoff between Area and Timing

Different implementation possibilities of an algorithm into hardware offer a variety of design solutions. Only best solutions so called pareto optimal solutions are for design decision of interest. Heuristic methods are preferred for the generation of these pareto optimal solutions, because exhaustive search methods cannot efficiently cope with this problem. This paper describes the mapping of this problem to a genetic algorithm. Further the generation of pareto optimal solutions is presented within an example.