A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. Technical Report 00-04, ICPS, University of Strasbourg, France, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Constraint Optimization Framework for Mapping a.. - Mattioli, Museux, .. (2000) (Correct)
....optimization impossible. Work based on Integer Programming with Boolean variables led to a combinatorial explosion [21] A lot of work has been done to optimise local criteria such as data and or computation distribution locality [15, 6, 13] parallelism level, number of communications [2, 24] In [11], the scheduling is computed w.r.t. a given partitioning. Since a few years, THALES in collaboration with Ecole des Mines de Paris open a radically new way by bringing up a concurrent model based approach to handle the problem as a whole [1, 12, 16] Since then, this model has been implemented ....
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. In Eighth International Workshop on Compilers for Parallel Computers, CPC2000, pages 135--150, january 2000.
Scheduling the Computations of a Loop Nest with.. - Darte, Diderich.. (2000) (2 citations) Self-citation (Darte Diderich Gengler Vivien) (Correct)
No context found.
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. Technical Report 00-04, ICPS, University of Strasbourg, France, 2000.
On the optimality of Feautrier's scheduling algorithm - Vivien (2002) (1 citation) Self-citation (Vivien) (Correct)
No context found.
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the Computations of a Loop Nest with Respect to a Given Mapping. In Proceedings of Euro-Par 2000, volume 1900 of LNCS, pages 405-414, Munich, Germany, Sept. 2000.
Scheduling the Computations of a Loop Nest with.. - Darte, Diderich.. (2000) (2 citations) Self-citation (Darte Diderich Gengler Vivien) (Correct)
....there exists a compatible scheduling. Finally, in Section 6, we describe an algorithm that e ectively builds a compatible scheduling for a given mapping, when one exists. We conclude with some perspectives and extensions of our results. Note: the missing proofs and explanations can be found in [4]. 2 Compatibility of Mapping and Scheduling Functions We consider here the (uniform) loop nest presented as Example 1. Suppose that we are looking for a one dimensional alignment of this loop nest, that is, we consider the processors to be indexed as a vector of processors. As usually, we search ....
....that Darte Vivien can build. One could wonder whether there are examples for which there exist ane schedules compatible with the given computation mapping, but no such schedules among those Darte Vivien can build. In fact, this cannot occur when dependence distances are approximated by polyhedra [4]. Condition (2) is a general condition. 6 The Algorithm The algorithm, which builds the desired schedule when Condition (2) of Lemma 1 is ful lled, proceeds in three steps: 1) building of the vectors F i S 2 VS(S; i) satisfying the desired properties; 2) from the vectors F i S , building of ....
[Article contains additional citation context not shown here]
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. Technical Report 00-04, ICPS, University of Strasbourg, France, 2000.
Simple Code Generation for special UDLs - Florina Ciorba Theodore (2003) (Correct)
No context found.
A. Darte, C. Diderich, M. Gengler, and F. Vivien. Scheduling the computations of a loop nest with respect to a given mapping. Aussois, France, Jan 2000. Eigth Int'l Workshop on Compilers for Parallel Computers.
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