(Enter summary)
Abstract: This paper extends the algorithms which were given in Part I to cases
in which there is no affine schedule, i.e. to problems whose parallel complexity
is polynomial but not linear. The natural generalization is to multidimensional
schedules with lexicographic ordering as temporal succession.
Multidimensional affine schedules, are, in a sense, equivalent to polynomial
schedules, and are much easier to handle automatically. Furthermore,
there is a strong connexion between multidimensional... (Update)
Cited by: More
Software Methods to Improve Data Locality and Cache Behavior - Beyls (2004)
(Correct)
In Search of a Program Generator to Implement.. - Cohen, Donadio.. (2005)
(Correct)
Putting Polyhedral Loop Transformations to Work - Bastoul, Cohen, Girbal.. (2003)
(Correct)
Similar documents (at the sentence level):
48.5%: Some efficient solutions to the affine scheduling problem.. - Paul Feautrier (1992)
(Correct)
Active bibliography (related documents): More All
0.3: Some efficient solutions to the affine scheduling problem Part I .. - Feautrier (1993)
(Correct)
0.2: Scheduling Reductions - Xavier Redon And (1994)
(Correct)
0.1: Affine-by-Statement Scheduling of Uniform and Affine Loop.. - Darte, Robert (1995)
(Correct)
Similar documents based on text: More All
0.2: Construction of DO Loops from Systems of Affine Constraints - Collard, Feautrier, Risset (1993)
(Correct)
0.2: Toward Automatic Distribution - Feautrier (1994)
(Correct)
0.2: Detection of Recurrences in Sequential Programs with Loops - Redon, Feautrier (1993)
(Correct)
Related documents from co-citation: More All
38: A loop transformation theory and an algorithm to maximize parallelism (context) - Wolf, Lam - 1991
38: Dataflow analysis of array and scalar references
- Feautrier - 1991
36: Optimizing Supercompilers for Supercomputers (context) - Wolfe - 1982
BibTeX entry: (Update)
P. Feautrier. Some efficient solution to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6), December 1992. http://citeseer.ist.psu.edu/feautrier92some.html More
@article{ feautrier92some,
author = "Paul Feautrier",
title = "Some Efficient Solutions to the Affine Scheduling Problem. Part {II}. Multidimensional Time",
journal = "International Journal of Parallel Programming",
volume = "21",
number = "6",
pages = "389--420",
year = "1992",
url = "citeseer.ist.psu.edu/feautrier92some.html" }
Citations (may not include all citations):
717
Theory of linear and integer programming (context) - Schrijver - 1986
258
Automatic translation of fortran programs to vector form
- Allen, Kennedy - 1987
67
Dataflow analysis of scalar and array references (context) - Feautrier - 1991
54
RAIRO Recherche Op'erationnelle (context) - Feautrier, programming - 1988
25
Optimal code parallelization using unimodular transformation.. (context) - Dowling - 1990
13
Affine-by-statement Scheduling of Uniform Loop Nest over Par..
- Darte, Robert - 1992
4
Somme Efficient Solution to the Affine Scheduling Problem (context) - Feautrier - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.lip6.fr.html): More
TCP and UDP with Bigger Addresses (TUBA), A Simple Proposal for.. - Callon (1992)
(Correct)
Ethiopian Language Support for the Babel Package - Beyene, Kudlek, Kummer.. (1998)
(Correct)
TEX-based Production at the AMS - Youngen (1992)
(Correct)
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