Issue No. 02 - February (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123393
<p>This work deals with the general case of processors with multiple, possibly pipelined, functional units that operate concurrently and presents a method for the minimization of the actual computation time n/sub sys/*t/sub sys/. The selection of a linear scheduling function, which minimizes n/sub sys/*t/sub sys /is formulated as a combinatorial optimization problem, which is shown to have a bounded search space. An efficient branch-and-bound method for the solution of that problem is proposed and applied to several examples.</p>
multiple functional units; pipelined functional units; concurrency; computation time minimization; systolic arrays; linear scheduling function; combinatorial optimization problem; bounded search space; branch-and-bound method; minimisation; multiprocessor interconnection networks; parallel algorithms; systolic arrays.
J. Delosme and Y. Wong, "Optimization of Computation Time for Systolic Arrays," in IEEE Transactions on Computers, vol. 41, no. , pp. 159-177, 1992.