Optimal temporal partitioning and synthesis for reconfigurable architectures

  • Authors:
  • M. Kaul;R. Vemuri

  • Affiliations:
  • Laboratory for Digital Design Environments, Department of Ececs, University of Cincinnati, P.O. Box 210000, Cincinnati, OH;Laboratory for Digital Design Environments, Department of Ececs, University of Cincinnati, P.O. Box 210000, Cincinnati, OH

  • Venue:
  • Proceedings of the conference on Design, automation and test in Europe
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We develop a 0-1 non-linear programming (NLP) model for combined temporal partitioning and high-level synthesis from behavioral specifications destined to be implemented on reconfigurable processors. We present tight linearizations of the NLP model. We present effective variable selection heuristics for a branch and bound solution of the derived linear programming model. We show how tight linearizations combined with good variable selection techniques during branch and bound yield optimal results in relatively short execution times.