A Scheduling Method Considering Register-to-Register Data Transfers

A scheduling method considering register-to-register transfers

“…Next, as to the computation time, since ILP is an aggregating technique, the amount of computation increases exponentially with the number of operations [5,7]. On the other hand, if n is the number of operations and c is the number of steps in which the assignment of operations is possible, the order of FDS is Oc 2 n 3 ; that of operation assignment is also Oc 2 n 3 in the proposed technique.…”

“…For the data of Table 2, Table 3 shows a comparison with the optimal solutions determined by ILP [5] and the after technique, in which the R-R transfer is assigned such that the cost will become a minimum after scheduling by the FDS. In the proposed technique, the same optimal solution as ILP can be obtained in APL.…”

“…In the scheduling of pipeline-scheme datapaths considering R-R transfers, a technique using integer linear programming (ILP) has been reported [5]. In this technique, an optimal solution can be obtained by using ILP; however, since the amount of computation will increase exponentially when the scale of the problem becomes larger, the CCC0424-7760/99/030063-09 © 1999 Scripta Technica Electrical Engineering in Japan, Vol.…”