HW 5 Q 9 10 11-Sol-finalW11

HW 5 Q 9 10 11-Sol-finalW11 - Homework 5 - Solutions...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 5 - Solutions
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Homework 5 - Solutions Q10. (a) FM is a modified version of KL in which only a single vertex is moved across the cut in a single move (unbalanced partitions) and its complexity is O(p) per pass, where p is the number of pins. KL’s complexity is O(p 2 log(p)). Look at the following reference for KL speedup: c S. Dutt, “New faster Kernighan-Lin-type graph-partitioning algorithms”, Proc. of ICCAD , pp. 370-377, 1993. Q10. (b) Two types of hypergraph transformation c Clique approximation - Complete subgraph of the endpoints of a hyperedge - Edge weighting models have been well-studied in the literature, and range from 1/k to 1/(k-1) to 8/k 3 to … (including placement-specific and partitioning-specific net models – see the mid-1990s work of Jenhsin Huang), with each model having its own justification. - Random trees might be used as well. c Star approximation - uses a directed star from source to sinks. -
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

HW 5 Q 9 10 11-Sol-finalW11 - Homework 5 - Solutions...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online