|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. Abramowitz and I. Stetgun. Handbook of Mathematical Functions. Dover Publications, New York, 1984.
|
| |
2
|
|
 |
3
|
|
| |
4
|
A. Bachem. The Theorem of Minkowski for Polyhedral Monoids and Aggregated Linear Diophantine Systems. Optimization and Operations Research- Proc. os~ Workshop, University of Bonn, October 1977, Lecture Notes in Economics and Mathematical Systems, Vol. 157, pages 1-14, Springer Verlag.
|
| |
5
|
V. Balasundaram, G. Fox, K. Kennedy and U. Kremer. An interactive environment for data partitioning and distribution. Proc. 5th Distributed Memory Computing Conference (DMCC5), Charleston, S. Carolina, pages 1160-1170, April 1990.
|
| |
6
|
|
| |
7
|
D. Callahan and K. Kennedy. Compiling Programs for Distributed-Memory Multiprocessors. The Journal of Supercomputing, Vol. 2, Oct. 1988, pp. 151-169.
|
 |
8
|
|
| |
9
|
M. Chen, Y. Choo and J. Li. Compiling Parallel Programs by Optimizing Performance. The Journal of Supercomputing, 2, 1988, pp. 171-207.
|
| |
10
|
M. Chen, Y. Choo and J. Li. Theory and pragmatics of compiling efficient parallel code. Technical Report YALEU/DCS/TR-760, Yale University, December 1989.
|
 |
11
|
|
| |
12
|
|
| |
13
|
S. Hiranandani, K. Kennedy, C. Koelbel, U. Kremer and G. Tseng. An Overview of the Fortran D Programming System. Tech. Report Rice COMP TR91- 154, Department of Computer Science, Rice University, March 1991.
|
 |
14
|
|
| |
15
|
C. King and L. Ni. Grouping in Nested Loops for Parallel Execution on Multicomputers. Proc. International Conf. Parallel Processing, 1989, Vol. 2, pp. II-31 to II-38.
|
| |
16
|
|
| |
17
|
|
 |
18
|
|
| |
19
|
|
| |
20
|
U. Kremer, H. Bast, H. Gerndt and H. Zima. Advanced Tools and Techniques for Automatic Parallehzation. Parallel Computing, Vol. 7, 1988, pp. 387- 393.
|
 |
21
|
D. J. Kuck , R. H. Kuhn , D. A. Padua , B. Leasure , M. Wolfe, Dependence graphs and compiler optimizations, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-218, January 26-28, 1981, Williamsburg, Virginia
[doi> 10.1145/567532.567555]
|
 |
22
|
|
| |
23
|
|
| |
24
|
|
 |
25
|
|
 |
26
|
|
| |
27
|
|
| |
28
|
J. Ramanujam and P. Sadayappan. Tiling of Iteration Spaces for Multicomputers. Proc. 1990 International Conference on Parallel Processing, Vol 2, pages 179- 186, August 1990.
|
| |
29
|
|
 |
30
|
|
| |
31
|
|
| |
32
|
|
| |
33
|
|
 |
34
|
|
| |
35
|
|
| |
36
|
|
| |
37
|
|
| |
38
|
|
 |
39
|
|
| |
40
|
H. Zima, H. Bast and H. Gerndt. SUPERB: A Tool for Semi-automatic MIMD/SIMD Parallelization. Parallel Computing, Vol. 6, 1988, pp. 1-18.
|
CITED BY 18
|
|
|
|
|
|
|
|
|
|
|
Francisco Almeida , Rumen Andonov , Daniel Gonzalez , Luz M. Moreno , Vincent Poirriez , Casiano Rodriguez, Optimal tiling for the RNA base pairing problem, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, August 10-13, 2002, Winnipeg, Manitoba, Canada
|
|
|
|
|
|
|
|
|
W. Zhang , M. Karakoy , M. Kandemir , G. Chen, A compiler approach for reducing data cache energy, Proceedings of the 17th annual international conference on Supercomputing, June 23-26, 2003, San Francisco, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jia Guo , Ganesh Bikshandi , Basilio B. Fraguela , Maria J. Garzaran , David Padua, Programming with tiles, Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, February 20-23, 2008, Salt Lake City, UT, USA
|
|