Unimodularity considered non-essential (extended abstract)-Reference-Cited by-同舟云学术

Unimodularity considered non-essential (extended abstract)

Published:1992 Issue: Volume: Page:659-664
ISSN:0302-9743
Container-title:Parallel Processing: CONPAR 92—VAPP V
language:
Short-container-title:

Author:

Barnett Michael,Lengauer Christian

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-55895-0_467.pdf

Reference7 articles.

1. C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In Proc. Third ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming (PPoPP), pages 39–50. ACM Press, Apr. 1991.

2. Technical Report TR-92-13;M. Barnett,1992

3. R. T. Boute. The Euclidean definition of the functions div and mod. ACM Trans. on Programming Languages and Systems, 14(2): 127–144, Apr. 1992.

4. P. Feautrier. Semantical analysis and mathematical programming. In M. Cosnard, Y. Robert, P. Quinton, and M. Raynal, editors, Parallel & Distributed Algorithms, pages 309–320. North-Holland, 1989

5. L.-C. Lu and M. Chen. New loop transformation techniques for massive parallelism. Technical Report YALEU/DCS/TR-833, Department of Computer Science, Yale University, Oct. 1990.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Simple Algorithm for the Generation of Efficient Loop Structures;International Journal of Parallel Programming;1996-06

2. Automatic synthesis of parallel algorithms;Solving Combinatorial Optimization Problems in Parallel;1996

3. Automatic parallelization ofwhile-loops using speculative execution;International Journal of Parallel Programming;1995-04

4. Loop parallelization in the polytope model;CONCUR'93;1993

5. A systolizing compilation scheme for nested loops with linear bounds;Functional Programming, Concurrency, Simulation and Automated Reasoning;1993