Ordered coloring-based resource binding for datapaths with improved skew-adjustability

  • Authors:
  • Mineo Kaneko;Keisuke Inoue

  • Affiliations:
  • Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Japan Advanced Institute of Science and Technology, Ishikawa, Japan

  • Venue:
  • Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel high level synthesis for post-silicon skew adjustable datapaths. Our objective in high level synthesis is to maximize the "skew adjustability", i.e. the probability of the success of skew adjustment under delay variations. Skew adjustability is first shown to be reduced to the probability for a skew constraint graph (a weighted directed graph) to have no positive cycle. Since the computation of the skew adjustability is intractable, the original problem is transformed into "selective ordered coloring problem", which tries to minimize hazardous cycles instead of an exact skew adjustability. An ILP approach of the selective ordered coloring approach is then proposed. Experimental results show not only the effectiveness of our approach, but also how much improvement in the skew adjustability is achieved by equipping one or two extra registers to a datapath circuit.