Supernode partitioning

  • Authors:
  • F. Irigoin;R. Triolet

  • Affiliations:
  • Ecole Nationale Supérieure des Mines de Paris, Paris, France;Ecole Nationale Supérieure des Mines de Paris, Paris, France

  • Venue:
  • POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 1988

Quantified Score

Hi-index 0.01

Visualization

Abstract

Supercompilers must reschedule computations defined by nested DO-loops in order to make an efficient use of supercomputer features (vector units, multiple elementary processors, cache memory, etc…). Many rescheduling techniques like loop interchange, loop strip-mining or rectangular partitioning have been described to speedup program execution. We present here a class of partitionings that encompasses previous techniques and provides enough flexibility to adapt code to multiprocessors with two levels of parallelism and two levels of memory.