Runtime characterisation of irregular accesses applied to parallelisation of irregular reductions
by David E. Singh, Maria J. Martin, Francisco F. Rivera
International Journal of Computational Science and Engineering (IJCSE), Vol. 1, No. 1, 2005

Abstract: Irregular reduction operations are the core of many large scientific and engineering applications. There are, in the literature, different methods to solve these operations in parallel. In this paper we discuss a new technique which improves performance significantly, both in terms of execution time and memory overhead. These improvements are achieved in the preprocessing as well as in the resulting parallel code. Our proposal is based on the use of the Irregular Access Region Descriptor (IARD). This data structure is a compact characterisation of indirectly accessed arrays that can be used for the efficient parallelisation of a wide spectrum of irregular codes. In this paper we present its application to parallelise irregular reduction operations on a shared memory machine. We compare our proposal with two other competitive solutions.

Online publication date: Thu, 02-Feb-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com