| P. Feautrier. Asymptotically efficient algorithms for parallel architectures. In Decentralized Systems, pages 273--284. IFIP Working Group 10.3, North-Holland, 1989. |
....with distributed memory. A number of authors have already noticed that data parallelism provides an adequate framework for this purpose, as data parallelism is, in some sense, hidden behind control parallelism in the methodology. We follow here the general lines of the presentation of Feautrier [12]. The reader is referred to Feautrier s contribution in this volume for further details [13] Many studies on Fortran scientific programs have shown that the core of such programs consists of sequences and nestings of DO loops with simple (e.g. affine) index dependencies. For example, DO i = 1; ....
P. Feautrier. Asymptotically efficient algorithms for parallel architectures. In Decentralized Systems, pages 273--284. IFIP Working Group 10.3, North-Holland, 1989.
....on MIMD parallel machines with distributed memory have been proposed. A number of authors have already noticed that data parallelism provides an adequate framework for this purpose, as it is actually hidden, in some sense, behind control parallelism. We follow here the presentation of Feautrier [10]. Many studies on Fortran scientific programs have shown that the heart of such programs are made of sequences and nestings of DO loops with simple (e.g. affine) index dependencies. DO i = 1; M DO j = 1; N(i) A[i; j] A[f(i; j) g(i; j) where N(i) f(i; j) and g(i; j) are simple ....
P. Feautrier, Asymptotically efficient algorithms for parallel architectures. In; Decentralized System, M. Cosnard, C. Girault (Eds.), IFIP Working Group 10.3, North-Holland, 1989, pp. 273--284.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC