This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Reduction Operations on a Distributed Memory Machine with a Reconfigurable Interconnection Network
July 1992 (vol. 3 no. 4)
pp. 500-505
ASCII Text
x 
 
S. Miguet, Y. Robert, "Reduction Operations on a Distributed Memory Machine with a Reconfigurable Interconnection Network," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 500-505, July, 1992.
 
 
BibTex
x
 
@article{ 10.1109/71.149967,
author = {S. Miguet and Y. Robert},
title = {Reduction Operations on a Distributed Memory Machine with a Reconfigurable Interconnection Network},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {3},
number = {4},
issn = {1045-9219},
year = {1992},
pages = {500-505},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.149967},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Reduction Operations on a Distributed Memory Machine with a Reconfigurable Interconnection Network
IS - 4
SN - 1045-9219
SP500
EP505
EPD - 500-505
A1 - S. Miguet,
A1 - Y. Robert,
PY - 1992
KW - Index Termsdistributed memory machine; reconfigurable interconnection network; reductionoperations; interconnection graph; transputer-based networks; graph theory;multiprocessor interconnection networks
VL - 3
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Performing reduction operations with distributed memory machines whose interconnection networks are reconfigurable is considered. The focus is on machines whose interconnection graph can be configured as any graph of maximum degree d. The best way of interconnecting the p processors as a function of p,d and some problem- and machine-dependent parameters that characterize the ratio communication/arithmetic for the reduction operation are discussed. Experiments on transputer-based networks are in good accordance with the theoretical results.

[1] G. A. Geist and M. T. Heath, "Matrix factorization on a hypercube multiprocessor," inHypercube Multiprocessors 1986, M. T. Heath, Ed., SIAM, 1986, pp. 161-180.
[2] M.T. Heath and C. H. Romine, "Parallel solution of triangular systems on distributed-memory multiprocessors,"SIAM J. Sci. Statist. Comput., vol. 9, no. 3, pp. 558-600, 1988.
[3] C. T. Ho and S. L. Johnsson, "Optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, no. 9 pp. 1249-1268, 1989.
[4] G. Li and T. F. Coleman, "A parallel triangular solver for a distributed memory multiprocessor,"SIAM J. Sci. Statist. Comput., vol. 9, no. 3, pp. 485-502, 1988.
[5] S. Miguet and Y. Robert, "Reduction operations on a distributed memory machine with a reconfigurable interconnection network," Research Rep. LIP-IMAG 90-28, ENS Lyon, 1990.
[6] O. A. McBryan and E. F. Van de Velde, "Hypercube algorithms and implementations,"SIAM J. Scientif. Statist. Comput., vol. 8, no. 2, pp. s227-s287, Mar. 1987.
[7] D. A. Nicole, "Esprit Project 1085, Reconfigurable Transputer processor architecture," inProc. CONPAR 88, C. R. Jesshopeet al., Eds. Cambridge, MA: Cambridge University Press, 1989, pp. 81-89.
[8] Y. Saad and M. H. Schultz, "Data communication in parallel architectures,"Parallel Comput., vol. 11, pp. 131-150, 1989.
[9] Q. S. Stout and B. Wagar, "Intensive hypercube communication," Tech. Rep. CRL-TR-9-87, Comput. Res. Lab., Univ. Michigan, 1987.

Index Terms:
Index Termsdistributed memory machine; reconfigurable interconnection network; reductionoperations; interconnection graph; transputer-based networks; graph theory;multiprocessor interconnection networks
Citation:
S. Miguet, Y. Robert, "Reduction Operations on a Distributed Memory Machine with a Reconfigurable Interconnection Network," IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 4, pp. 500-505, July 1992, doi:10.1109/71.149967
Usage of this product signifies your acceptance of the Terms of Use.