In a distributed-memory parallel-processing system, the overhead of data transfer among the processors is so large that it is important to reduce the data transfer. We consider the data transfer in evaluating an expression consisting of data distributed among the processors. We propose some algorithms which assign the operators in the expression to the processors so as to minimize the number or the cost of data transfers, on the condition that the data allocation to the processors is given. The basic algorithm is given at first, followed by some variations.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Hiroshi OHTA, Kousuke SAKODA, Koichiro ISHIHARA, "Minimizing the Data Transfer in Evaluating an Expression in a Distributed-Memory Parallel-Processing System" in IEICE TRANSACTIONS on Information,
vol. E77-D, no. 3, pp. 288-298, March 1994, doi: .
Abstract: In a distributed-memory parallel-processing system, the overhead of data transfer among the processors is so large that it is important to reduce the data transfer. We consider the data transfer in evaluating an expression consisting of data distributed among the processors. We propose some algorithms which assign the operators in the expression to the processors so as to minimize the number or the cost of data transfers, on the condition that the data allocation to the processors is given. The basic algorithm is given at first, followed by some variations.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e77-d_3_288/_p
Copy
@ARTICLE{e77-d_3_288,
author={Hiroshi OHTA, Kousuke SAKODA, Koichiro ISHIHARA, },
journal={IEICE TRANSACTIONS on Information},
title={Minimizing the Data Transfer in Evaluating an Expression in a Distributed-Memory Parallel-Processing System},
year={1994},
volume={E77-D},
number={3},
pages={288-298},
abstract={In a distributed-memory parallel-processing system, the overhead of data transfer among the processors is so large that it is important to reduce the data transfer. We consider the data transfer in evaluating an expression consisting of data distributed among the processors. We propose some algorithms which assign the operators in the expression to the processors so as to minimize the number or the cost of data transfers, on the condition that the data allocation to the processors is given. The basic algorithm is given at first, followed by some variations.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Minimizing the Data Transfer in Evaluating an Expression in a Distributed-Memory Parallel-Processing System
T2 - IEICE TRANSACTIONS on Information
SP - 288
EP - 298
AU - Hiroshi OHTA
AU - Kousuke SAKODA
AU - Koichiro ISHIHARA
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E77-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1994
AB - In a distributed-memory parallel-processing system, the overhead of data transfer among the processors is so large that it is important to reduce the data transfer. We consider the data transfer in evaluating an expression consisting of data distributed among the processors. We propose some algorithms which assign the operators in the expression to the processors so as to minimize the number or the cost of data transfers, on the condition that the data allocation to the processors is given. The basic algorithm is given at first, followed by some variations.
ER -