slides - ISPD

More documents

Recommendations

Info

InitializeMultipliersSize GatesDynamic Programming (DP) Algorithm• Originates from buffered treeconstruction by Van GinnekenUpdate TimingUpdateMultipliers• Systematically explores solutionspace by building partial solutionsbottom-upG. Shklover, <strong>ISPD</strong> '12 10
∈∈Set of solutions per tree node Pruning criterion (differs from minimal delay objectives)G. Shklover, <strong>ISPD</strong> '12 11
Page 1 and 2: Gregory ShkloverBen EmanuelIntel Co
Page 3 and 4: MethodologyClassStructureMethodsSke
Page 5: Proposed by C. Chen et alExploits t
Page 8 and 9: , , , → ,clkdFFq,, , , ,∈
Page 12 and 13: Gate sizing: Solution merge: Le
Page 14 and 15: ...Exponentialnumber ofsolutionsk-S
Page 16: Total Slack Leakage ClkDPwr Total P
Page 19 and 20: G. Shklover, ISPD '12 19
Page 21 and 22: ?-20psFF+80psObjectivepowerG. Shklo
Page 23: G. Shklover, ISPD '12 23

slides - ISPD

Create successful ePaper yourself

Delete template?

Save as template?