The University of Southampton
University of Southampton Institutional Repository

Precise analysis of array usage in scientific programs

Precise analysis of array usage in scientific programs
Precise analysis of array usage in scientific programs
The automatic transformation of sequential programs for efficient execution on parallel computers involves a number of analyses and restructurings of the input. Some of these analyses arebased on computing array sections, a compact description of a range of array elements.Array sections describe the set of array elements that are either read or written by programstatements. These sections can be compactly represented using shape descriptors such asregular sections, simple sections, or generalized convex regions. However, binary operationssuch as Union performed on these representations do not satisfy a straightforward closureproperty, e.g., if the operands to Union are convex, the result may be nonconvex. Approximations are resorted to in order to satisfy this closure property. These approximations introduceimprecision in the analyses and, furthermore, the imprecisions resulting from successive operations have a cumulative effect. Delayed merging is a technique suggested and used in someof the existing analyses to minimize the effects of approximation. However, this techniquedoes not guarantee an exact solution in a general setting. This article presents a generalizedtechnique to precisely compute Union which can overcome these imprecisions. ©
Manjunathaiah, M
f005ed67-3e8e-4f4e-ab61-9bd8f2d78022
Nicole, D A
0aca6dd1-833f-4544-b7a4-58fb91c7395a
Manjunathaiah, M
f005ed67-3e8e-4f4e-ab61-9bd8f2d78022
Nicole, D A
0aca6dd1-833f-4544-b7a4-58fb91c7395a

Manjunathaiah, M and Nicole, D A (1997) Precise analysis of array usage in scientific programs. Scientific Programming, 6, [312872]. (doi:10.1155/1997/312872).

Record type: Article

Abstract

The automatic transformation of sequential programs for efficient execution on parallel computers involves a number of analyses and restructurings of the input. Some of these analyses arebased on computing array sections, a compact description of a range of array elements.Array sections describe the set of array elements that are either read or written by programstatements. These sections can be compactly represented using shape descriptors such asregular sections, simple sections, or generalized convex regions. However, binary operationssuch as Union performed on these representations do not satisfy a straightforward closureproperty, e.g., if the operands to Union are convex, the result may be nonconvex. Approximations are resorted to in order to satisfy this closure property. These approximations introduceimprecision in the analyses and, furthermore, the imprecisions resulting from successive operations have a cumulative effect. Delayed merging is a technique suggested and used in someof the existing analyses to minimize the effects of approximation. However, this techniquedoes not guarantee an exact solution in a general setting. This article presents a generalizedtechnique to precisely compute Union which can overcome these imprecisions. ©

This record has no associated files available for download.

More information

Published date: 30 December 1997
Venue - Dates: Scientific Programming, 1970-01-01
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 250894
URI: http://eprints.soton.ac.uk/id/eprint/250894
PURE UUID: f533e89d-b9b4-482f-800b-2b2284d0c78b

Catalogue record

Date deposited: 30 Sep 1999
Last modified: 14 Mar 2024 05:06

Export record

Altmetrics

Contributors

Author: M Manjunathaiah
Author: D A Nicole

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×