FINDING OPTIMUM WAVEFRONT OF PARALLEL COMPUTATIONFootnote∗

∗This work sponsored in part by IBM Corp. under the Development Grant, by NSF under grant CCR-8920694 and by ONR under grant N00014-93-1-0076. The content of the information does not necessarily reflect the position or the policy of the Government, and no official endorsement should be inferred.

References

• M. R. Garcy and D. S. Johnson , Computers and intractability A Guide to the Theory of NP-Completcness , W. H. Freeman and Company , New York , 1979 .
   Google Scholar
• L. Lamport , The parallel execution of do loops . CACM 17 ( 1974 ).
   Google Scholar
• P.-Z. Lee and Z. M. Kedem , Synthesizing linear array algorithms from nested for loop algorithms . IEEE Trans, on Computers 37 , 12 ( Dec. 1988 ).
   Google Scholar
• P.-Z. , Lee and Z. M. Kedem , Mapping nested loop algorithms into multidimensional systolic arrays . In IEEE Transactions on Parallel and Distributed Processing 1 , 1 ( Jan. 1990 ).
   Google Scholar
• J. Li and M. Chen , Index Domain Alignment Minimizing Cost of Cross-Referencing Between Distributed Arrays , Tech. Rep., Dcpt. of Comp. Sc , Yale Univ. , YALEU/DCS/TR-725 , Nov. 1989 .
   Google Scholar
• W. L. Miranker and A. Winkler , Spacetime representations of computational structures . In Computing 32 , 2 ( 1984 ), 93 – 114 .
   Web of Science ®Google Scholar
• D. I. Moldovan , Partitioning and mapping algorithms into fixed size systolic arrays . In IEEE Transactions on Computers C-35 , 1 ( Jan. 1986 ), 1 – 12 .
   Web of Science ®Google Scholar
• C. D. Polychronopoulos , D. J. Kuck and D. A. Padua , Utilizing multidimensional loop parallelism on large-scale parallel processor systems . In IEEE Transactions on Computers 38 , 9 ( Sept. 1989 ), 1285 – 1296 .
   Web of Science ®Google Scholar
• S. K. Rao , Regular Iterative Algorithms and Their Implementations on a Processor Arrays , Ph.D. Thesis, Dept. of Electrical Engineering , Stanford University , California , 1985 .
   Google Scholar
• M. Rosing , R. B. Schnabel and R. P. Weaver , Scientific programming languages for distributed memory multiprocessors Paradigms and research issues. In Languages, Compilers and Run-Time Environments for Distributed Memory Machines , by J. Sallz and P. Mehrotra (eds.), Elsevier Science Publishers , 1992.
   Google Scholar
• J.-P. Sheu and T.-H. Tai , Partitioning and mapping nested loops on multiprocessor systems . In IEEE Trans. on Parallel and Distributed Systems 2 , 4 ( Oct. 1991 ), 430 – 439 .
   Web of Science ®Google Scholar
• B. Sinharoy and B. K. Szymanski , Data and task alignment in distributed memory machines . In J. Parallel and Distributed Computing 20 , 1 ( Jan. 1994 ).
   Google Scholar
• B. K. Szymanski (ed.), Parallel Functional Languages and Environments ACM Press New York , NY , 1991 .
   Google Scholar
• C.-M. Wang and S. D. Wang , Efficient processor assignment algorithms and loop transformations for executing nested parallel loops on multiprocessors . In IEEE Transactions on Parallel and Distributed Systems 3 , 1 ( Jan. 1992 ), 71 – 82 .
   Web of Science ®Google Scholar
• ∗This work sponsored in part by IBM Corp. under the Development Grant, by NSF under grant CCR-8920694 and by ONR under grant N00014-93-1-0076. The content of the information does not necessarily reflect the position or the policy of the Government, and no official endorsement should be inferred.
   Google Scholar