1. FlowMap Algorithm
Perform clustering on the following 2-bounded network
Intra-cluster and node delay = 0, inter-cluster = 1
Pin constraint = 3
Practical Problems in VLSI Physical Design

2. Label Computation
Practical Problems in VLSI Physical Design

3. Label Computation (cont)
Practical Problems in VLSI Physical Design

4. Label Computation (cont)
Practical Problems in VLSI Physical Design

5. Label Computation (cont)
Practical Problems in VLSI Physical Design

6. Label Computation (cont)
Practical Problems in VLSI Physical Design

7. Label Computation (cont)
Practical Problems in VLSI Physical Design

8. Label Computation (cont)
Summary
Max label = max delay in the clustered network = 2
Practical Problems in VLSI Physical Design

9. Clustering Phase + Traverse the nodes from PO to PI
We begin with L = POs = {h,j,k}
Clustering is based on +
Practical Problems in VLSI Physical Design

10. Clustering Phase (cont)
Practical Problems in VLSI Physical Design

11. Clustering Phase (cont)
Practical Problems in VLSI Physical Design

12. Clustering Phase (cont)
Summary
6 clusters (= LUT-3) are generated
Node c and i are duplicated
Practical Problems in VLSI Physical Design

13. Clustered Network Max delay = 2
Practical Problems in VLSI Physical Design