WEEK 8 LEARNING OBJECTIVES

Day 1

• Describe the basic automated partitioning challenge.
• Define circuit block, terminal, net, and netlist in the context of automated partitioning.
• Compare and contrast system-level, board-level, and chip-level partitioning.
• List the five objective functions that typically guide partitioning algorithms.
• State the mincut problem as an objective function.
• State the delay problem as an objective function.
• State the terminal problem as an objective function.
• State the area problem as an objective function.
• State the number problem as an objective function.
• Describe how the type of design style affects the choice of objective functions during partitioning.
• List the objective functions typically used in full-custom, standard-cell, and gate-array design styles.

Day 2

• List the different methods used to classify partitioning algorithms.
• Compare and contrast constructive and iterative algorithms.
• Compare and contrast deterministic and probabilistic algorithsm.
• Describe the basic principle of group migration algoriths.
• List a number of classic partitioning algorithms by name.