Title :
Time optimal linear schedules for algorithms with uniform dependencies
Author :
Shang, Weijia ; Fortes, Jose A B
Author_Institution :
Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA
Abstract :
The problem of identifying the time-optimal linear schedules for uniform dependence algorithms with any convex-polyhedron index set is addressed. Optimization procedures are proposed, and the class of algorithms is identified for which the total execution times by the optimal linear schedule and the free schedule that schedules the computation to execute as soon as its operands are available are equal. This method is useful in mapping algorithms onto systolic/MIMD (multiple-instruction, multiple-instruction stream) systems.<>
Keywords :
cellular arrays; optimisation; parallel algorithms; scheduling; MIMD systems; convex-polyhedron index set; systolic systems; time-optimal linear schedules; uniform dependence algorithms; Computational modeling; Contracts; Processor scheduling; Scheduling algorithm; Sufficient conditions; Systolic arrays; Terminology; Vectors;
Conference_Titel :
Systolic Arrays, 1988., Proceedings of the International Conference on
Conference_Location :
San Diego, CA, USA
Print_ISBN :
0-8186-8860-2
DOI :
10.1109/ARRAYS.1988.18079
