Resource constrained scheduling of uniform algorithm

A method for optimizing the schedule and allocation of uniform algorithms onto processor arrays is derived. The main results described in the following paper are: (1) single (integer) linear programs are given for the optimal schedule of regular algorithms with and without resource constraints, (2) the class of algorithms is extended by allowing certain nonconvex index domains, (3) effecient branch and bound techniques are used such that problems of relevant size can be solved. Moreover, additional constraints such as cache memory bus bandwidths and access conflicts can be considered also. The results are applied to an example of relevant size.<
>