Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Recently, we have presented two mathematical formulations and procedures to solve them that apply to
 

Summary: Abstract
Recently, we have presented two mathematical
formulations and procedures to solve them that apply to
the problem of determining schedules, to reduce register
and phase requirements for multi-phase synchronous
circuits derived using software pipelining techniques. In
this paper, we show how to transform these formulations
to minimum cost network flow problems, which can be
solved efficiently. We show that the resulting
formulations can be solved by algorithms of time
complexity O(n3
log(n)) for a network of n nodes.
Although we have not used a specialized algorithm to
solve the new formulations, experimental results on a
subset of the ISCAS89 benchmarks show that these
formulations can be solved much faster than the original
formulations, where the same algorithm based on the
simplex method is used.
1 Introduction
In order to minimize the clock period of a

  

Source: Aboulhamid, El Mostapha - Département d'Informatique et recherche opérationnelle, Université de Montréal

 

Collections: Engineering