-
3
-
-
0003502085
-
An overview of the SUIF2 compiler infrastructure
-
Stanford University
-
G. Aigner, A. Diwan, D. L. Heine, M. S. Lam, D. L. Moore, B. R. Murphy, and C. Sapuntzakis. An overview of the SUIF2 compiler infrastructure. Technical report, Stanford University, 2000.
-
(2000)
Technical Report
-
-
Aigner, G.1
Diwan, A.2
Heine, D.L.3
Lam, M.S.4
Moore, D.L.5
Murphy, B.R.6
Sapuntzakis, C.7
-
4
-
-
0028743437
-
Compiler transformations for high-performance computing
-
December
-
D. Bacon, S. Graham, and O. Sharp. Compiler transformations for high-performance computing. Computing Surveys, 26(4):345-420, December 1994.
-
(1994)
Computing Surveys
, vol.26
, Issue.4
, pp. 345-420
-
-
Bacon, D.1
Graham, S.2
Sharp, O.3
-
7
-
-
0026933251
-
Some efficient solutions to the affine scheduling problem, part I, one dimensional time
-
October
-
P. Feautrier. Some efficient solutions to the affine scheduling problem, part I, one dimensional time. International Journal of Parallel Programming, 21(5):313-348, October 1992.
-
(1992)
International Journal of Parallel Programming
, vol.21
, Issue.5
, pp. 313-348
-
-
Feautrier, P.1
-
8
-
-
0003154599
-
Collective loop fusion for array contraction
-
August
-
G. R. Gao, R. Olsen, V. Sarkar, and R. Thekkath. Collective loop fusion for array contraction. In Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, pages 171-181, August 1992.
-
(1992)
Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing
, pp. 171-181
-
-
Gao, G.R.1
Olsen, R.2
Sarkar, V.3
Thekkath, R.4
-
10
-
-
0344047770
-
Solution of the Euler equations by a multigrid method
-
A. Jameson. Solution of the Euler equations by a multigrid method. Applied Mathematics and Computation, 13:327-356, 1983.
-
(1983)
Applied Mathematics and Computation
, vol.13
, pp. 327-356
-
-
Jameson, A.1
-
16
-
-
0032662841
-
An affine partitioning algorithm to maximize parallelism and minimize communication
-
Rhodes, Greece, June
-
A. W. Lim, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. In Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing, Rhodes, Greece, June 1999.
-
(1999)
Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing
-
-
Lim, A.W.1
Cheong, G.I.2
Lam, M.S.3
-
18
-
-
0032067773
-
Maximizing parallelism and minimizing synchronization with affine partitions
-
May
-
A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, May 1998.
-
(1998)
Parallel Computing
, vol.24
, Issue.3-4
, pp. 445-475
-
-
Lim, A.W.1
Lam, M.S.2
|