Thumbnail
Access Restriction
Open

Author Mignotte, Anne ♦ Muller, Jean-Michel ♦ Peyran, Olivier
Source Hyper Articles en Ligne (HAL)
Content type Text
File Format PDF
Language English
Subject Keyword Arithmetic ♦ Integer Linear Programming ♦ Partitioning ♦ Redundant Number Systems ♦ Scheduling ♦ Partitionnement ♦ Arithmétique ♦ Ordonnancement ♦ Programmation Linéaire en Nombres Entiers ♦ Système Redondant d'Ecriture des Nombres ♦ info ♦ Computer Science [cs]
Abstract This article presents a methodology to use a powerful arithmetic (redundant arithmetic) in some parts of designs in order to fasten them without a large increase in area, thanks to the use of both conventional and redundant number systems. This implies specific constraints in the scheduling process. An integer linear programming (ILP) formulation is proposed which finds an optimal solution for reasonable examples. In order to solve the problem of possibly huge ILP computational time, a general solution, based on a constraint graph partitioning, is proposed.
Educational Use Research
Learning Resource Type Report ♦ Article
Publisher Date 1997-11-01
Publisher Institution Laboratoire de l'informatique du parallélisme