Scientific Programming

Scientific Programming / 2003 / Article
Special Issue

OpenMP

View this Special Issue

Open Access

Volume 11 |Article ID 379739 | 16 pages | https://doi.org/10.1155/2003/379739

Scaling Non-Regular Shared-Memory Codes by Reusing Custom Loop Schedules

Received12 May 2003
Accepted12 May 2003

Abstract

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 affinity links between threads and data, by devising loop schedules that achieve balanced work distribution within irregular data spaces and reusing them as much as possible along the execution of the program for better memory access locality. This transformation provides a great deal of flexibility in optimizing locality, without compromising the simplicity of the shared-memory programming paradigm. In particular, the programmer does not need to explicitly distribute data between processors. The paper presents practical examples from real applications and experiments showing the efficiency of the approach.

Copyright © 2003 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

31 Views | 240 Downloads | 2 Citations
 PDF  Download Citation  Citation
 Order printed copiesOrder