Abstract
Data path synthesis and control part synthesis are strongly interdependent. This fact vindicates a novel approach for early control optimization in terms of the number of commands, while data path is still at the very beginning stage of its synthesis. The scheduling algorithm is based on stochastic searching guided by a cost function to be minimized. In order to take into account the control aspect optimization a simple term is added to the cost function used in the scheduling process. This term is merely a statistical measure of the Control Data Flow Graph regularity, since our conjecture is that the more regular the CDFG, the simpler the Control Part. Moreover, this simple extra measure of regularity during scheduling permits to perform scheduling and binding, in sequence, without decreasing the solution quality.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call