This Article 
 Bibliographic References 
 Add to: 
Time Optimal Linear Schedules for Algorithms with Uniform Dependencies
June 1991 (vol. 40 no. 6)
pp. 723-742

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.

[1] R. Karp, R. Miller, and S. Winograd, "The Organization of Computations for Uniform Recurrence Equations,"J. ACM, Vol. 14, No. 3, 1967, pp. 563-590.
[2] D. I. Moldovan and J. A. B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays,"IEEE Trans. Comput., vol. C-35, pp. 1-12, Jan. 1986.
[3] P. R. Cappello and K. Steiglitz, "Unifying VLSI array designs with geometric transformations," inProc. 1983 Int. Conf. Parallel Processing, 1983, pp. 448-457.
[4] P. Quinton, "Automatic synthesis of systolic arrays from uniform recurrent equations," inProc. 11th Annu. Symp. Comput. Architecture, 1984, pp. 208-214.
[5] S. K. Rao, "Regular iterative algorithms and their implementations on processor arrays," Ph.D. dissertation, Stanford Univ., Stanford, CA, Oct. 1985.
[6] M. Chen, "A design methodology for synthesizing parallel algorithms and architectures,"J. Parallel Distributed Comput., pp. 461-491, Dec. 1986.
[7] J.-M. Delosme and I. C. F. Ipsen, "An illustration of a methodology for the construction of efficient systolic architectures in VLSI," inProc. Second Int. Symp. VLSI Technol. Syst. Appl., 1985, pp. 268-273.
[8] S.Y. Kung,VLSI Array Processors, Prentice Hall, Englewood Cliffs, N.J. 1988.
[9] C. Guerra and R. Melhem, "Synthesizing non-uniform systolic designs," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 765-771.
[10] G.-J. Li and B. W. Wah, "The design of optimal systolic arrays,"IEEE Trans. Comput., vol. C-34, pp. 66-77, Jan. 1985.
[11] M. T. O'Keefe and J. A. B. Fortes, "A comparative study of two systematic design methodologies for systolic arrays," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 672-675.
[12] J. A. B. Fortes and F. Parisi-Presicce, "Optimal linear schedules for the parallel execution of algorithms," inProc. 1984 Int. Conf. Parallel Processing, 1984, pp. 322-328.
[13] L. Lamport, "The parallel execution of DO loops,"Commun. ACM, vol. 17, no. 2, pp. 83-93, Feb. 1974.
[14] M. S. Bazaraa and C. M. Shetty,Nonlinear Programming: Theory and Algorithms. New York: Wiley, 1979.
[15] W. Shang and J. A. B. Fortes, "Independent partitioning of algorithms with uniform dependencies," inProc. 1988 Int. Conf. Parallel Processing, vol. 2, Software, Aug. 1988, pp. 26-33.
[16] W. Shang and J. A. B. Fortes, "Time optimal linear schedules for algorithms with uniform dependencies," inProc. Int. Conf. Systolic Arrays, May 1988, pp. 393-402.
[17] R. T. Rockafellar,Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
[18] G. Strang,Linear Algebra and its Applications. 2nd ed. New York: Academic, 1980.
[19] R. Cytron, "Doacross: Beyond vectorization for multiprocessors (extended abstract)," inProc. 1986 Int. Conf. Parallel Processing, 1986, pp. 836-844.
[20] W. L. Miranker and W. M. Liniger, "Parallel methods for the numerical integration of ordinary differential equation,"Math. Comp., vol. 21, pp. 303-320, 1967.
[21] R. H. Kuhn, "Optimization and interconnection complexity for: parallel processors, single stage networks, and decision trees," Ph.D. dissertation, Dep. Comput. Sci., Rep. 80-1009, Univ. of Illinois, Urbana-Champaign, IL, 1980.
[22] H. T. Kung and C. E. Leiserson, "Algorithms for VLSI array processors," inIntroduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980, section 8.3.
[23] N. Weste, D. J. Burr, and B.D. Ackland, "Dynamic time warp pattern matching using an integrated multiprocessing array,"IEEE Trans. Comput., vol C-23, pp. 731-744, Aug. 1983.
[24] D. A. Padua, "Multiprocessors: Discussion of theoretical and practical problems," Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, Rep. UIUCDCS-R-79-990, Nov. 1979.
[25] J.-K. Peir and R. Cytron, "Minimum distance: A method for partitioning recurrences for multiprocessors," inProc. 1987 Int. Conf. Parallel Processing, 1987, pp. 217-225.
[26] F. Irigoin and R. Triolet, "Supernode partitioning," inProc. Fifteenth Annu. ACM. SIGACT-SIGPLAN Symp. Principles Programming Languages, Jan. 1988, pp. 319-329.
[27] B. Lisper, "Synthesis of synchronous systems by static scheduling in space-time," Ph.D. dissertation, TRITA-NA-8701, NADA, KTH, Stockholm, 1987.
[28] V. Van Dongen, personal communications.
[29] A. Schrijver,Theory of Linear and Integer Programming. New York: Wiley, 1986.
[30] W. Shang, "Scheduling, partitioning and mapping of uniform dependence algorithms on processor arrays," Ph.D. dissertation, Purdue Univ., W. Lafayette, IN 47907, May 1990.
[31] D. G. Luenberger,Linear and Nonlinear Programming. 2nd Ed. Reading, MA: Addison-Wesley, 1984.

Index Terms:
time optimal linear schedules; algorithms; uniform dependencies; uniform dependence algorithms; mathematical solution; nonlinear optimization problem; complexity; computational complexity; optimisation; parallel algorithms.
W. Shang, J.A.B. Fortes, "Time Optimal Linear Schedules for Algorithms with Uniform Dependencies," IEEE Transactions on Computers, vol. 40, no. 6, pp. 723-742, June 1991, doi:10.1109/12.90251
Usage of this product signifies your acceptance of the Terms of Use.