Abstract
In this paper, we study the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of all-to-all (or complete exchange problems in asynchronous systems with a linear cost model and messages of arbitrary sizes. We extend previous complexity results to show that the general asynchronous problems are NP-complete. We present several approximation algorithms and determine which heuristics are best suited to several parallel systems. We conclude with experimental results that show that our algorithms outperform the native all-to-all exchange algorithm on an IBM SP2 when the number of processors is odd.
This work was done when the author was visiting LMC-IMAG in 1997.
Preview
Unable to display preview. Download preview PDF.
References
P. Barcaccia, M. Bonuccelli, and M. Ianni. Minimun length scheduling of precedence constrained messages in distributed systems. In EUROPAR'96, volume LNCS 1123, pages 594–601, 1996.
M. Barnett, L. Shuler, R. van de Geijn, S. Gupta, D.G. Payne, and J. Watts. Interprocessor collective communication library. In Proceedings of the Scalable High Performance Computing Conference, pages 357–364, 1994.
S.H. Bokhari. Multiphase complete exchange on a circuit switched hypercube. In Proceedings of the 1991 International Conference on Parallel Procesing, volume I, pages 525–529, 1991.
G. Bongiovanni, D. Coppersmith, and C. Wong. An optimum time slot assignment algorithm for an ss/tdma system with variable number of transponders. IEEE Transactions on Communications, 29:721–726, 1981.
M.A. Bonuccelli. A polynomial time optimal algorithm for satellite-switched timedivision multiple access satellite communications with general switching modes. SIAM J. Disc. Math., 4:28–35, February 1991.
J. Briat, I. Ginzburg, and M. Pasin. Athapascan-Ob reference manual. Technical Report, Apache, LMC — IMAG, Grenoble, France, 1997.
H. Choi and S.L. Hakimi. Data transfer in networks. Algorithmica, 3:223–245, 1988.
E.G. Coffman, M.R. Garey, D.S. Johnson, and A.S. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744–780, August 1985.
P. Fraigniaud and J.G. Peters. Structured communication in cut-through routed torus networks. Technical Report TR 97-05, School of Computing Science, Simon Fraser Univ, 1997.
A. Goldman, J. Peters, and D. Trystram. Exchange of messages of different sizes. manuscript, www-apache.imag.fr/apache/.
T. Gonzales and S. Sahni. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 4(23):665–679, October 1976.
T.F. Gonzales. Multimessage multicasting with forwarding. Technical Report, UCSD Department of Computer Science, TRCS-96-16.
T.F. Gonzales. Multi-message multicasting. In IRREGULAR'96, volume LNCS 1117, pages 217–228, 1996.
Y.S. Hwang, R. Das, J. Saltz, M. Hodoscek, and B. Brooks. Parallelizing molecular dynamics programs for distributed memory machines. IEEE Computational Science & Engineering, 2(2):18–29, 1995.
J.G. Peters and C.C. Spencer. Global communication on circuit-switched toroidal meshes. Technical Report TR 97-02, School of Computing Science, Simon Fraser Univ., 1997. to appear in PPL.
S. Ranka, R.V Shankar, and K.A. Alsabti. Many-to-many personalized communication with bounded traffic. In The Fifth Symposium on the Frontiers of Massively Parallel Computation, pages 20–27, February 1995.
G.N Rouskas and V. Sivaraman. On the design of optimal tdm schedules for broadcast wdm networks with arbitrary transceiver tuning latencies. In INFOCOM'96, pages 1217–1224, 1996.
R. Tahkur and A. Choudhary. All-to-all communication on meshes with wormhole routing. In IPPS'94, pages 561–565. 1994.
L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103–111, August 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldman, A., Trystram, D., Peters, J. (1998). Exchange of messages of different sizes. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018539
Download citation
DOI: https://doi.org/10.1007/BFb0018539
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64809-3
Online ISBN: 978-3-540-68533-3
eBook Packages: Springer Book Archive