MIBS Heuristic

Compute mapping and schedule for free

nodes: - Set median-area time values,

-Apply GCLP

Select tagged node T with mapping MT

Find Implementation bin for T within MT

Free=free\T

fixed ?T

update (schedule)

Free Nodes N

Mapping for all free nodes

Mapping schedule, implementation bins

for all nodes

|N| times