Abstract
This paper presents a new parallelization method for an efficient implementation of unstructured array reductions on shared memory parallel machines with OpenMP. This method is strongly related to parallelization techniques for irregular reductions on distributed memory machines as employed in the context of High Performance Fortran. By exploiting data locality, synchronization is minimized without introducing severe memory or computational overheads as observed with most existing shared memory parallelization techniques. ?© 2000 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Benkner, S., & Brandes, T. (2000). Efficient parallelization of unstructured reductions on shared memory parallel architectures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1800 LNCS, pp. 435–442). Springer Verlag. https://doi.org/10.1007/3-540-45591-4_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
