Pages that link to "Item:Q687632"

The following pages link to Some efficient solutions to the affine scheduling problem. I: One- dimensional time (Q687632):

Displaying 13 items.

• Parallelization of sequential programs: distribution of arrays among processors and structurization of communications (Q380672) (← links)
• Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (Q511402) (← links)
• Scalable and structured scheduling (Q862862) (← links)
• Affine scheduling on bounded convex polyhedric domains is asymptotically optimal (Q1128739) (← links)
• Some efficient solutions to the affine scheduling problem. II: Multidimensional time (Q1322507) (← links)
• Generation of parallel synchronization-free tiled code (Q1640015) (← links)
• Locally recursive non-locally asynchronous algorithms for stencil computation (Q1662781) (← links)
• Incremental closure for systems of two variables per inequality (Q1733055) (← links)
• Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
• A consistent generation of pipeline parallelism and distribution of operations and data among processors (Q2433015) (← links)
• Quantifier elimination in automatic loop parallelization (Q2457396) (← links)
• Automatic array partitioning based on the Smith normal form (Q2572380) (← links)
• Heterogeneous LBM Simulation Code with LRnLA Algorithms (Q5887631) (← links)