Publication:
Data Parallel Performance Optimizations Using Array Aliasing

Thumbnail Image

Date

1997

Published Version

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Hu, Y. Charlie and S. Lennart Johnsson. 1997. Data Parallel Performance Optimizations Using Array Aliasing. Harvard Computer Science Group Technical Report TR-13-97.

Research Data

Abstract

The array aliasing mechanism provided in the Connection Machine Fortran (CMF) language and run{time system provides a unique way of identifying the memory address spaces local to processors within the global address space of distributed memory architectures, while staying in the data parallel programming paradigm. We show how the array aliasing feature can be used effectively in optimizing communication and computation performance. The constructs we present occur frequently in many scientific and engineering applications, and include various forms of aggregation and array reshaping through array aliasing. The effectiveness of the optimization techniques is demonstrated on an implementation of Anderson's hierarchical O(N) N-body method.

Description

Other Available Sources

Keywords

Data parallel programming, array aliasing, hierarchical N-body methods

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Referenced By

Related Stories