Exchange of messages of different sizes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1457 LNCS, Issue , 1998, Pages 194-205

  Goldman, A ^a   Trystram, D ^a   Peters, J ^b  

^a LMC   (France)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INTERCONNECTION NETWORKS (CIRCUIT SWITCHING); PARALLEL PROCESSING SYSTEMS;

ASYNCHRONOUS SYSTEM; COMPLEXITY RESULTS; COST MODELING; DIFFERENT SIZES; EXCHANGE ALGORITHMS; EXCHANGE PROBLEMS; NP COMPLETE; PARALLEL SYSTEM;

APPROXIMATION ALGORITHMS;

EID: 29244474457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0018539     Document Type: Conference Paper

References (19)

1. P. Barcaccia, M. Bonuccelli, and M. Ianni. Miuimun length scheduling of precedence constrained messages in distributed systems. In EUROPAR'96, volume LNCS 1123, pages 594-601, 1996.
2. 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.
3. 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.
4. 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. (Pubitemid 11506015)
5. M.A. Bonnccelli. A polynomial time optimal algorithm for satellite-switched time-division multiple access satellite communications with general switching modes. SIAM J. Disc. Math., 4:28-35, February 1991.
6. J. Briat, I. Ginzburg, and M. Pasin. Athapascan-0b reference manual. Technical Report, Apache, LMC - IMAG, Grenoble, France, 1997.
7. H. Choi and S.L. Hakimi. Data transfer in networks. Algorithmica, 3:223-245, 1988.
8. 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.
9. 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.
10. A. Goldman, J. Peters, and D. Trystram. Exchange of messages of different sizes. manuscript, www-apache.imag.fr/apache/.
11. T. Gonzales and S. Sahni. Open shop scheduling to minimize finish time. Journal of the Association for Computing Machinery, 4(23):665679, October 1976.
12. T.F. Gonzales. Multimessage multicasting with forwarding. Technical Report, UCSD Department of Computer Science, TRCS-96-16.
13. T.F. Gonzales. Multi-message multicasting. In IRREGULAR'96, volume LNCS 1117, pages 217-228, 1996.
14. 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.
15. 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.
16. 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.
17. 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.
18. R. Tahkur and A. Choudhary. All-to-all communication on meshes with wormhole routing. In IPPS'94, pages 561-565, 1994.
19. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.