Scheduling using mixed arithmetic: an ILP formulation

Authors:
A. Mignotte;O. Peyran
Affiliations:
Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 LYON Cedex 7, FRANCE;Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 LYON Cedex 7, FRANCE
Venue:
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Year:
1997

Citing 1
Cited 1

A formal approach to the scheduling problem in high level synthesis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Reducing the complexity of ILP formulations for synthesis

ISSS '97 Proceedings of the 10th international symposium on System synthesis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Summary form only given. We present a way to automatically select, within an architectural synthesis tool, the best operand and operator number systems, in order to find the best speed/area tradeoff. This implies the use of different number systems (redundant and non-redundant) for the same design: this is what we call mixed arithmetics. We present an integer linear programming (ILP) formulation to solve a scheduling problem.