Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90251
<p>The authors address the problem of identifying optimal linear schedules for uniform dependence algorithms so that their execution time is minimized. Procedures are proposed to solve this problem based on the mathematical solution of a nonlinear optimization problem. The complexity of these procedures is independent of the size of the algorithm. Actually, the complexity is exponential in the dimension of the index set of the algorithm, and for all practical purposes, very small due to the limited dimension of the index set of algorithms of practical interest. A particular class of algorithms for which the proposed solution is greatly simplified is considered, and the corresponding simpler organization procedure is provided.</p>
time optimal linear schedules; algorithms; uniform dependencies; uniform dependence algorithms; mathematical solution; nonlinear optimization problem; complexity; computational complexity; optimisation; parallel algorithms.
W. Shang and J. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," in IEEE Transactions on Computers, vol. 40, no. , pp. 723-742, 1991.