Exploiting memory affinity in OpenMP through schedule reuse

Authors:
D. S. Nikolopoulos;E. Artiaga;E. Ayguadé;J. Labarta
Affiliations:
University of Illinois at Urbana-Champaign, Urbana, IL,;Technical University of Catalunya (UPC), Barcelona, Spain;Technical University of Catalunya (UPC), Barcelona, Spain;Technical University of Catalunya (UPC), Barcelona, Spain
Venue:
ACM SIGARCH Computer Architecture News - Special Issue: PACT 2001 workshops
Year:
2001

Citing 4
Cited 5

Data distribution support on distributed shared memory multiprocessors

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Is data distribution necessary in OpenMP?

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Extending OpenMP for NUMA machines

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
The trade-off between implicit and explicit data distribution in shared-memory programming paradigms

ICS '01 Proceedings of the 15th international conference on Supercomputing

Towards optimisation of openMP codes for synchronisation and data reuse

International Journal of High Performance Computing and Networking
Asynchronous execution of OpenMP code

ICCS'03 Proceedings of the 2003 international conference on Computational science
Scalable parallel AMG on ccNUMA machines with OpenMP

Computer Science - Research and Development
Characterizing and mitigating work time inflation in task parallel programs

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Characterizing and mitigating work time inflation in task parallel programs

Scientific Programming - Selected Papers from Super Computing 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explore the idea of reusing loop schedules to improve the scalability of numerical codes in shared-memory architectures with non-uniform memory access. The main objective is to implicitly construct affinity links between threads and data accesses and reuse them as much as possible along the execution of the program. These links are created through the definition and reuse of iteration schedules which are either defined statically by the user or created dynamically at run time. The paper does not include a formal proposal of OpenMP extensions but includes some experiments showing the usefulness of constructing affinity links in both regular and irregular codes.