Is data distribution necessary in OpenMP?

  • Authors:

  • Dimitrios S. Nikolopoulos;Theodore S. Papatheodorou;Constantine D. Polychronopoulos;Jesus Labarta;Eduard Ayguade/eacute/

  • Affiliations:

  • Department of Computer Engineering and Informatics, University of Patras, Greece;Department of Computer Engineering and Informatics, University of Patras, Greece;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign;Department of Computer Architecture, Technical University of Catalonia, Spain;Department of Computer Architecture, Technical University of Catalonia, Spain

  • Venue:
  • Proceedings of the 2000 ACM/IEEE conference on Supercomputing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper investigates the performance implications of data placement in OpenMP programs running on modern ccNUMA multiprocessors. Data locality and minimization of the rate of remote memory accesses are critical for sustaining high performance on these systems. We show that due to the low remote-to-local memory access latency ratio of state-of-the-art ccNUMA architectures, reasonably balanced page placement schemes-such as round-robin or random distribution of pages-incur modest performance losses. We also show that performance leaks stemming from suboptimal page placement schemes can be remedied with a smart user-level page migration engine. The main body of the paper describes how the OpenMP runtimeenvironment can use page migration for implementing implicit data distribution and redistribution schemes without programmer intervention. Our experimental results support the effectiveness of these mechanisms and provide a proof of concept that there is no need to introduce data distribution directives in OpenMP and warrant the portability of the programming model.