Workshop 04 automatic parallelization and high-performance compilers

  • Jean-FranÇois Collard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1470)

Abstract

When trying to gain retrospect on the papers presented in this workshop, one may notice that the borderline between compile-time and run-time is getting blurred in data dependence techniques, data placement, and the exploitation of parallelism. In other words, intensive research is being conducted to benefit from the best of both worlds so as to cope with real-size applications. This orientation is very encouraging and we can hope the end-user will soon benefit from the nice work proposed by the papers of this workshop.

References

  1. 1.
    P. Feautrier. Some efficient solutions to the affine scheduling problem, part I, one dimensional time. Int. J. of Parallel Programming, 21(5):313–348, October 1992.MATHMathSciNetCrossRefGoogle Scholar
  2. 2.
    J. Knoop, O. Rüthing, and B. Steffen. Optimal code motion: Theory and practice. ACM Transactions on Programming Languages and Systems, TOPLAS, 16:1117–1155, 1994.CrossRefGoogle Scholar
  3. 3.
    Y. A. Liu. Dependence analysis for recursive data. In Int. Conf. on Computer Languages, pages 206–215, Chicago, Illinois, May 1998. IEEE.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Jean-FranÇois Collard

There are no affiliations available

Personalised recommendations