Mapping uniform loop nests onto distributed memory architectures

This publication has 10 references indexed in Scilit:

• Compiling Fortran D for MIMD distributed-memory machines
  Communications of the ACM, 1992
• Regular partitioning for synthesizing fixed-size systolic arrays
  Integration, 1991
• The data alignment phase in compiling programs for distributed-memory machines
  Journal of Parallel and Distributed Computing, 1991
• Time optimal linear schedules for algorithms with uniform dependencies
  IEEE Transactions on Computers, 1991
• Dataflow analysis of array and scalar references
  International Journal of Parallel Programming, 1991
• Compile-time techniques for data distribution in distributed memory machines
  IEEE Transactions on Parallel and Distributed Systems, 1991
• Partitioning and mapping nested loops on multiprocessor systems
  IEEE Transactions on Parallel and Distributed Systems, 1991
• Minimum distance: a method for partitioning recurrences for multiprocessors
  IEEE Transactions on Computers, 1989
• An introduction to a formal theory of dependence analysis
  The Journal of Supercomputing, 1988
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
  IEEE Transactions on Computers, 1986