article

Exploiting memory affinity in OpenMP through schedule reuse

Authors:

D. S. Nikolopoulos,

E. Artiaga,

E. Ayguadé,

J. LabartaAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 29, Issue 5

Pages 49 - 55

https://doi.org/10.1145/563647.563657

Published: 01 December 2001 Publication History

Get Access

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.

References

[1]

J. Bircsak, P. Craig, R. Crowell, Z. Cvetanovic, J. Harris, C. Nelson, and C. Offner. Extending OpenMP for NUMA Machines. In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.

Digital Library

Google Scholar

[2]

R. Chandra, D. Chen, R. Cox, D. Maydan, N. Nedelijkovic, and J. Anderson. Data Distribution Support on Distributed Shared Memory Multiprocessors. In Proc. of the 1997 ACM Conference on Programming Languages Design and Implementation (PLDI'97), pages 334-345, Las Vegas, Nevada, June 1997.

Digital Library

Google Scholar

[3]

D. Nikolopoulos, E. Ayguadé, J. Labarta, T. Papatheodorou, and C. Polychronopoulos. The Trade-Off between Implicit and Explicit Data Distribution in Shared-Memory Programming Paradigms. In Proc. of the 15th ACM International Conference on Supercomputing (ICS'2001), Sorrento, Italy, June 2001.

Digital Library

Google Scholar

[4]

D. Nikolopoulos, T. Papatheodorou, C. Polychronopoulos, J. Labarta, and E. Ayguadé. Is Data Distribution Necessary in OpenMP ? In Proc. of the IEEE/ACM Supercomputing'2000: High Performance Networking and Computing Conference (SC'2000), Dallas, Texas, November 2000.

Digital Library

Google Scholar

[5]

V. Schuster and D. Miles. Distributed OpenMP, Extensions to OpenMP for SMP Clusters. In Proc. of the Workshop on OpenMP Applications and Tools (WOM-PAT'2000), San Diego, California, July 2000.

Google Scholar

[6]

P. White. IFS Documentation: Part VI, Technical and Computational Procedures. Technical Report CY21R4, European Centre for Medium-Range Forecasts, February 2000.

Google Scholar

Cited By

View all

Guo XHan H(2019)The Research of a Memory Accesses Behavior on Non-Uniform Memory Access Architecture2019 10th International Conference on Information Technology in Medicine and Education (ITME)10.1109/ITME.2019.00174(763-766)Online publication date: Aug-2019
https://doi.org/10.1109/ITME.2019.00174
Guo XHan H(2018)The Research of Several Situations About Memory Accessing on Non-Uniform Memory Access Architecture2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)10.1109/ICIS.2018.8466393(744-747)Online publication date: Jun-2018
https://doi.org/10.1109/ICIS.2018.8466393
Guo XHan H(2017)A good data allocation strategy on non-uniform memory access architecture2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)10.1109/ICIS.2017.7960048(527-530)Online publication date: May-2017
https://doi.org/10.1109/ICIS.2017.7960048
Show More Cited By

Index Terms

Exploiting memory affinity in OpenMP through schedule reuse
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Multiple instruction, multiple data
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Process management

Recommendations

Parallel Data Reuse Theory for OpenMP Applications
SNPD '09: Proceedings of the 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing

The development of multi-core processor technology makes parallel programming become more and more popular. Similar to serial programs on single-core platforms, the locality optimization of parallel programs is and will be a hot-spot of research owing ...
Scaling non-regular shared-memory codes by reusing custom loop schedules
OpenMP

In this paper we explore the idea of customizing and reusing loop schedules to improve the scalability of non-regular numerical codes in shared-memory architectures with non-uniform memory access latency. The main objective is to implicitly setup ...
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs

Clusters of SMPs are hybrid-parallel architectures that combine the main concepts of distributed-memory and shared-memory parallel machines. Although SMP clusters are widely used in the high performance computing community, there exists no single ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 29, Issue 5

Special Issue: PACT 2001 workshops

December 2001

91 pages

ISSN:0163-5964

DOI:10.1145/563647

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2001

Published in SIGARCH Volume 29, Issue 5

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
387
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guo XHan H(2019)The Research of a Memory Accesses Behavior on Non-Uniform Memory Access Architecture2019 10th International Conference on Information Technology in Medicine and Education (ITME)10.1109/ITME.2019.00174(763-766)Online publication date: Aug-2019
https://doi.org/10.1109/ITME.2019.00174
Guo XHan H(2018)The Research of Several Situations About Memory Accessing on Non-Uniform Memory Access Architecture2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS)10.1109/ICIS.2018.8466393(744-747)Online publication date: Jun-2018
https://doi.org/10.1109/ICIS.2018.8466393
Guo XHan H(2017)A good data allocation strategy on non-uniform memory access architecture2017 IEEE/ACIS 16th International Conference on Computer and Information Science (ICIS)10.1109/ICIS.2017.7960048(527-530)Online publication date: May-2017
https://doi.org/10.1109/ICIS.2017.7960048
Drebes APop AHeydemann KCohen ADrach NZaks AMendelson BRauchwerger LHwu W(2016)Scalable Task Parallelism for NUMAProceedings of the 2016 International Conference on Parallel Architectures and Compilation10.1145/2967938.2967946(125-137)Online publication date: 11-Sep-2016
https://dl.acm.org/doi/10.1145/2967938.2967946
Madarkar JChand VReddy PArora H(2016)A Novel Algorithmic Approach for an Automatic Data Placement for NUMA Based DesignProcedia Computer Science10.1016/j.procs.2016.02.04478:C(276-283)Online publication date: 1-Mar-2016
https://dl.acm.org/doi/10.1016/j.procs.2016.02.044
Pophale SHernandez O(2016)Evaluating OpenMP Affinity on the POWER8 ArchitectureOpenMP: Memory, Devices, and Tasks10.1007/978-3-319-45550-1_3(35-46)Online publication date: 21-Sep-2016
https://doi.org/10.1007/978-3-319-45550-1_3
Lifflander JKrishnamoorthy SKale LDamkroger TDongarra J(2014)Optimizing data locality for fork/join programs using constrained work stealingProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC.2014.75(857-868)Online publication date: 16-Nov-2014
https://dl.acm.org/doi/10.1109/SC.2014.75
Olivier Sde Supinski BSchulz MPrins J(2013)Characterizing and mitigating work time inflation in task parallel programsScientific Programming10.1155/2013/89859721:3-4(123-136)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1155/2013/898597
Olivier Sde Supinski BSchulz MPrins JHollingsworth J(2012)Characterizing and mitigating work time inflation in task parallel programsProceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis10.5555/2388996.2389085(1-12)Online publication date: 10-Nov-2012
https://dl.acm.org/doi/10.5555/2388996.2389085
Olivier Sde Supinski BSchulz MPrins J(2012)Characterizing and mitigating work time inflation in task parallel programsProceedings of the 2012 International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC.2012.27(1-12)Online publication date: 10-Nov-2012
https://dl.acm.org/doi/10.1109/SC.2012.27
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Parallel Data Reuse Theory for OpenMP Applications

Scaling non-regular shared-memory codes by reusing custom loop schedules

Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs