Classification on variation maps: A new placement strategy to alleviate process variation on FPGA

Zhenyu Guan, Justin S.J. Wong, Sumanta Chaudhuri, George Constantinides, Peter Y.K. Cheung

Research output: Contribution to journalArticlepeer-review

Abstract

This paper proposes a 2-stage variation-aware placement method that benefits from the optimality of a full-chipwise (chip-by-chip) placement to alleviate the impact of process variation. By classifying FPGAs into a small number of classes based on their variation maps and performing placement optimisation specifically for each class instead of each chip, two-stage placement can greatly reduce the execution time with similar timing improvement as achieved by full chipwise optimal placement. Our proposed method is implemented in a modified version of VPR 5.0 and verified using variation maps measured from 129 DE0 boards equipped with Cyclone III FPGAs. The results are compared with variation-blind, Statistical static timing analysis (SSTA) and full chipwise placement. The timing gain of 7.5% is observed in 20 MCNC benchmarks with 16 classes for 95% timing yield, while reducing execution time by a factor of 8 compared to full-chipwise placement.

Original languageEnglish
Article number20130912
JournalIEICE Electronics Express
Volume11
Issue number3
DOIs
Publication statusPublished - 5 Dec 2013
Externally publishedYes

Keywords

  • FPGA
  • Placement
  • Process variation
  • Variation maps

Fingerprint

Dive into the research topics of 'Classification on variation maps: A new placement strategy to alleviate process variation on FPGA'. Together they form a unique fingerprint.

Cite this