loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96)
Optimizing communication for array operations on message-passing multicomputers
Beijing, CHINA
June 12-June 14
ISBN: 0-8186-7460-1
ASCII Text
x 
 
A. Eberhart, J. Li, "Optimizing communication for array operations on message-passing multicomputers," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 242, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.1996.508988,
author = {A. Eberhart and J. Li},
title = {Optimizing communication for array operations on message-passing multicomputers},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {1996},
issn = {1087-4089},
pages = {242},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.1996.508988},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Optimizing communication for array operations on message-passing multicomputers
SN - 1087-4089
SP
EP
A1 - A. Eberhart,
A1 - J. Li,
PY - 1996
KW - parallel languages; message passing; communication complexity; parallel programming; multiprocessing systems; array operations; message-passing multicomputers; data-parallel languages; distributed-memory multicomputers; scalability; communication patterns; scheduling algorithm; contention-free data transfer; network resources
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
A. Eberhart, Dept. of Comput. Sci., Portland State Univ., OR, USA
J. Li, Dept. of Comput. Sci., Portland State Univ., OR, USA
Whole array operations and array section operations are important features of many data-parallel languages. Efficient implementation of these operations on distributed-memory multicomputers is critical to the scalability and high-performance of data-parallel programs. We present an approach for analyzing communication patterns induced by array operations and for scheduling message flow based on the information. Our scheduling algorithm guarantees contention-free data transfer and utilizes network resources optimally. It incurs little overhead and is suitable to be used in compilers and in runtime libraries. We also present simulation results that demonstrate the algorithm's superiority to the asynchronous transfer mode that is commonly used for this type of communication.
Index Terms:
parallel languages; message passing; communication complexity; parallel programming; multiprocessing systems; array operations; message-passing multicomputers; data-parallel languages; distributed-memory multicomputers; scalability; communication patterns; scheduling algorithm; contention-free data transfer; network resources
Citation:
A. Eberhart, J. Li, "Optimizing communication for array operations on message-passing multicomputers," ispan, pp.242, 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), 1996
Usage of this product signifies your acceptance of the Terms of Use.