Nonsingular data transformations: Definition, validity, and applications

International Journal of Parallel Programming

Volumn 27, Issue 3, 1999, Pages 131-159

  O'Boyle, Michael F P ^a   Knijnenburg, Peter M W ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; PROGRAM COMPILERS;

NONSINGULAR DATA TRANSFORMATIONS;

DATA STRUCTURES;

EID: 0032658236     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018744411700     Document Type: Article

References (26)

1. M. Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley (1996).
2. U. Banerjee, Unimodular transformations of double loops, Proc. of Third Workshop on Progr. Lang. Compilers for Parallel Comput. (August 1990).
3. W. Li and K. Pingali, A singular loop transformation framework based on nonsingular matrices, IJPP, 22(2): 183-205 (1994).
4. P. M. W. Knijnenburg, E. Ayguadé, and J. Torres, Multi-transformations of nested loops for parallelizing compilers, Technical Report 96-14, Dept. of Computer Science, Leiden University (1996).
5. D. Kulkarni and M. Stumm, CDA loop transformations, Languages, Compilers and Run-Time Systems for Scalable Computers, Kluwer Academic Press (1995).
6. M. E. Wolf and M. Lam, An algorithmic approach to compound loop transformations. In Advances in Languages and Compilers for Parallel Processing, A. Nicolau, D. Gelernter, T. Gross, and D. Padua (eds.), Pitman (1991).
7. W. A. Kelly and W. Pugh, A framework for unifying reordering transformations, Technical Report CS-TR-3193, Dept. of Computer Science, University of Maryland (1993).
8. O. Temam, E. D. Granston, and W. Jalby, To copy or not to copy: A compile-time technique for assessing when data copying should be used, Proc. Supercomputing, Portland Oregon (1993).
9. T. E. Jeremiassen and S. J. Eggers, Reducing false sharing on shared memory multi-processors through compile-time data transformations, Proc. Principles and Practice of Parallel Progr., ACM Press (1995).
10. S. Chatterjee, J. R. Gilbert, R. Schreiber, and S-H. Teng, Automatic array alignment in data parallel programs, Proc. Principles of Progr. Lang., ACM Press (1993).
11. J. Li and M. Chen, Index domain alignment: Minimizing cost of cross-referencing between distributed arrays, IEEE Proc. of the Third Symp. on the Frontiers of Massively Parallel Computation (1990).
12. M. F. P. O'Boyle and G. A. Hedayat, Data alignment: Transformations to reduce communication on distributed memory architectures, Proc. Scalable High Performance Computing Conf., Williamsburg, IEEE Press (1992).
13. D. Kulkarni and M. Stumm, Loop and data transformations: A tutorial, University of Toronto, Technical Report CSRI-337 (1993).
14. M. Cierniak and W. Li, Unifying data and control transformations for distributed shared-memory machines, Proc. Progr. Lang. Design and Implementation (1995).
15. Y.-J. Ju and H. Dietz, Reduction of cache coherence overhead by compiler data layout and loop transformations, Proc. Fourth Int'l. Workshop on Lang. Compilers for Parallel Comput., Lecture Notes in Computer Science 589, Springer Verlag (1992).
16. J. M. Anderson, S. P. Amarasinghe, and M. S. Lam, Data and computation transformations for multiprocessors, Proc. Principles and Practice of Parallel Progr., ACM Press (1995).
17. S.-T. Leung and J. Zahorjan, Optimizing data locality by array restructuring, University of Washington, Department of Computer Science and Engineering, Technical Report 95-09-01 (1995).
18. W. Li and K. Pingali, Access normalization: Loop restructuring for NUMA compilers, ACM Trans. Computer Syst., 11(4):353-375 (1993).
19. D. Gannon, W. Jalby, and K. Gallivan, Strategies for cache and local memory management by global program transformations, J. Parallel Distribut. Comput., 5:587-616 (1988).
20. A. Choudhary, G. Fox, S. Hiranandani, K. Kennedy, C. Koelbel, S. Ranka, and C.-W. Tseng, Unified compilation of Fortran 77D and 90D, ACM Lett. Progr. Lang. Syst., Vol.2 (1993).
21. A. J. C. Bik and P. M. W. Knijnenburg, Reshaping access patterns for improving data locality, Proc. Sixth Workshop on Compilers for Parallel Computers (1996).
22. M. E. Wolf and M. S. Lam, A data locality optimizing algorithm, Proc. Progr. Lang. Design and Implementation (1991).
23. F. Bodin and M. F. P. O'Boyle, A compiler strategy for SVM, Proc. Third Workshop on Lang. Compilers and Run-time Syst., New York, Kluwer Press (1995).
24. K. Knobe, J. D. Lukas, and G. Steele, Data optimization: Allocation of arrays to reduce communication on SIMD machines, J. Parallel Distribut. Comput., 8:102-118 (1990).
25. D. Bau, I. Kodukula, V. Kotlyar, K. Pingali, and P. Stodghill, Solving alignment using elementary linear algebra, Proc. Seventh Ann. Workshop Lang. Compilers for Parallel Computing, Ithaca, New York (1994).
26. M. F. P. O'Boyle, L. Kervella, and F. Bodin, Synchronization mininimization in a SPMD execution model, J. Parallel Distribut. Comput., 29:196-210 (1995).