Run-time characterization of irregular accesses applied to parallelization of irregular reductions

Proceedings of the International Conference on Parallel Processing Workshops

Volumn 2001-January, Issue , 2001, Pages 17-22

  Singh, D E ^a   Rivera, F F ^a   Martin M J ^b  

^a UNIVERSITY OF SANTIAGO DE COMPOSTELA   (Spain)

^b UNIVERSITY OF A CORUÑA   (Spain)

Author keywords

Application software; Computer science; Costs; Data structures; Kernel; Libraries; Polarization; Proposals; Runtime; Sparse matrices

Indexed keywords

COMPUTER SCIENCE; COSTS; DATA STRUCTURES; LIBRARIES; POLARIZATION;

IRREGULAR REDUCTIONS; KERNEL; MEMORY OVERHEADS; PARALLELIZATIONS; PROPOSALS; RUNTIMES; SCIENTIFIC AND ENGINEERING APPLICATIONS; SPARSE MATRICES;

APPLICATION PROGRAMS;

EID: 35348812808     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2001.951841     Document Type: Conference Paper

References (13)

1. Matrix Market. http://math.nist.gov/MatrixMarket.
2. Tim Davis Collec. http://www.cise.ufl.edu/~davis/sparse.
3. I. S. Duff, R. G. Grimes, and J. G. Lewis. Users' Guide for the Harwell-Boeing Sparse Matrix Collection, Oct. 1992.
4. R. Eigenmann, J. Hoeflinger, and D. Padua. On the automatic parallelization of the Perfect Benchmarks. IEEE Trans. on Parall. and Distr. Systems, 9(1):5-23, Jan. 1998.
5. M. W. H. et al. Maximizing multiprocessor performance with the SUIF compiler. Computer, 29(12):84, Dec. 1996.
6. R. B. et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, 1994.
7. W. B. et al. Parallel programming with polaris. Computer, 29(12):78, Dec. 1996.
8. L. Greengard. The Rapid Evolution of Potential Fields in Particle Systems. M.I.T. Press, 1988.
9. E. Gutierrez, O. Plata, and E. Zapata. A compiler method for the parallel execution of of irregular reductions on scalable shared memory multiprocessors. In Proceedings of the 2000 ACM International Conference on Supercomputing.
10. D. E. Singh, M. J. Martn, and F. F. Rivera. The envelope of a digital curve based on dominant points. Lecture Notes in Computer Science, 1953:452-463, 2000.
11. R. V. Hanxleden. Handling irregular problems with Fortran D - A preliminary report. In Proceedings of the Fourth Workshop on Compilers for Parallel Computers, Delft, The Netherlands, Dec. 1993.
12. R. von Hanxleden and K. Kennedy. Give-n-take - a balanced code placement framework. In Proceedings of the SIGPLAN '94 Conference on Programming Language Design and Implementation, pages 107-120. ACM Press, June 1994.
13. Y. Yan, X. Zhang, and Z. Zhang. Cacheminer: A runtime approach to exploit cache locality on SMP. IEEE Trans. on Parall. and Distr. Systems, 11(4):357-374, 2000.