Partitioning and scheduling of asynchronous pipelines

The authors propose algorithms for partitioning and scheduling of asynchronous pipelines. Resource sharing is taken into account. The focus is on the automated data path synthesis of asynchronous pipelines. A heuristic algorithm based on a probabilistic approach is described for partitioning the circuit description into pipelined stages. Some mathematical formulas and a clique partitioning approach are proposed to determine resource sharable stages. A simulated evolution algorithm is outlined for scheduling operations into stages. Experiments and simulations have confirmed the efficiency of the algorithms.<>