Skip to content
Free planNo credit card requiredStart writing

article · 1997

Data Parallel Performance Optimizations Using Array Aliasing

Charlie Hu, S. Lennart Johnsson

Cited by 0Abstract and details only

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 demonstratedon an implementationof Anderson's hierarchicalO(N) N --body method. We also suggest a way of implementing the array aliasing feature in HPF by extending the semantics of the RESHAPE intrinsic function of Fortran 90 to include possible aliasing relationship between the parameter and returning arrays. Key words. Data pa...

Cite this paper

APA 7

Hu, C., & Johnsson, S. L. (1997). Data Parallel Performance Optimizations Using Array Aliasing.

MLA 9

Hu, Charlie, and S. Lennart Johnsson. “Data Parallel Performance Optimizations Using Array Aliasing.” 1997.

Chicago

Hu, Charlie, and S. Lennart Johnsson. 1997. “Data Parallel Performance Optimizations Using Array Aliasing.”

Harvard

Hu, C. and Johnsson, S.L. (1997) ‘Data Parallel Performance Optimizations Using Array Aliasing’.

BibTeX
@article{hu1997data,
  title = {{Data Parallel Performance Optimizations Using Array Aliasing}},
  author = {Hu, Charlie and Johnsson, S. Lennart},
  year = {1997}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.