(Enter summary)
Abstract: An important component of parallel programs with distributed data structures is local address generation
for various index patterns. In this paper we present a general approach as well as two specific algorithms
for common problems to perform this task quickly on distributed arrays. Our algorithms usually run in
O(joutputj) time, which is optimal. We have implemented our algorithms. When the problem size is small,
they perform as well as or better than naive algorithms. When the problem size is ... (Update)
Active bibliography (related documents): More All
0.0: Runtime Support for In-Core and Out-of-Core Data-Parallel Programs - Thakur (1995)
(Correct)
0.0: Compilation Techniques for Parallel Systems - Gupta, Pande, Psarris, Sakar (1999)
(Correct)
0.0: High Level Support for Distributed High Performance Computing - Laure (2001)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
BibTeX entry: (Update)
@techreport{ weisser95efficient,
author = "Deborah K. Weisser",
title = "Efficient Generation of Local Index Sets for Distributed Arrays",
number = "CSD-96-895",
pages = "14",
year = "1995",
url = "citeseer.ist.psu.edu/736471.html" }
Citations (may not include all citations):
835
High Performance Fortran Language Specification Version
- Fortran - 1992
341
Parallel programming in split-c
- Culler, Dusseau et al. - 1993
78
Generating local addresses and communication sets for data-p..
- Chatterjee, Gilbert et al. - 1993
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC