Runtime characterisation of irregular accesses applied to parallelisation of irregular reductions

International Journal of Computational Science and Engineering

Volumn 1, Issue 1, 2005, Pages 1-14

  Singh, David E ^a   Martin, Maria J ^b   Rivera, Francisco F ^c  

^a UNIVERSIDAD CARLOS III DE MADRID   (Spain)

^b UNIVERSITY OF A CORUÑA   (Spain)

^c UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

Author keywords

compiler analysis; irregular codes; irregular reductions; runtime parallelisation; shared memory system

Indexed keywords

EID: 77954011474     PISSN: 17427185     EISSN: 17427193     Source Type: Journal    
DOI: 10.1504/IJCSE.2005.008906     Document Type: Article

References (20)

1. Barrett, R. and Berry, M. (1994) Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia.
2. Blume, W., Doallo, R., Eigenmann, R., Grout, J., Hoeflinger, J., Lawrence T., Lee, J., Padua, D., Paek, Y., Pottenger, B., Rauchwerger, L. and Tu, P. (1996) ‘Parallel programming with polaris’, Computer, December, Vol. 29, No. 12, pp.78–82.
3. Brooks, B.R., Bruccoleri, R.E., Olafson, B.D., States, D.J., Swaminathan, S. and Karplus, M. (1983) ‘CHARMM: a program for macromolecular energy minimization and dynamics calculations’, J. Comput. Chem., Vol. 4, No. 2, pp.187–217.
4. Duff, I.S., Grimes, R.G. and Lewis, J.G. (1992a) Users' Guide for the Harwell-Boeing Sparse Matrix Collection, 1st ed., October, Research and Technology Division, Boeing Computer Services, Mail Stop 7L-21, P.O. Box 24236, Seattle, WA 98124–0346, USA.
5. Duff, I.S., Marrone, M. and Radicati, G. (1992b) ‘A proposal for user level sparse BLAS’, CERFAcS, Tech. Rep. TR/PA/92/85 92., Toulouse, France, [Online]. Available: ftp://seamus.cc.rl.ac.uk/pub/reports/dmrCERFACS9285.ps.Z.
6. Eigenmann, R., Hoeflinger, J. and Padua, D. (1998) ‘On the automatic parallelization of the perfect benchmarks’, IEEE Transactions on Parallel and Distributed Systems, January, Vol. 9, No. 1, pp.5–23, [Online]. Available: http://www.computer.org/tpds/td1998/l0005abs.htm.
7. Greengard, L. (1988) The Rapid Evolution of Potential Fields in Particle Systems, MIT Press, Cambridge, USA.
8. Gutierrez, E., Plata, O. and Zapata, E. (2000) ‘A compiler method for the parallel execution of irregular reductions on scalable shared memory multiprocessors’, Proceedings of the 2000 ACM International Conference on Supercomputing, Santa Fe, NM, pp.78–87.
9. Hall, M.W., Amarasinghe, S.P., Murphy, B.R., Liao, S-W. and Lam, M.S. (1995) ‘Detecting coarse-grain parallelism using an interprocedural parallelizing compiler’, in Karin, S., (Ed.): Proceedings of the 1995 ACM/IEEE Super-computing Conference, December 3–8, San Diego Convention Center, ACM Press and IEEE Computer Society Press, San Diego, CA, USA.
10. Hall, M.W., Anderson, J.M., Amarasinghe, S.P., Murphy, B.R., Liao, S-W., Bugnion, E. and Lam, M.S. (1996) ‘Maximizing multiprocessor performance with the SUIF compiler’, Computer, December, Vol. 29, No. 12, pp.84–89.
11. Knijnenburg, P. and Wijsho, H. (1994) On Improving Data Locality in Sparse Matrix Computations, Technical Report 94–15, Leiden University, Available online: http://www.liacs.nl/TechRep/1994/tr94–15.ps.gz.
12. Mellor-Crummey, J., Whalley, D. and Kennedy, K. (1999) ‘Improving memory hierarchy performance for irregular applications’, Proc. Conference on Supercomputing, pp.425–433.
13. Mitchell, N., Carter, L. and Ferrante, J. (1999) ‘Localizing non-affine array references’, Proc. International Conference on Parallel Architectures and Compilation Techniques, pp.192–202.
14. Singh, D.E., Martin, M.J. and Rivera, F.F. (2000) The Envelope of a Digital Curve Based on Dominant Points, Lecture Notes in Computer Science, Vol. 1953, pp.452–463.
15. von Hanxleden, R. (1993) ‘Handling irregular problems with Fortran D-A preliminary report’, Proceedings of the Fourth Workshop on Compilers for Parallel Computers, December, Delft, The Netherlands.
16. von Hanxleden, R. and Kennedy, K. (1994) ‘Give-n-take a balanced code placement framework’, Proceedings of the SIGPLAN'94 Conference on Programming Language Design and Implementation (PLDI'94), June, ACM SIGPLAN Notices, ACM Press, Orlando, Florida, pp.107–120.
17. Yan, Y., Zhang, X. and Zhang, Z. (2000) ‘Cacheminer: a runtime approach to exploit cache locality on SMP’, IEEE Transactions on Parallel and Distributed Systems, Vol. 11, No. 4, pp.357–375.
18. Yu, H. and Rauchwerger, L. (2000) ‘Adaptive reduction parallelization techniques’, Conference Proceedings of the 2000 International Conference on Supercomputing, 8–11th May, ACM SIGARCH, Santa Fe, New Mexico, pp.66–77.
19. \Matrix market collection,” http://math.nist.gov/MatrixMarket.
20. \Tim davis: Uf sparse matrix collection,” http://www.cise.ufl.edu/research/sparse.