The use of iteration space partitioning to construct representative simple sections

Journal of Parallel and Distributed Computing

Volumn 34, Issue 1, 1996, Pages 95-110

  Bik, Aart J C ^a   Wijshoff, Harry A G ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030577978     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0048     Document Type: Article

References (27)

1. 1. Ancourt, Corinne and Irigoin, François. Scanning polyhedra with do loops. Proceedings of Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming 1991, pp. 39-50.
2. 2. Balasundaram, Vasanth. Interactive parallelization of numerical scientific programs. Ph.D. thesis, Department of Computer Science, Rice University, 1989.
3. 3. Balasundaram, Vasanth. A mechanism for keeping useful internal information in parallel programming tools: The data access descriptor. J. Parallel Distrib. Comput. 9 (1990), 154-170.
4. 4. Banerjee, U. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic, Boston, 1993.
5. 5. Banerjee, U. Loop Parallelization. Kluwer Academic, Boston, 1994.
6. 6. Bik, Aart J. C. A prototype restructuring compiler. Master's thesis, Utrecht University, 1992. INF/SCR-92-11.
7. 7. Bik, Aart J. C., Knijnenburg, Peter M. W., and Wijshoff, Harry A. G. Reshaping access patterns for generating sparse codes. In Pingali, K., Banerjee, U., Gelernter, D., Nicolau, A., and Padua, D. (Eds.). Lecture Notes in Computer Science, No. 892. Springer-Verlag, Berlin/ New York, 1995, pp. 406-422.
8. 8. Bik, Aart J. C., and Wijshoff, Harry A. G. Compilation techniques for sparse matrix computations. Proceedings of the International Conference on Supercomputing. 1993, pp. 416-424.
9. 9. Bik, Aart J. C., and Wijshoff, Harry A. G. Nonzero structure analysis. Proceedings of the International Conference on Supercomputing. 1994, pp. 226-235.
10. 10. Bik, Aart J. C., and Wijshoff, Harry A. G. On automatic data structure selection and code generation for sparse computations. In Banerjee, Utpal, Gelernter, David, Nicolau, Alex, and Padua, David, (Eds.). Lecture Notes in Computer Science, No. 768. Springer-Verlag, Berlin/ New York, 1994, pp. 57-75.
11. 11. Bik, Aart J. C., and Wijshoff, Harry A. G. On strategies for generating sparse codes. Technical Report 95-01, Department of Computer Science, Leiden University, 1995.
12. 12. Borsuk, Karol. Multidimensional Analytic Geometry. Polish Scientific Publishers, Warsaw, 1969.
13. 13. Brinkhaus, Peter. Compiler analysis of procedure calls. Master's thesis, Utrecht University, 1993. INF/SCR-93-13.
14. 14. Dantzig, George B., and Eaves, B. Curtis. Fourier-Motzkin elimination and its dual. J. Combin. Theory 14 (1973), 288-297.
15. 15. Duff, Iain S., Grimes, Roger G., and Lewis, John G. Sparse matrix test problems. ACM Trans. Math. Software 15 (1989), 1-14.
16. 16. Grünbaum, Branko, Convex Polytopes. Interscience, London, 1967.
17. 17. Kuck, David J. The Structure of Computers and Computations, Wiley, New York, 1978.
18. 18. Loveman, David B. Program improvement by source-to-source transformations. J. Assoc. Comput. Mach. 24 (1977), 121-145.
19. 19. McMullen, P., and Shephard, G. C. Convex Polytopes and the Upper Bound Conjecture. Cambridge Univ. Press, London/New York, 1971.
20. 20. Padua, David A., and Wolfe, Michael J. Advanced compiler optimizations for supercomputers. Comm. ACM 29 (1986), 1184-1201.
21. 21. Polychronopoulos, C. D. Parallel Programming and Compilers. Kluwer Academic, Boston, 1988.
22. 22. Saad, Youcef, and Wijshoff, Harry A. G. Spark: A benchmark package for sparse computations. Proceedings of the International Conference on Supercomputing. 1990, pp. 239-253.
23. 23. Wolfe, Michael J. Optimizing Supercompilers for Supercomputers. Pitman, London, 1989.
24. 24. Wolfe, Michael J. High Performance Compilers for Parallel Computers. Addison-Wesley, Redwood City, CA, 1996.
25. 25. Zima, H. Supercompilers for Parallel and Vector Computers. ACM Press, New York, 1990.
26. 26. Zlatev, Zahari. Computational Methods for General Sparse Matrices. Kluwer Academic, Dordrecht, 1991.
27. 27. Zlatev, Zahari, Wasniewski, Jerzy, and Schaumburg, Kjeld Y12M -Solution of large and sparse systems of linear algebraic equations. In Lecture Notes in Computer Science, No. 121. Springer-Verlag, Berlin, 1981.